Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation schemes for wireless networks
ACM Transactions on Algorithms (TALG)
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximating minimum independent dominating sets in wireless networks
Information Processing Letters
PTAS for connected vertex cover in unit disk graphs
Theoretical Computer Science
Convex polygon intersection graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Journal of Combinatorial Optimization
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Journal of Combinatorial Optimization
Geometric intersection graph: do short cycles help?
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |