Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Discrete Applied Mathematics
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Automated analysis of DNA hybridization images for high-throughput genomics
Machine Vision and Applications
Joint Classification and Pairing of Human Chromosomes
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Sensor-mission assignment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Assigning sensors to missions with demands
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Computers and Industrial Engineering
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Walrasian equilibrium: hardness, approximations and tractable instances
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Improved complexity bounds for location problems on the real line
Operations Research Letters
An algorithm for min-cost edge-disjoint cycles and its applications
Operations Research Letters
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Welfare maximization and the supermodular degree
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |