Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A note on maximum independent sets in rectangle intersection graphs | Information Processing Letters |
| 13 | 2004 |
Polynomial-time approximation schemes for packing and piercing fat objects | Journal of Algorithms | 2003 | ||
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles | Journal of Algorithms | 20 | 2001 | |
Cutting Glass | Discrete & Computational Geometry |
| 7 | 2000 |
Clique is hard to approximate within n1−ϵ | Acta Mathematica |
| 1999 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A Survey on Variant Domination Problems in Geometric Intersection Graphs | Parallel Processing Letters |
| 2024 | |
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs | Theoretical Computer Science |
| 3 | 2023 |
A Tight Analysis of Geometric Local Search | Discrete & Computational Geometry |
| 2022 | |
Computing maximum independent set on outerstring graphs and their relatives | Computational Geometry |
| 1 | 2022 |
Stochastic makespan minimization in structured set systems | Mathematical Programming |
| 2021 |