research
∙
04/14/2021
Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time
We present an algorithm that enumerates and classifies all edge-to-edge ...
share
research
∙
01/30/2021
Fragile Complexity of Adaptive Algorithms
The fragile complexity of a comparison-based algorithm is f(n) if each i...
research
∙
07/03/2020
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons
We give a complete description of all convex polyhedra whose surface can...
research
∙
07/03/2020
Sublinear Explicit Incremental Planar Voronoi Diagrams
A data structure is presented that explicitly maintains the graph of a V...
research
∙
02/06/2020
Which convex polyhedra can be made by gluing regular hexagons?
Which convex 3D polyhedra can be obtained by gluing several regular hexa...
research
∙
08/02/2019
Competitive Online Search Trees on Trees
We consider the design of adaptive data structures for searching element...
research
∙
03/08/2019
Belga B-trees
We revisit self-adjusting external memory tree data structures, which co...
research
∙
03/06/2019
Encoding 3SUM
We consider the following problem: given three sets of real numbers, out...
research
∙
10/03/2018
Weighted dynamic finger in binary search trees
It is shown that the online binary search tree data structure GreedyASS ...
research
∙
08/31/2018
Pole Dancing: 3D Morphs for Tree Drawings
We study the question whether a crossing-free 3D morph between two strai...
research
∙
08/22/2018
Cookie Clicker
Cookie Clicker is a popular online incremental game where the goal of th...
research
∙
06/27/2018
Dynamic Trees with Almost-Optimal Access Cost
An optimal binary search tree for an access sequence on elements is a st...
research
∙
03/30/2018
On the Diameter of Tree Associahedra
We consider a natural notion of search trees on graphs, which we show is...
research
∙
03/15/2018
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region
The beacon model is a recent paradigm for guiding the trajectory of mess...
research
∙
03/03/2018
Polyhedral Characterization of Reversible Hinged Dissections
We prove that two polygons A and B have a reversible hinged dissection (...
research
∙
01/05/2018
Subquadratic Encodings for Point Configurations
For most algorithms dealing with sets of points in the plane, the only r...
research
∙
08/21/2017
