We present an algorithm that enumerates and classifies all edge-to-edge
...
The fragile complexity of a comparison-based algorithm is f(n) if each
i...
We give a complete description of all convex polyhedra whose surface can...
A data structure is presented that explicitly maintains the graph of a
V...
Which convex 3D polyhedra can be obtained by gluing several regular hexa...
We consider the design of adaptive data structures for searching element...
We revisit self-adjusting external memory tree data structures, which co...
We consider the following problem: given three sets of real numbers, out...
It is shown that the online binary search tree data structure GreedyASS
...
We study the question whether a crossing-free 3D morph between two
strai...
Cookie Clicker is a popular online incremental game where the goal of th...
An optimal binary search tree for an access sequence on elements is a st...
We consider a natural notion of search trees on graphs, which we show is...
The beacon model is a recent paradigm for guiding the trajectory of mess...
We prove that two polygons A and B have a reversible hinged dissection (...
For most algorithms dealing with sets of points in the plane, the only
r...
We define the Helly number of a polyomino P as the smallest number h suc...