| Publication | Date of Publication | Type |
|---|
| Shadoks approach to convex covering (CG challenge) | 2024-10-16 | Paper |
| Economical convex coverings and applications | 2024-08-06 | Paper |
| Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring | 2024-07-26 | Paper |
| Short flip sequences to untangle segments in the plane | 2024-07-19 | Paper |
| Economical convex coverings and applications | 2024-05-14 | Paper |
| Shadoks approach to minimum partition into plane subgraphs (CG challenge) | 2024-05-14 | Paper |
| On the longest flip sequence to untangle segments in the plane | 2023-11-24 | Paper |
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2023-10-31 | Paper |
| Complexity results on untangling red-blue matchings | 2023-07-26 | Paper |
| Shadoks Approach to Low-Makespan Coordinated Motion Planning | 2023-06-26 | Paper |
| Complexity results on untangling red-blue matchings | 2023-06-20 | Paper |
| Efficient algorithms for Battleship | 2023-02-07 | Paper |
| Greedy and Local Search Heuristics to Build Area-Optimal Polygons | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009560 | 2021-08-04 | Paper |
| Optimal Bound on the Combinatorial Complexity of Approximating Polytopes | 2021-02-02 | Paper |
| Efficiently testing digital convexity and recognizing digital convex polygons | 2020-10-06 | Paper |
| Efficient independent set approximation in unit disk graphs | 2020-05-18 | Paper |
| Efficient Algorithms to Test Digital Convexity | 2019-10-16 | Paper |
| Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743375 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580082 | 2018-08-13 | Paper |
| Optimal Approximate Polytope Membership | 2018-07-16 | Paper |
| Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs | 2018-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132844 | 2018-01-30 | Paper |
| Approximate Polytope Membership Queries | 2018-01-12 | Paper |
| On the combinatorial complexity of approximating polytopes | 2018-01-11 | Paper |
| The cost of perfection for matchings in graphs | 2016-06-22 | Paper |
| On the ratio between maximum weight perfect matchings and maximum weight matchings in grids | 2016-06-01 | Paper |
| Linear-Time Approximation Algorithms for Unit Disk Graphs | 2015-11-20 | Paper |
| On the recognition of unit disk graphs and the distance geometry problem with ranges | 2015-09-30 | Paper |
| Optimal area-sensitive bounds for polytope approximation | 2014-08-07 | Paper |
| Approximate polytope membership queries | 2014-06-05 | Paper |
| Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs | 2013-09-13 | Paper |
| Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges | 2012-05-13 | Paper |
| FITTING FLATS TO POINTS WITH OUTLIERS | 2012-04-19 | Paper |
| Complexity dichotomy on partial grid recognition | 2011-05-10 | Paper |
| A Unified Approach to Approximate Proximity Searching | 2010-09-06 | Paper |
| Enclosing weighted points with an almost-unit ball | 2010-09-01 | Paper |
| Approximate range searching: The absolute model | 2010-03-16 | Paper |
| Hamiltonian paths in odd graphs | 2010-01-12 | Paper |
| Kinetic hanger | 2009-07-09 | Paper |
| Approximate Range Searching: The Absolute Model | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5459059 | 2008-04-24 | Paper |
| Algorithms for the homogeneous set sandwich problem | 2006-11-06 | Paper |
| The stable marriage problem with restricted pairs. | 2004-03-14 | Paper |
| Kinetic heap-ordered trees: Tight analysis and improved algorithms | 2003-01-22 | Paper |
| Stable marriages with restricted pairs | 2001-10-24 | Paper |
