
Framework for ETHtight Algorithms and Lower
Bounds in Geometric Intersection Graphs
TU/e Noon seminar
Eindhoven, 18 April 2017

The Dominating Set Problem in Intersection Graphs
IPEC 2017
Vienna, Austria, 6 September 2017

The Homogeneous Broadcast Problem in Narrow
and Wide Strips
WADS 2017
St. John’s, Canada, 1 August 2017

On the Exact Complexity of Hamiltonian Cycle and qColouring in Disk Graphs
CIAC 2017
Athens, Greece, 24 May 2017

On the complexity of binary broadcast problems
Workshop on FixedParameter Computational Geometry
Lorentz Center, Leiden, 4 April 2016

Connected dominating set on unit disk graphs is W[1]hard
EuroCG 2016
Lugano, Switzerland, 30 March 2016

Navigating graphs with log n + O(log log n) bit addresses
Dutch Computational Geometry Day
Utrecht, 19 November 2015

On the number of touching pairs in a set of planar curves
TU/e Noon seminar
Eindhoven, 17 November 2015

Succinct tree coding for greedy navigation
9th HungarianJapanese Symposium
on Discrete Mathematics and Its Applications
Fukuoka, Japan, 3 June 2015

Notes on DualCritical Graphs
8th JapaneseHungarian Symposium
on Discrete Mathematics and Its Applications
Veszprém, 6 June 2013