| Publication | Date of Publication | Type |
|---|
| Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete | 2024-10-16 | Paper |
| Distinguishing classes of intersection graphs of homothets or similarities of two convex disks | 2024-10-16 | Paper |
| Constructing concise convex covers via clique covers (CG challenge) | 2024-10-16 | Paper |
Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
TheoretiCS | 2024-07-03 | Paper |
| Online sorting and translational packing of convex polygons | 2024-05-14 | Paper |
| Tiling with squares and packing dominos in polynomial time | 2024-05-14 | Paper |
Tiling with Squares and Packing Dominos in Polynomial Time
ACM Transactions on Algorithms | 2023-10-23 | Paper |
How to cut corners and get bounded convex curvature
Discrete & Computational Geometry | 2023-05-12 | Paper |
scientific article; zbMATH DE number 7633284 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-15 | Paper |
| Degree of Convexity and Expected Distances in Polygons | 2022-08-15 | Paper |
| scientific article; zbMATH DE number 7561502 (Why is no real title available?) | 2022-07-21 | Paper |
The Art Gallery Problem is ∃ℝ-complete
Journal of the ACM | 2022-03-31 | Paper |
| Distinguishing classes of intersection graphs of homothets or similarities of two convex disks | 2021-08-10 | Paper |
Escaping an infinitude of lions
The American Mathematical Monthly | 2020-12-17 | Paper |
Geometric multicut: shortest fences for separating groups of objects in the plane
Discrete & Computational Geometry | 2020-10-23 | Paper |
Disks in curves of bounded convex curvature
The American Mathematical Monthly | 2020-08-03 | Paper |
Near-optimal induced universal graphs for cycles and paths
Discrete Applied Mathematics | 2020-06-05 | Paper |
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Minimum perimeter-sum partitions in the plane
Discrete & Computational Geometry | 2020-01-31 | Paper |
The art gallery problem is \(\exists \mathbb{R}\)-complete
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fast fencing
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Common tangents of two disjoint polygons in linear time and constant workspace
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Irrational guards are sometimes needed
(available as arXiv preprint) | 2018-08-13 | Paper |
Best laid plans of lions and men
(available as arXiv preprint) | 2018-08-13 | Paper |
Range-clustering queries
(available as arXiv preprint) | 2018-08-13 | Paper |
Minimum Perimeter-Sum Partitions in the Plane
(available as arXiv preprint) | 2018-08-13 | Paper |
| scientific article; zbMATH DE number 6846375 (Why is no real title available?) | 2018-03-02 | Paper |
| Finding the Maximum Subset with Bounded Convex Curvature | 2018-01-30 | Paper |
| Graph reconstruction with a betweenness oracle | 2018-01-24 | Paper |
An optimal algorithm for the separating common tangents of two polygons
(available as arXiv preprint) | 2017-10-10 | Paper |
On the Asymptotic Enumeration of LEGO Structures
Experimental Mathematics | 2013-04-10 | Paper |
