Daniel Wolleb-Graf

Theses:

Digraph Reachability Algorithms
Doctoral Thesis → 📙 Thesis, 📊 Slides
supervised by Peter Widmayer (D-INFK, ETH Zurich, 2018)
Scheduling and Sorting Algorithms for Robotic Warehousing Systems
Master Thesis → 📘 Thesis, 📊 Slides, 🌍 Website
supervised by Katherina Böhmová and Peter Widmayer (D-INFK, ETH Zurich, 2015)
Mobile Image Retargeting
Bachelor Thesis → 📕 Thesis, 📊 Slides, 🌍 Website
supervised by Daniele Panozzo and Olga Sorkine-Hornung (D-INFK, ETH Zurich, 2013)
Jassen auf Basis der Spieltheorie
Matura Thesis → 📗 Thesis, 📊 Slides, 🌍 Website
supervised by Josef Vogt (Kantonsschule Sargans, 2009)

Publications:

Fast Map Matching with Vertex-Monotone Fréchet Distance
ATMOS 2021 → 📜 Paper
joint work with Daniel Chen and Christian Sommer
Switches in Eulerian graphs
EUROCOMB 2019 → 📜 Full Paper
joint work with Ahad N. Zehmakan, Jerri Nummenpalo, and Alexander Pilz
Faster Algorithms for All-Pairs Bounded Min-Cuts
ICALP 2019 → 📜 Paper, 📜 Full Paper
joint work with Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, and Przemysław Uznański
A Framework for Searching in Graphs in the Presence of Errors
SOSA 2019 → 📜 Full Paper
joint work with Dariusz Dereniowski, Stefan Tiegel, and Przemysław Uznański
Hamming Distance Completeness and Sparse Matrix Multiplication
ICALP A 2018 Brief Announcement,
CPM 2019 Best Paper Award → 📜 Full Paper
joint work with Karim Labib and Przemysław Uznański
Collective fast delivery by energy-efficient agents
MFCS 2018 → 📜 Paper, 📜 Full Paper
joint work Andreas Bärtschi and Matúš Mihalák
Truthful Mechanisms for Delivery with Mobile Agents
ATMOS 2017 → 📜 Paper, 📜 Full Paper, 📊 Slides
joint work with Andreas Bärtschi and Paolo Penna
All-Pairs 2-Reachability in O(n^ω log(n)) Time
ICALP 2017 → 📜 Paper, 📜 Full Paper, 📊 Slides
joint work with Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis and Przemysław Uznański
Energy-efficient Delivery by Heterogeneous Mobile Agents
STACS 2017 → 📜 Paper, 📜 Full Paper
joint work with Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Jan Hackfeld and Paolo Penna
On Computing the Total Displacement Number via Weighted Motzkin Paths
IWOCA 2016 → 📜 Paper, 🖥 Implementation, 💾 OEIS
joint work with Andreas Bärtschi, Barbara Geissmann, Tomas Hruz, Paolo Penna and Thomas Tschager
Watch them Fight! Creativity Task Tournaments of the Swiss Olympiad in Informatics
IOI 2016 → 📜 Paper, 📊 Slides, 🎥 Video, 🌍 Website
joint work with Samuel Grütter and Benjamin Schmid
Collaborative Delivery with Energy-Constrained Mobile Robots
SIROCCO 2016 → 📜 Paper, 📊 Slides
Theoretical Computer Science 2017 → 📜 Journal Version
joint work with Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Arnaud Labourel and Matúš Mihalák
How to Sort by Walking (and Swapping) on a Tree
ESA 2015 → 📜 Paper, 🖥 Implementation, 📊 Slides, 📘 Master Thesis
Algorithmica 2017 → 📜 Paper, 📜 Full Paper
Mobile Image Retargeting
VMV 2013 → 🌍 Website, 📜 Paper, 🖥 Implementation, 📊 Slides, 📱App, 🎥 Video, 📕 Bachelor Thesis
joint work with Daniele Panozzo and Olga Sorkine-Hornung

Recent Talks:

Fast Map Matching with Vertex-Monotone Fréchet Distance. ATMOS 2021: Online, September 10, 2021
based on joint work with Daniel Chen and Christian Sommer
Truthful Mechanisms for Delivery with Mobile Agents. ATMOS 2017: TU Vienna, September 7, 2017 → 📊 Slides
based on joint work with Andreas Bärtschi and Paolo Penna
Dynamic Connectivity on Forests with Link-Cut Trees. Seminar on Algorithms, Data Structures, and Applications, SOS: ETH Zürich, 8.12.2016 → 📃 Handout, mainly based on this lecture by Erik Demaine
2-Reachability is Almost as Easy as Transitive Closure. TI Mittagsseminar ETH Zurich, November 8, 2016 → 📊 Slides
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: Aalto University, Helsinki, July 21, 2016 → 📊 Slides
joint work with Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Arnaud Labourel and Matúš Mihalák