Chain decompositions and independent trees in 4-connected graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Simultaneous diagonal flips in plane triangulations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM Transactions on Database Systems (TODS)
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Approximation algorithms for min-max generalization problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Simultaneous embedding with two bends per edge in polynomial area
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Simultaneous embedding of planar graphs with few bends
GD'04 Proceedings of the 12th international conference on Graph Drawing
The hamiltonian augmentation problem and its applications to graph drawing
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
On the hardness of point-set embeddability
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Drawing planar graphs on points inside a polygon
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Kinetic and stationary point-set embeddability for plane graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Triangle mesh compression along the Hamiltonian cycle
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |