| Publication | Date of Publication | Type |
|---|
On \(k\)-means for segments and polylines
| 2025-01-06 | Paper |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Journal of the ACM | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7561502 (Why is no real title available?)
| 2022-07-21 | Paper |
Geometric multicut: shortest fences for separating groups of objects in the plane
Discrete & Computational Geometry | 2020-10-23 | Paper |
scientific article; zbMATH DE number 7236415 (Why is no real title available?)
| 2020-08-18 | Paper |
QPTAS and subexponential algorithm for maximum clique on disk graphs
| 2020-08-18 | Paper |
On the parameterized complexity of red-blue points separation
| 2020-05-27 | Paper |
Orthogonal terrain guarding is NP-complete
| 2020-01-13 | Paper |
On the parameterized complexity of red-blue points separation
| 2019-07-23 | Paper |
Minimum Cell Connection in Line Segment Arrangements
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Finding the best shortcut in a geometric network
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
The complexity of separating points in the plane
Algorithmica | 2016-03-29 | Paper |
The complexity of separating points in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the computational complexity of Erdős-Szekeres and related problems in \(\mathbb{R}^{3}\)
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fixed-parameter tractability and lower bounds for stabbing problems
Computational Geometry | 2013-08-22 | Paper |
Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
Journal of Complexity | 2012-05-07 | Paper |
Milling a graph with turn costs: a parameterized complexity perspective
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
scientific article; zbMATH DE number 5764822 (Why is no real title available?)
| 2010-08-06 | Paper |
Computing geometric minimum-dilation graphs is NP-hard
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
On the parameterized complexity of \(d\)-dimensional point set pattern matching
Information Processing Letters | 2010-03-24 | Paper |
Maximizing the area of overlap of two unions of disks under rigid motion
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
The parameterized complexity of some geometric problems in unbounded dimension
Parameterized and Exact Computation | 2010-01-14 | Paper |
Improving the Stretch Factor of a Geometric Network by Edge Augmentation
SIAM Journal on Computing | 2009-03-16 | Paper |
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
Parameterized and Exact Computation | 2008-06-03 | Paper |
Matching point sets with respect to the earth mover's distance
Computational Geometry | 2007-12-03 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
scientific article; zbMATH DE number 2062646 (Why is no real title available?)
| 2004-03-29 | Paper |
