| Publication | Date of Publication | Type |
|---|
| Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete | 2024-10-16 | Paper |
| Representing matroids over the reals is \(\exists \mathbb{R}\)-complete | 2024-09-17 | Paper |
| A practical algorithm with performance guarantees for the art gallery problem | 2024-09-06 | Paper |
| On classifying continuous constraint satisfaction problems | 2024-07-03 | Paper |
| Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems | 2024-07-03 | Paper |
| The complexity of recognizing geometric hypergraphs | 2024-06-21 | Paper |
| Topological art in simple galleries | 2024-05-14 | Paper |
| The complexity of the Hausdorff distance | 2024-05-14 | Paper |
| Topological art in simple galleries | 2024-04-02 | Paper |
| The complexity of the Hausdorff distance | 2024-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065409 | 2023-11-14 | Paper |
| Hiding sliding cubes: why reconfiguring modular robots is not easy (media exposition) | 2023-11-02 | Paper |
| Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality | 2023-06-12 | Paper |
| Token Swapping on Trees | 2023-05-31 | Paper |
| Parameterized Hardness of Art Gallery Problems | 2023-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| The complexity of drawing a graph in a polygonal region | 2022-11-14 | Paper |
| Avoider-Enforcer Game is NP-hard | 2022-08-13 | Paper |
| Smoothing the Gap Between NP and ER | 2022-04-20 | Paper |
| The Art Gallery Problem is ∃ℝ-complete | 2022-03-31 | Paper |
| On the VC-dimension of half-spaces with respect to convex sets | 2022-01-27 | Paper |
| Between shapes, using the Hausdorff distance | 2021-12-15 | Paper |
| Smoothing the gap between NP and ER | 2019-12-04 | Paper |
| The art gallery problem is \(\exists \mathbb{R}\)-complete | 2019-08-22 | Paper |
| A Universality Theorem for Nested Polytopes | 2019-08-06 | Paper |
| Smoothed Analysis of Order Types | 2019-07-10 | Paper |
| Fine-grained complexity of coloring unit disks and balls | 2019-02-27 | Paper |
| The complexity of drawing a graph in a polygonal region | 2019-02-15 | Paper |
| \(\forall\exists\mathbb {R}\)-completeness and area-universality | 2018-11-22 | Paper |
| Intersection graphs of rays and grounded segments | 2018-09-06 | Paper |
| An approximation algorithm for the art gallery problem | 2018-08-13 | Paper |
| Irrational guards are sometimes needed | 2018-08-13 | Paper |
| Fine-grained complexity of coloring unit disks and balls | 2018-08-13 | Paper |
| Complexity of token swapping and its variants | 2018-07-26 | Paper |
| Complexity of token swapping and its variants | 2018-04-19 | Paper |
| Approximation and hardness of token swapping | 2018-03-02 | Paper |
| Parameterized hardness of art gallery problems | 2018-03-02 | Paper |
| Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems | 2018-01-30 | Paper |
| Intersection graphs of rays and grounded segments | 2018-01-04 | Paper |
| Quasi-parallel segments and characterization of unique bichromatic matchings | 2017-03-30 | Paper |
| Points with large quadrant depth | 2017-03-09 | Paper |
| Counting houses of Pareto optimal matchings in the house allocation problem | 2016-08-16 | Paper |
| Flip Distance to a Non-crossing Perfect Matching | 2016-01-22 | Paper |
| Upper and lower bounds on long dual paths in line arrangements | 2015-09-16 | Paper |
| Counting \(K_4\)-subdivisions | 2015-08-05 | Paper |
| Counting houses of Pareto optimal matchings in the house allocation problem | 2015-07-21 | Paper |
| Disjoint compatibility graph of non-crossing matchings of points in convex position | 2015-03-19 | Paper |
| Halving balls in deterministic linear time | 2014-10-08 | Paper |
| Points with large quadrant-depth | 2014-04-03 | Paper |
| Reprint of: Extreme point and halving edge search in abstract order types | 2014-01-22 | Paper |
| Extreme point and halving edge search in abstract order types | 2013-07-31 | Paper |
| Tron, a combinatorial Game on abstract Graphs | 2011-10-14 | Paper |
| Representing Matroids over the Reals is $\exists \mathbb R$-complete | N/A | Paper |
