| Publication | Date of Publication | Type |
|---|
| Shadoks approach to convex covering (CG challenge) | 2024-10-16 | Paper |
Economical convex coverings and applications
SIAM Journal on Computing | 2024-08-06 | Paper |
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
ACM Journal of Experimental Algorithmics | 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
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Complexity results on untangling red-blue matchings
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Shadoks Approach to Low-Makespan Coordinated Motion Planning
ACM Journal of Experimental Algorithmics | 2023-06-26 | Paper |
Complexity results on untangling red-blue matchings
Computational Geometry | 2023-06-20 | Paper |
| Efficient algorithms for Battleship | 2023-02-07 | Paper |
Greedy and local search heuristics to build area-optimal polygons
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Approximate convex intersection detection with applications to width and Minkowski sums
(available as arXiv preprint) | 2021-08-04 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Efficiently testing digital convexity and recognizing digital convex polygons
Journal of Mathematical Imaging and Vision | 2020-10-06 | Paper |
Efficient independent set approximation in unit disk graphs
Discrete Applied Mathematics | 2020-05-18 | Paper |
Efficient Algorithms to Test Digital Convexity
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Polytope approximation and the Mahler volume | 2019-05-10 | Paper |
Near-optimal \(\varepsilon\)-kernel construction and related problems
(available as arXiv preprint) | 2018-08-13 | Paper |
Optimal approximate polytope membership
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
International Journal of Computational Geometry & Applications | 2018-02-22 | Paper |
| On the combinatorial complexity of approximating polytopes | 2018-01-30 | Paper |
Approximate polytope membership queries
SIAM Journal on Computing | 2018-01-12 | Paper |
On the combinatorial complexity of approximating polytopes
Discrete & Computational Geometry | 2018-01-11 | Paper |
The cost of perfection for matchings in graphs
Discrete Applied Mathematics | 2016-06-22 | Paper |
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Discrete Applied Mathematics | 2016-06-01 | Paper |
Linear-time approximation algorithms for unit disk graphs
Approximation and Online Algorithms | 2015-11-20 | Paper |
On the recognition of unit disk graphs and the distance geometry problem with ranges
Discrete Applied Mathematics | 2015-09-30 | Paper |
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
Approximation and Online Algorithms | 2013-09-13 | Paper |
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Fitting flats to points with outliers
International Journal of Computational Geometry & Applications | 2012-04-19 | Paper |
Complexity dichotomy on partial grid recognition
Theoretical Computer Science | 2011-05-10 | Paper |
A unified approach to approximate proximity searching
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Enclosing weighted points with an almost-unit ball
Information Processing Letters | 2010-09-01 | Paper |
Approximate range searching: The absolute model
Computational Geometry | 2010-03-16 | Paper |
Hamiltonian paths in odd graphs
Applicable Analysis and Discrete Mathematics | 2010-01-12 | Paper |
Kinetic hanger
Information Processing Letters | 2009-07-09 | Paper |
Approximate Range Searching: The Absolute Model
Lecture Notes in Computer Science | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5267515 (Why is no real title available?) | 2008-04-24 | Paper |
Algorithms for the homogeneous set sandwich problem
Algorithmica | 2006-11-06 | Paper |
The stable marriage problem with restricted pairs.
Theoretical Computer Science | 2004-03-14 | Paper |
Kinetic heap-ordered trees: Tight analysis and improved algorithms
Information Processing Letters | 2003-01-22 | Paper |
| Stable marriages with restricted pairs | 2001-10-24 | Paper |
