| Publication | Date of Publication | Type |
|---|
Packing d-dimensional balls into a d + 1-dimensional container
Computational Geometry | 2026-01-16 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
| Geometric matching and bottleneck problems | 2025-11-24 | Paper |
Connected matchings
Computational Geometry | 2025-07-04 | Paper |
| Searching in Euclidean spaces with predictions | 2025-06-06 | Paper |
Finding a largest-area triangle in a terrain in near-linear time
Computational Geometry | 2025-03-10 | Paper |
| On k-means for segments and polylines | 2025-01-06 | Paper |
A note on the 2-colored rectilinear crossing number of random point sets in the unit square
Acta Mathematica Hungarica | 2024-09-19 | Paper |
| Long plane trees | 2024-05-14 | Paper |
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
Minimum shared‐power edge cut
Networks | 2023-11-15 | Paper |
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Maximum matchings in geometric intersection graphs
Discrete & Computational Geometry | 2023-10-12 | Paper |
Faster distance-based representative skyline and k-center along Pareto front in the plane
Journal of Global Optimization | 2023-06-28 | Paper |
| Connectivity with uncertainty regions given as line segments | 2023-03-17 | Paper |
scientific article; zbMATH DE number 7650916 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7559220 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle | 2022-07-18 | Paper |
Finding a largest-area triangle in a terrain in near-linear time
(available as arXiv preprint) | 2022-03-25 | Paper |
Computing Shapley values in the plane
Discrete & Computational Geometry | 2022-03-22 | Paper |
The inverse Kakeya problem
Periodica Mathematica Hungarica | 2022-02-22 | Paper |
The complexity of mixed-connectivity
Annals of Operations Research | 2022-01-24 | Paper |
Maximizing dominance in the plane and its applications
Algorithmica | 2021-11-19 | Paper |
On the minimum consistent subset problem
Algorithmica | 2021-06-30 | Paper |
The reverse Kakeya problem
advg | 2021-04-20 | Paper |
The inverse Voronoi problem in graphs. II: Trees
Algorithmica | 2021-04-19 | Paper |
Minimum cuts in geometric intersection graphs
Computational Geometry | 2021-01-07 | Paper |
The inverse Voronoi problem in graphs. I: Hardness
Algorithmica | 2020-10-12 | Paper |
| The reverse Kakeya problem | 2020-08-18 | Paper |
Hardness of minimum barrier shrinkage and minimum installation path
Theoretical Computer Science | 2020-08-17 | Paper |
On the minimum consistent subset problem
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Maximizing dominance in the plane and its applications
Lecture Notes in Computer Science | 2020-01-16 | Paper |
The Inverse Kakeya Problem
(available as arXiv preprint) | 2019-12-18 | Paper |
The parameterized complexity of finding a 2-sphere in a simplicial complex
SIAM Journal on Discrete Mathematics | 2019-10-30 | Paper |
Covering many points with a small-area box
(available as arXiv preprint) | 2019-09-10 | Paper |
| Finding shortest contractible and shortest separating cycles in embedded graphs | 2019-05-06 | Paper |
Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Testing homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Two optimization problems for unit disks
Computational Geometry | 2018-10-31 | Paper |
Maximum volume subset selection for anchored boxes
(available as arXiv preprint) | 2018-08-13 | Paper |
Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Peeling potatoes near-optimally in near-linear time
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
The parameterized complexity of finding a 2-sphere in a simplicial complex
(available as arXiv preprint) | 2018-04-19 | Paper |
Minimum Cell Connection in Line Segment Arrangements
International Journal of Computational Geometry & Applications | 2018-01-31 | Paper |
Parameterized complexity of 1-planarity
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
Interval selection in the streaming model
Theoretical Computer Science | 2017-11-06 | Paper |
| Finding all maximal subsequences with hereditary properties | 2017-10-10 | Paper |
Peeling potatoes near-optimally in near-linear time
SIAM Journal on Computing | 2017-10-06 | Paper |
Approximation algorithms for aligning points
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Schematization of road networks
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Finding shortest non-trivial cycles in directed graphs on surfaces | 2017-03-30 | Paper |
Refining the hierarchies of classes of geometric intersection graphs
The Electronic Journal of Combinatorics | 2017-02-17 | Paper |
Refining the hierarchies of classes of geometric intersection graphs
Electronic Notes in Discrete Mathematics | 2017-02-13 | Paper |
| Drawing a disconnected graph on the torus (extended abstract) | 2016-10-14 | Paper |
The complexity of separating points in the plane
Algorithmica | 2016-03-29 | Paper |
Finding largest rectangles in convex polygons
Computational Geometry | 2016-01-18 | Paper |
Semi-dynamic connectivity in the plane
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Interval selection in the streaming model
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Stackelberg shortest path tree game, revisited
(available as arXiv preprint) | 2015-09-07 | Paper |
Simple PTAS's for families of graphs excluding a minor
Discrete Applied Mathematics | 2015-06-30 | Paper |
Shortest paths in intersection graphs of unit disks
Computational Geometry | 2015-05-12 | Paper |
The complexity of separating points in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
| A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon | 2015-02-09 | Paper |
Computing the stretch of an embedded graph
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| Multiple source shortest paths in a genus g graph | 2014-12-18 | Paper |
| Obnoxious centers in graphs | 2014-12-18 | Paper |
Finding shortest contractible and shortest separating cycles in embedded graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Finding one tight cycle
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Adding one edge to planar graphs makes crossing number hard
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Output-sensitive algorithm for the edge-width of an embedded graph
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Adding one edge to planar graphs makes crossing number and 1-planarity hard
SIAM Journal on Computing | 2014-02-04 | Paper |
Multiple-source shortest paths in embedded graphs
SIAM Journal on Computing | 2013-11-14 | Paper |
The clique problem in ray intersection graphs
Discrete & Computational Geometry | 2013-11-06 | Paper |
Parameterized complexity of 1-planarity
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Hardness of approximation for crossing number
Discrete & Computational Geometry | 2013-03-20 | Paper |
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry | 2013-01-25 | Paper |
The Clique Problem in Ray Intersection Graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Annotating simplices with a homology basis and its applications
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
The class cover problem with boxes
Computational Geometry | 2012-05-18 | Paper |
Algorithms for the edge-width of an embedded graph
Computational Geometry | 2012-05-18 | Paper |
Many distances in planar graphs
Algorithmica | 2012-04-26 | Paper |
Finding cycles with topological properties in embedded graphs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
On the \(b\)-chromatic number of regular graphs
Discrete Applied Mathematics | 2011-08-10 | Paper |
Obnoxious Centers in Graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Crossing number and weighted crossing number of near-planar graphs
Algorithmica | 2011-06-30 | Paper |
The Fibonacci dimension of a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The Fibonacci dimension of a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The complexity of obtaining a distance-balanced graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The complexity of obtaining a distance-balanced graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Algorithmic aspects of proportional symbol maps
Algorithmica | 2010-09-27 | Paper |
Many distances in planar graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Higher-order Voronoi diagrams on triangulated surfaces
Information Processing Letters | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764822 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5764895 (Why is no real title available?) | 2010-08-06 | Paper |
| Edge-removal and non-crossing configurations in geometric graphs | 2010-07-27 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Graph Drawing | 2010-04-27 | Paper |
On the parameterized complexity of \(d\)-dimensional point set pattern matching
Information Processing Letters | 2010-03-24 | Paper |
Maximizing the area of overlap of two unions of disks under rigid motion
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Facility location problems in the plane based on reverse nearest neighbor queries
European Journal of Operational Research | 2009-11-17 | Paper |
Covering many or few points with unit disks
Theory of Computing Systems | 2009-09-02 | Paper |
Algorithms for graphs of bounded treewidth via orthogonal range searching
Computational Geometry | 2009-08-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Crossing and Weighted Crossing Number of Near-Planar Graphs
Graph Drawing | 2009-03-03 | Paper |
Planar Embeddings of Graphs with Specified Edge Lengths
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
Parameterized and Exact Computation | 2008-06-03 | Paper |
Computing a Center-Transversal Line
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Algorithmic Aspects of Proportional Symbol Maps
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Covering Many or Few Points with Unit Disks
Approximation and Online Algorithms | 2008-02-21 | Paper |
Matching point sets with respect to the earth mover's distance
Computational Geometry | 2007-12-03 | Paper |
Approximation algorithms for spreading points
Journal of Algorithms | 2007-06-08 | Paper |
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
Discrete & Computational Geometry | 2007-04-26 | Paper |
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms | 2007-02-14 | Paper |
| scientific article; zbMATH DE number 5122018 (Why is no real title available?) | 2007-02-05 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Schematization of networks
Computational Geometry | 2005-05-12 | Paper |
Approximation algorithms for aligning points
Algorithmica | 2004-09-22 | Paper |
Testing homotopy for paths in the plane
Discrete & Computational Geometry | 2004-03-11 | Paper |
Secret sharing schemes with detection of cheaters for a general access structure
Designs, Codes and Cryptography | 2002-05-28 | Paper |
| scientific article; zbMATH DE number 1390062 (Why is no real title available?) | 2000-01-17 | Paper |
