STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Journal of Computer Science and Technology
WDM Optical Interconnects with Recirculating Buffering and Limited Range Wavelength Conversion
IEEE Transactions on Parallel and Distributed Systems
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Approximating weighted matchings in parallel
Information Processing Letters
Coarse grained parallel algorithms for graph matching
Parallel Computing
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
Faster combinatorial algorithms for determinant and Pfaffian
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximate inference on planar graphs using loop calculus and belief propagation
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
The Journal of Machine Learning Research
Computing maximum matching in parallel on bipartite graphs: worth the effort?
Proceedings of the first workshop on Irregular applications: architectures and algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
SynopSys: large graph analytics in the SAP HANA database through summarization
First International Workshop on Graph Data Management Experiences and Systems
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.01 |