| Publication | Date of Publication | Type |
|---|
Approximate selection with unreliable comparisons in sublinear time
Journal of Computer and System Sciences | 2025-09-29 | Paper |
| Approximate selection with unreliable comparisons in optimal expected time | 2024-10-08 | Paper |
| scientific article; zbMATH DE number 7650297 (Why is no real title available?) | 2023-02-03 | Paper |
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
SIAM Journal on Computing | 2022-06-08 | Paper |
| Resilient Dictionaries for Randomly Unreliable Memory | 2022-05-11 | Paper |
Optimal sorting with persistent comparison errors
(available as arXiv preprint) | 2022-05-11 | Paper |
Approximate minimum selection with unreliable comparisons
Algorithmica | 2022-02-01 | Paper |
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Sorting with Recurrent Comparison Errors
(available as arXiv preprint) | 2020-11-25 | Paper |
Simple Topological Drawings of $k$-Planar Graphs
(available as arXiv preprint) | 2020-08-24 | Paper |
| A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon | 2020-08-18 | Paper |
| Optimal dislocation with persistent errors in subquadratic time | 2020-08-05 | Paper |
Optimal dislocation with persistent errors in subquadratic time
Theory of Computing Systems | 2020-04-15 | Paper |
A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
Algorithmica | 2020-02-28 | Paper |
A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
Algorithmica | 2020-02-28 | Paper |
An efficient randomized algorithm for higher-order abstract Voronoi diagrams
Algorithmica | 2019-05-17 | Paper |
Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Minimizing the diameter of a spanning tree for imprecise points
Algorithmica | 2018-04-06 | Paper |
Forest-like abstract Voronoi diagrams in linear time
Computational Geometry | 2018-02-19 | Paper |
Abstract Voronoi diagrams from closed bisecting curves
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
| An efficient randomized algorithm for higher-order abstract Voronoi diagrams | 2018-01-30 | Paper |
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Computational Geometry | 2016-11-14 | Paper |
Minimizing the diameter of a spanning tree for imprecise points
Algorithms and Computation | 2016-01-11 | Paper |
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Algorithms and Computation | 2015-09-11 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Computational Geometry | 2015-07-27 | Paper |
The \(k\)-nearest-neighbor Voronoi diagram revisited
Algorithmica | 2015-05-26 | Paper |
On the complexity of higher order abstract Voronoi diagrams
Automata, Languages, and Programming | 2013-08-06 | Paper |
Higher order city Voronoi diagrams
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram
Algorithms – ESA 2011 | 2011-09-16 | Paper |
