| Publication | Date of Publication | Type |
|---|
The complexity of order type isomorphism
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Deep cliques in point sets
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Rolling polyhedra on tessellations
| 2024-05-16 | Paper |
Multifold tiles of polyominoes and convex lattice polygons
| 2024-04-09 | Paper |
Competitive Online Search Trees on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Toward unfolding doubly covered \(n\)-stars
| 2023-03-31 | Paper |
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
Dynamic Trees with Almost-Optimal Access Cost
| 2021-08-04 | Paper |
Belga B-trees
Theory of Computing Systems | 2021-08-03 | Paper |
Competitive Online Search Trees on Trees
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An optimal algorithm to compute the inverse beacon attraction region
| 2020-08-18 | Paper |
Subquadratic encodings for point configurations
| 2020-08-18 | Paper |
Self-approaching paths in simple polygons
Computational Geometry | 2020-04-22 | Paper |
Polyhedral characterization of reversible hinged dissections
Graphs and Combinatorics | 2020-04-03 | Paper |
Which convex polyhedra can be made by gluing regular hexagons?
Graphs and Combinatorics | 2020-04-03 | Paper |
Cookie clicker
Graphs and Combinatorics | 2020-04-03 | Paper |
Subquadratic encodings for point configurations
| 2020-01-13 | Paper |
Belga B-trees
Computer Science – Theory and Applications | 2019-10-22 | Paper |
Pole dancing: 3D morphs for tree drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
A characterization of the degree sequences of 2-trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
The Complexity of Order Type Isomorphism
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Subquadratic algorithms for algebraic 3SUM
Discrete \& Computational Geometry | 2019-05-21 | Paper |
Confluent persistence revisited
| 2019-05-10 | Paper |
Decomposition of multiple coverings into more parts
| 2019-05-06 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | Paper |
Bottleneck detour tree of points on a path
Computational Geometry | 2019-03-20 | Paper |
Pole dancing: 3D morphs for tree drawings
| 2019-02-15 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Interlocked open linkages with few joints
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Threes!, Fives, 1024!, and 2048 are hard
Theoretical Computer Science | 2018-11-23 | Paper |
On the diameter of tree associahedra
The Electronic Journal of Combinatorics | 2018-10-30 | Paper |
Pole Dancing: 3D Morphs for Tree Drawings
| 2018-08-31 | Paper |
Subquadratic algorithms for algebraic generalizations of 3SUM
| 2018-08-13 | Paper |
Self-approaching paths in simple polygons
| 2018-08-13 | Paper |
Weighted dynamic finger in binary search trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The dual diameter of triangulations
Computational Geometry | 2018-02-19 | Paper |
Incremental Voronoi diagrams
| 2018-01-30 | Paper |
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
| 2018-01-30 | Paper |
Induced Ramsey-type results and binary predicates for point sets
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Incremental Voronoi diagrams
Discrete \& Computational Geometry | 2018-01-11 | Paper |
Induced Ramsey-type results and binary predicates for point sets
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
Optimal detection of intersections between convex polyhedra
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
On the complexity of halfspace area queries
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Searching edges in the overlap of two plane graphs
| 2017-09-22 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Threes!, Fives, 1024!, and 2048 are hard
| 2017-07-17 | Paper |
Reconstructing Point Set Order Types from Radial Orderings
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
Approximating the average stretch factor of geometric graphs
| 2017-03-09 | Paper |
Reversible Nets of Polyhedra
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Bust-a-Move/Puzzle Bobble is NP-complete
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Space-time trade-offs for stack-based algorithms
| 2017-01-30 | Paper |
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
Algorithmica | 2016-12-21 | Paper |
The power and limitations of static binary search trees with lazy finger
Algorithmica | 2016-12-21 | Paper |
The four bars problem
Nonlinearity | 2016-09-26 | Paper |
Optimizing some constructions with bars: new geometric knapsack problems
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
Narrow misère dots-and-boxes
| 2015-10-07 | Paper |
Reconstructing point set order types from radial orderings
Algorithms and Computation | 2015-09-11 | Paper |
The power and limitations of static binary search trees with lazy finger
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Space-time trade-offs for stack-based algorithms
Algorithmica | 2015-09-02 | Paper |
Retroactive data structures
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6469156 (Why is no real title available?)
| 2015-08-03 | Paper |
Bichromatic compatible matchings
Computational Geometry | 2015-07-27 | Paper |
Worst-case optimal tree layout in external memory
Algorithmica | 2015-07-10 | Paper |
Generalized river crossing problems
Theory of Computing Systems | 2015-05-29 | Paper |
Isoperimetric enclosures
Graphs and Combinatorics | 2015-05-22 | Paper |
Bichromatic compatible matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Computing a visibility polygon using few variables
Computational Geometry | 2014-08-13 | Paper |
Online graph exploration algorithms for cycles and trees by multiple searchers
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
scientific article; zbMATH DE number 6297800 (Why is no real title available?)
| 2014-05-22 | Paper |
Optimal algorithms for constrained 1-center problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
Lecture Notes in Computer Science | 2014-03-31 | Paper |
A center transversal theorem for hyperplanes and applications to graph drawing
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
scientific article; zbMATH DE number 6257577 (Why is no real title available?)
| 2014-02-14 | Paper |
Triangulating and guarding realistic polygons
Computational Geometry | 2014-01-22 | Paper |
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry | 2014-01-22 | Paper |
The clique problem in ray intersection graphs
Discrete \& Computational Geometry | 2013-11-06 | Paper |
Helly numbers of polyominoes
Graphs and Combinatorics | 2013-09-26 | Paper |
Thirty essays on geometric graph theory
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
De-amortizing binary search trees
Automata, Languages, and Programming | 2013-08-12 | Paper |
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Combining binary search trees
Automata, Languages, and Programming | 2013-08-06 | Paper |
A Polynomial Bound for Untangling Geometric Planar Graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
A center transversal theorem for hyperplanes and applications to graph drawing
Discrete \& Computational Geometry | 2013-03-18 | Paper |
Stable roommates spanner
Computational Geometry | 2012-12-04 | Paper |
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Computational Geometry | 2012-12-04 | Paper |
Oja centers and centers of gravity
Computational Geometry | 2012-12-04 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
The Clique Problem in Ray Intersection Graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Algorithms and complexity of generalized river crossing problems
Lecture Notes in Computer Science | 2012-08-22 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
Continuous blooming of convex polyhedra
Graphs and Combinatorics | 2012-01-24 | Paper |
Colorful strips
Graphs and Combinatorics | 2012-01-24 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
Computing the visibility polygon using few variables
Algorithms and Computation | 2011-12-16 | Paper |
Determination of all tessellation polyhedra with regular polygonal faces
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
Realistic reconfiguration of crystalline (and telecube) robots
Springer Tracts in Advanced Robotics | 2011-03-02 | Paper |
Approximating the average stretch factor of geometric graphs
Algorithms and Computation | 2010-12-09 | Paper |
Decomposition of multiple coverings into more parts
Discrete \& Computational Geometry | 2010-11-08 | Paper |
Locked and unlocked chains of planar shapes
Discrete \& Computational Geometry | 2010-09-22 | Paper |
Near-entropy hotlink assignments
Algorithmica | 2010-09-16 | Paper |
scientific article; zbMATH DE number 5764827 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764838 (Why is no real title available?)
| 2010-08-06 | Paper |
Randomized optimization: a probabilistic analysis
| 2010-08-02 | Paper |
Grid vertex-unfolding orthostacks
International Journal of Computational Geometry & Applications | 2010-07-27 | Paper |
Confluently persistent tries for efficient version control
Algorithmica | 2010-05-19 | Paper |
Colorful strips
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Sigma-local graphs
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Pricing geometric transportation networks
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Discrete and Computational Geometry
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Algorithmic folding complexity
Algorithms and Computation | 2009-12-17 | Paper |
A polynomial bound for untangling geometric planar graphs
Discrete \& Computational Geometry | 2009-12-14 | Paper |
Facility location problems in the plane based on reverse nearest neighbor queries
European Journal of Operational Research | 2009-11-17 | Paper |
Highway hull revisited
Computational Geometry | 2009-11-16 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Linear reconfiguration of cube-style modular robots
Computational Geometry | 2009-07-27 | Paper |
Wrapping spheres with flat paper
Computational Geometry | 2009-06-30 | Paper |
Small weak epsilon-nets
Computational Geometry | 2009-06-18 | Paper |
Dynamic ham-sandwich cuts in the plane
Computational Geometry | 2009-06-18 | Paper |
Coloring geometric range spaces
Discrete \& Computational Geometry | 2009-05-13 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
scientific article; zbMATH DE number 5542484 (Why is no real title available?)
| 2009-04-14 | Paper |
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science | 2009-03-17 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Empty region graphs
Computational Geometry | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506193 (Why is no real title available?)
| 2009-02-10 | Paper |
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
Algorithms and Computation | 2009-01-29 | Paper |
Optimal location of transportation devices
Computational Geometry | 2008-09-19 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
A characterization of the degree sequences of 2-trees
Journal of Graph Theory | 2008-09-04 | Paper |
Confluently Persistent Tries for Efficient Version Control
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Computing a high depth point in the plane
| 2008-05-28 | Paper |
Linear Reconfiguration of Cube-Style Modular Robots
Algorithms and Computation | 2008-05-27 | Paper |
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Coloring Geometric Range Spaces
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Dynamic hotlinks
Algorithmica | 2008-04-03 | Paper |
Grid Vertex-Unfolding Orthostacks
Discrete and Computational Geometry | 2008-03-18 | Paper |
Weighted Ham-Sandwich Cuts
Discrete and Computational Geometry | 2008-03-18 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Near-Entropy Hotlink Assignments
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
Approximation and Online Algorithms | 2008-02-21 | Paper |
Local properties of geometric graphs
Computational Geometry | 2007-10-19 | Paper |
Edge-unfolding nested polyhedral bands
Computational Geometry | 2007-10-19 | Paper |
Efficient many-to-Many point matching in one dimension
Graphs and Combinatorics | 2007-07-19 | Paper |
scientific article; zbMATH DE number 5163271 (Why is no real title available?)
| 2007-06-08 | Paper |
Geodesic ham-sandwich cuts
Discrete \& Computational Geometry | 2007-04-26 | Paper |
Morpion solitaire
Theory of Computing Systems | 2007-02-13 | Paper |
Juggling with pattern matching
Theory of Computing Systems | 2007-02-13 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Geometric restrictions on producible polygonal protein chains
Algorithmica | 2006-06-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Covering things with things
Discrete \& Computational Geometry | 2005-08-02 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete \& Computational Geometry | 2005-08-02 | Paper |
Queaps
Algorithmica | 2005-05-13 | Paper |
Designing small keyboards is hard
Theoretical Computer Science | 2005-04-06 | Paper |
Asymmetric communication protocols via hotlink assignments
Theory of Computing Systems | 2005-02-11 | Paper |
scientific article; zbMATH DE number 2086390 (Why is no real title available?)
| 2004-08-11 | Paper |
Proximate point searching
Computational Geometry | 2004-08-06 | Paper |
The complexity of hyperplane depth in the plane
Discrete \& Computational Geometry | 2004-03-07 | Paper |
scientific article; zbMATH DE number 1979500 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1979514 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1962801 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1947430 (Why is no real title available?)
| 2003-07-08 | Paper |
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Computational Geometry | 2003-07-01 | Paper |
Interlocked open and closed linkages with few joints.
Computational Geometry | 2003-07-01 | Paper |
scientific article; zbMATH DE number 1875434 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1786508 (Why is no real title available?)
| 2002-08-21 | Paper |
scientific article; zbMATH DE number 1445286 (Why is no real title available?)
| 2000-05-10 | Paper |
