Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A Shortest Path Algorithm for Edge-Sparse Graphs
Journal of the ACM (JACM)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finding a minimum circuit in a graph
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Consistency in Networks of Relations
Consistency in Networks of Relations
Graphs and Hypergraphs
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
Journal of Experimental Algorithmics (JEA)
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
The labeled perfect matching in bipartite graphs
Information Processing Letters
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
Discrete Applied Mathematics
Maximum weight edge-constrained matchings
Discrete Applied Mathematics
The labeled perfect matching in bipartite graphs
Information Processing Letters
The complexity of bottleneck labeled graph problems
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Constrained matching problems in bipartite graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Complexity results for rainbow matchings
Theoretical Computer Science
| Hi-index | 0.01 |