37 citations · 192 across the 51 of their papers we have counts for
7 papers · 2 filters
Online Unit Covering in Euclidean Space
Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth
We revisit the online Unit Covering problem in higher dimensions: Given a set of points in , that arrive one by one, cover the points by balls of unit radius, so…
Recognizing Weak Embeddings of Graphs
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding of a graph into a 2-manifold maps…
Gap-planar Graphs
Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8
We introduce the family of -gap-planar graphs for , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge…
Online unit clustering in higher dimensions
Adrian Dumitrescu, Csaba D. Tóth
We revisit the online Unit Clustering and Unit Covering problems in higher dimensions: Given a set of points in a metric space, that arrive one by one, Unit Clustering asks to…
Two-Planar Graphs Are Quasiplanar
Michael Hoffmann, Csaba D. Tóth
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a…
Geometric Biplane Graphs II: Graph Augmentation
Alfredo García, Ferran Hurtado, Matias Korman +5
We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed…