American Mathematical Monthly
A linear algorithm for perfect matching in hexagonal systems
Discrete Mathematics
Perfect matchings in the triangular lattice
Discrete Mathematics
Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Edge-Coloring Bipartite Multigraphs in $0(E\log D)$ Time
Edge-Coloring Bipartite Multigraphs in $0(E\'log D)$ Time
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |