In Preparation Journals Conferences Book chapters Theses Preprints and Technical Reports

Recent

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
Clique-Based Separators for Geometric Intersection Graphs

Journals

Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds
The complexity of Dominating Set in geometric intersection graphs
On the number of touching pairs in a set of planar curves

Conferences

A quasi-polynomial algorithm for well-spaced hyperbolic TSP
Euclidean TSP in Narrow Strips
Hyperbolic intersection graphs and (quasi)-polynomial time
On One-Round Discrete Voronoi Games
How Does Object Fatness Impact the Complexity of Packing in d Dimensions?
On Geometric Set Cover for Orthants
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces
An ETH-Tight Exact Algorithm for Euclidean TSP
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
The Dominating Set Problem in Geometric Intersection Graphs
The Homogeneous Broadcast Problem in Narrow and Wide Strips
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs
Connected Dominating Set on Unit Disk Graphs is W[1]-hard
Succinct tree coding for greedy navigation
Notes on dual-critical graphs

Book chapters

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs

Theses

ETH-tight algorithms for geometric network problems recipient.

Preprints and Technical Reports

5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points
Dual-Critical Graphs: Notes on parity constrained orientations