Papers

Journals

with: Mark de Berg ● Hans L. Bodlaender

The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms

Algorithmica 81(7), p 2934–2962 (2019)

with: Mark de Berg ● Hans L. Bodlaender

The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds

Algorithmica 81(7), p 2963–2990 (2019)

with: Mark de Berg ● Gerhard J. Woeginger

The Dominating Set Problem in Geometric Intersection Graphs

Theoretical Computer Science 769, p 18–31 (2019)

with: Péter Györgyi ● Bálint Hujter

On the Number of Touching Pairs in a Set of Planar Curves (2018)

Computational Geometry: Theory and Applciations 67, p 29–37 (2018)

Conferences

with: Karl Bringmann ● Michał Pilipczuk ● Erik Jan van Leeuwen

On Geometric Set Cover for Orthants (2019)

27th Annual European Symposium on Algorithms, (ESA) — Munich/Garching, Germany.

with: Jesper Nederlof ● Erik Jan van Leeuwen

Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces (2019) ArXiv

30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) — San Diego, CA, USA

with: Mark de Berg ● Hans L. Bodlaender ● Sudeshna Kolay

An ETH-Tight Exact Algorithm for Euclidean TSP (2018) ArXiv

59th Annual IEEE Symposium on Foundations of Computer Science (FOCS) — Paris, France

with: Mark de Berg ● Hans L. Bodlaender ● Dániel Marx ● Tom C. van der Zanden

A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (2018) ArXiv

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC) — Los Angeles, CA, USA

with: Mark de Berg ● Gerhard J. Woeginger

The Dominating Set Problem in Geometric Intersection Graphs (2017) ArXiv

International Symposium on Parameterized and Exact Computation (IPEC) — Vienna, Austria

with: Mark de Berg ● Hans L. Bodlaender

The Homogeneous Broadcast Problem in Narrow and Wide Strips (2017) ArXiv

Workshop on Algorithms and Data Structures (WADS) — St. John's, Canada

with: Tom C. van der Zanden

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (2017)

International Conference on Algorithms and Complexity (CIAC) — Athens, Greece

with: Mark de Berg ● Hans L. Bodlaender

Connected Dominating Set on Unit Disk Graphs is W[1]-hard (2016)

European Workshop on Computational Geometry (EuroCG) — Lugano, Switzerland

with: Zoltán Király

Succinct tree coding for greedy navigation (2015) (pdf)

9th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications — Fukuoka, Japan

with: Zoltán Király

Notes on dual-critical graphs (2013)

8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications — Veszprém, Hungary

Theses

ETH-Tight Algorithms for Geometric Network Problems

Advisors: Mark de Berg and Hans L. Bodlaender

TU Eindhoven, Department of Mathematics and Computer Science (2019)

Preprints and Technical Reports

with: Bálint Hujter

5-colorable visibility graphs have bounded size or 4 collinear points (2014)

Arxiv preprint 1410.7273

with: Zoltán Király

Dual-Critical Graphs: Notes on parity constrained orientations (2012)

EGRES Technical Report 2012-07