Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms, 2008
Oracles for bounded-length shortest paths in planar graphs.
ACM Trans. Algorithms, 2006
A Note on Scheduling Equal-Length Jobs to Maximize Throughput.
J. Sched., 2006
Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n).
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005
Approximate Clustering of Fingerprint Vectors with Missing Values.
Proceedings of the Theory of Computing 2005, 2005
A 1.235 lower bound on the number of points needed to draw all <i>n</i>-vertex planar graphs.
Inf. Process. Lett., 2004
Simple and efficient floor-planning.
Inf. Process. Lett., 2003
Short path queries in planar graphs in constant time.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
A New 3-Color Criterion for Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002