Suivre
Daniel Wolleb-Graf
Daniel Wolleb-Graf
ETH Zurich
Adresse e-mail validée de ethz.ch - Page d'accueil
Titre
Citée par
Citée par
Année
Collaborative delivery with energy-constrained mobile robots
A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ...
Theoretical Computer Science 810, 2-14, 2020
282020
Energy-efficient delivery by heterogeneous mobile agents
A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna
arXiv preprint arXiv:1610.02361, 2016
252016
Faster algorithms for all-pairs bounded min-cuts
A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ...
arXiv preprint arXiv:1807.05803, 2018
182018
Hamming distance completeness
K Labib, P Uznanski, D Wolleb-Graf
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) 128, 14, 2019
132019
Truthful mechanisms for delivery with mobile agents
A Bärtschi, D Graf, P Penna
arXiv preprint arXiv:1702.07665, 2017
132017
Collective fast delivery by energy-efficient agents
A Bärtschi, D Graf, M Mihalák
arXiv preprint arXiv:1809.00077, 2018
122018
A framework for searching in graphs in the presence of errors
D Dereniowski, S Tiegel, P Uznański, D Wolleb-Graf
arXiv preprint arXiv:1804.02075, 2018
102018
How to sort by walking on a tree
D Graf
Algorithms-ESA 2015, 643-655, 2015
102015
All-Pairs 2-Reachability in Time
L Georgiadis, D Graf, GF Italiano, N Parotsidis, P Uznański
arXiv preprint arXiv:1612.08075, 2016
72016
Brief announcement: Hamming distance completeness and sparse matrix multiplication
DS Wolleb, K Labib, P Uznanski
Leibniz International Proceedings in Informatics (LIPIcs) 107, 109, 2018
42018
How to sort by walking and swapping on paths and trees
D Graf
Algorithmica 78 (4), 1151-1181, 2017
42017
On computing the total displacement number via weighted Motzkin paths
A Bärtschi, B Geissmann, D Graf, T Hruz, P Penna, T Tschager
International Workshop on Combinatorial Algorithms, 423-434, 2016
42016
Mobile Image Retargeting.
D Graf, D Panozzo, O Sorkine-Hornung
VMV, 49-56, 2013
42013
Hamming distance completeness and sparse matrix multiplication
D Graf, K Labib, P Uznański
arXiv preprint arXiv:1711.03887, 2017
22017
Scheduling and Sorting Algorithms for Robotic Warehousing Systems
D Graf
ETH-Zürich, 2015
22015
Switches in Eulerian graphs
AN Zehmakan, J Nummenpalo, A Pilz, D Wolleb-Graf
arXiv preprint arXiv:1905.06895, 2019
12019
Watch them fight! Creativity task tournaments of the Swiss Olympiad in Informatics
S Grütter, D Graf, B Schmid
Olympiads in Informatics 10, 73-85, 2016
12016
Digraph Reachability Algorithms
D Wolleb-Graf
ETH Zurich, 2018
2018
All-Pairs 2-reachability in O (nω) Time
L Georgiadis, D Graf, GF Italiano, N Parotsidis, P Uznański
arXiv preprint arXiv:1612.08075, 2016
2016
Lecture with Computer Exercises: Modelling and Simulating Social Systems with MATLAB
D Graf, M Krebs
2010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20