
Online Euclidean Spanners
In this paper, we study the online Euclidean spanners problem for points...
read it

Light Euclidean Steiner Spanners in the Plane
Lightness is a fundamental parameter for Euclidean spanners; it is the r...
read it

Reconfiguration of Connected Graph Partitions via Recombination
Motivated by applications in gerrymandering detection, we study a reconf...
read it

On Euclidean Steiner (1+ε)Spanners
Lightness and sparsity are two natural parameters for Euclidean (1+ε)sp...
read it

Simple Topological Drawings of kPlanar Graphs
Every finite graph admits a simple (topological) drawing, that is, a dra...
read it

Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turnin...
read it

Rainbow polygons for colored point sets in the plane
Given a colored point set in the plane, a perfect rainbow polygon is a s...
read it

Cutting Polygons into Small Pieces with Chords: LaserBased Localization
Motivated by indoor localization by tripwire lasers, we study the proble...
read it

Universal Geometric Graphs
We introduce and study the problem of constructing geometric graphs that...
read it

Compatible Paths on Labelled Point Sets
Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...
read it

Sparse Hop Spanners for Unit Disk Graphs
A unit disk graph G on a given set of points P in the plane is a geometr...
read it

Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
This is the arXiv index for the electronic proceedings of GD 2019, which...
read it

Simple kPlanar Graphs are Simple (k+1)Quasiplanar
A simple topological graph is kquasiplanar (k≥ 2) if it contains no k p...
read it

Atomic Embeddability, Clustered Planarity, and Thickenability
We study the atomic embeddability testing problem, which is a common gen...
read it

On the Stretch Factor of Polygonal Chains
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P...
read it

Rock Climber Distance: Frogs versus Dogs
The classical measure of similarity between two polygonal chains in Eucl...
read it

Circumscribing Polygons and Polygonizations for Disjoint Line Segments
Given a planar straightline graph G=(V,E) in R^2, a circumscribing poly...
read it

Reconfiguration of Connected Graph Partitions
Motivated by recent computational models for redistricting and detection...
read it

Improved Bounds on Information Dissemination by Manhattan Random Waypoint Model
With the popularity of portable wireless devices it is important to mode...
read it

Crossing Minimization in Perturbed Drawings
Due to data compression or low resolution, nearby vertices and edges of ...
read it

Maximum Area AxisAligned Square Packings
Given a point set S={s_1,... , s_n} in the unit square U=[0,1]^2, an anc...
read it

Recognizing Weak Embeddings of Graphs
We present an efficient algorithm for a problem in the interface between...
read it

Gapplanar Graphs
We introduce the family of kgapplanar graphs for k ≥ 0, i.e., graphs t...
read it

Online unit clustering in higher dimensions
We revisit the online Unit Clustering problem in higher dimensions: Give...
read it
Csaba D. Tóth
is this you? claim profile