| Publication | Date of Publication | Type |
|---|
| Minimum membership geometric set cover in the continuous setting | 2026-01-28 | Paper |
| Improved algorithms for minimum-membership geometric set cover | 2024-05-31 | Paper |
Local search strikes again: PTAS for variants of geometric covering and packing
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
Packing and covering with non-piercing regions
Discrete & Computational Geometry | 2018-10-30 | Paper |
| Packing and covering with non-piercing regions | 2018-03-02 | Paper |
Local search strikes again: PTAS for variants of geometric covering and packing
Lecture Notes in Computer Science | 2017-10-23 | Paper |
A scalable simulator for forest dynamics
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Demand hitting and covering of intervals
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Selection lemmas for various geometric objects
International Journal of Computational Geometry & Applications | 2016-10-26 | Paper |
A variant of the Hadwiger-Debrunner (p,q)-problem in the plane
Discrete & Computational Geometry | 2015-10-14 | Paper |
On locally Gabriel geometric graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
Hardness results for computing optimal locally Gabriel graphs
International Journal of Computational Geometry & Applications | 2015-01-23 | Paper |
On strong centerpoints
Information Processing Letters | 2014-12-15 | Paper |
Vertex Cover Gets Faster and Harder on Low Degree Graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Small strong epsilon nets
Computational Geometry | 2014-08-13 | Paper |
On the Erdős-Szekeres \(n\)-interior-point problem
European Journal of Combinatorics | 2014-07-29 | Paper |
Two player game variant of the Erdős-Szekeres problem
(available as arXiv preprint) | 2014-02-14 | Paper |
| Two player game variant of the Erdős-Szekeres problem | 2014-02-14 | Paper |
| On the Erdős-Szekeres \(n\)-interior point problem | 2013-11-01 | Paper |
Hitting and Piercing Rectangles Induced by a Point Set
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Efficient external memory structures for range-aggregate queries
Computational Geometry | 2013-01-25 | Paper |
Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
Discrete & Computational Geometry | 2012-08-13 | Paper |
I/O-efficient well-separated pair decomposition and applications
Algorithmica | 2006-09-26 | Paper |
| scientific article; zbMATH DE number 1953129 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1670661 (Why is no real title available?) | 2001-11-11 | Paper |
