Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear reductions of maximum matching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Resonance graphs of catacondensed even ring systems are median
Discrete Mathematics
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
Discrete Applied Mathematics
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
Computers & Mathematics with Applications
A fully benzenoid system has a unique maximum cardinality resonant set
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
On the global forcing number of hexagonal systems
Discrete Applied Mathematics
Hi-index | 0.05 |