Daniel Wolleb-Graf

According to our database, Daniel Wolleb-Graf authored at least 18 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Collaborative delivery with energy-constrained mobile robots.

Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák

Theor. Comput. Sci., 2020

2019

Switches in Eulerian graphs.

Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf

CoRR, 2019

A Framework for Searching in Graphs in the Presence of Errors.

Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Faster Algorithms for All-Pairs Bounded Min-Cuts.

Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Hamming Distance Completeness.

Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Digraph Reachability Algorithms.

Daniel Wolleb-Graf

PhD thesis, 2018

Collective Fast Delivery by Energy-Efficient Agents.

Andreas Bärtschi, Daniel Graf, Matús Mihalák

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication.

Daniel Graf, Karim Labib, Przemyslaw Uznanski

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Hamming distance completeness and sparse matrix multiplication.

Daniel Graf, Karim Labib, Przemyslaw Uznanski

CoRR, 2017

Truthful Mechanisms for Delivery with Mobile Agents.

Andreas Bärtschi, Daniel Graf, Paolo Penna

CoRR, 2017

How to Sort by Walking and Swapping on Paths and Trees.

Daniel Graf

Algorithmica, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.

Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

All-Pairs 2-Reachability in O(n^w log n) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Truthful Mechanisms for Delivery with Agents.

Andreas Bärtschi, Daniel Graf, Paolo Penna

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

All-Pairs $2$-reachability in Õ(n^ω) Time.

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski

CoRR, 2016

On Computing the Total Displacement Number via Weighted Motzkin Paths.

Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

How to Sort by Walking on a Tree.

Daniel Graf

Proceedings of the Algorithms - ESA 2015, 2015

2013

Mobile Image Retargeting.

Daniel Graf, Daniele Panozzo, Olga Sorkine-Hornung

Proceedings of the 18th International Workshop on Vision, Modeling, and Visualization, 2013