Tight Bounds on Maximal and Maximum Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Coloring Algorithms on Subcubic Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
Single-strip triangulation of manifolds with arbitrary topology
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Simultaneous diagonal flips in plane triangulations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Deciding relaxed two-colorability: a hardness jump
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for computing simple k-factors
Information Processing Letters
Deciding relaxed two-colourability: A hardness jump
Combinatorics, Probability and Computing
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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)
GD'10 Proceedings of the 18th international conference on Graph drawing
Optimal 3D angular resolution for low-degree graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
ACM: atlas of connectivity maps for semiregular models
Proceedings of Graphics Interface 2013
Special Section on Graphics Interface: Atlas of connectivity maps
Computers and Graphics
| Hi-index | 0.00 |