1 citations · 1 across the 3 of their papers we have counts for
8 papers
Worst-Case Efficient Dynamic Geometric Independent Set
Jean Cardinal, John Iacono, Grigorios Koumoutsos
We consider the problem of maintaining an approximate maximum independent set of geometric objects under insertions and deletions. We present data structures that maintain a consta…
Memoryless Algorithms for the Generalized -server Problem on Uniform Metrics
Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
We consider the generalized -server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of on their competitive ratio. In parti…
Dynamic Geometric Independent Set
Sujoy Bhore, Jean Cardinal, John Iacono +1
We present fully dynamic approximation algorithms for the Maximum Independent Set problem on several types of geometric objects: intervals on the real line, arbitrary axis-aligned…
Sublinear Explicit Incremental Planar Voronoi Diagrams
Elena Arseneva, John Iacono, Grigorios Koumoutsos +2
A data structure is presented that explicitly maintains the graph of a Voronoi diagram of point sites in the plane or the dual graph of a convex hull of points in three dimensi…
Competitive Online Search Trees on Trees
Prosenjit Bose, Jean Cardinal, John Iacono +2
We consider the design of adaptive data structures for searching elements of a tree-structured space. We use a natural generalization of the rotation-based online binary search tre…
Belga B-trees
Erik D. Demaine, John Iacono, Grigorios Koumoutsos +1
We revisit self-adjusting external memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distr…