Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
A note on maximum independent set and related problems on box graphs
Information Processing Letters
Computational Geometry: Theory and Applications
Coloring kk-free intersection graphs of geometric objects in the plane
Proceedings of the twenty-fourth annual symposium on Computational geometry
Self-overlapping curves revisited
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
A note on maximum independent set and related problems on box graphs
Information Processing Letters
Subexponential-time algorithms for maximum independent set and related problems on box graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Improved sublinear time algorithm for width-bounded separators
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
European Journal of Combinatorics
A PTAS for a disc covering problem using width-bounded separators
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Multi-directional width-bounded geometric separator and protein folding
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Coloring Kk-free intersection graphs of geometric objects in the plane
European Journal of Combinatorics
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |