Mobile Image Retargeting. - Daniel Graf 001; Daniele Panozzo; Olga Sorkine-Hornung (VMV, 2013)

How to Sort by Walking on a Tree. - Daniel Graf 001 (ESA, 2015)

On Computing the Total Displacement Number via Weighted Motzkin Paths. - Andreas Bärtschi; Barbara Geissmann; Daniel Graf 001; Tomas Hruz; Paolo Penna; Thomas Tschager (IWOCA, 2016)

All-Pairs $2$-reachability in Õ(nω) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (CoRR, 2016)

Truthful Mechanisms for Delivery with Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (ATMOS, 2017)

All-Pairs 2-Reachability in O(n^w log n) Time. - Loukas Georgiadis; Daniel Graf 001; Giuseppe F. Italiano; Nikos Parotsidis; Przemyslaw Uznanski (ICALP, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

How to Sort by Walking and Swapping on Paths and Trees. - Daniel Graf 001 (Algorithmica, 2017)

Truthful Mechanisms for Delivery with Mobile Agents. - Andreas Bärtschi; Daniel Graf 001; Paolo Penna (CoRR, 2017)

Hamming distance completeness and sparse matrix multiplication. - Daniel Graf 001; Karim Labib; Przemyslaw Uznanski (CoRR, 2017)

Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. - Daniel Graf 001; Karim Labib; Przemyslaw Uznanski (ICALP, 2018)

Collective Fast Delivery by Energy-Efficient Agents. - Andreas Bärtschi; Daniel Graf 001; Matús Mihalák (MFCS, 2018)

Digraph Reachability Algorithms. - Daniel Wolleb-Graf (2018)

Hamming Distance Completeness. - Karim Labib; Przemyslaw Uznanski; Daniel Wolleb-Graf (CPM, 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 (ICALP, 2019)

A Framework for Searching in Graphs in the Presence of Errors. - Dariusz Dereniowski; Stefan Tiegel; Przemyslaw Uznanski; Daniel Wolleb-Graf (SOSA, 2019)

Switches in Eulerian graphs. - Ahad N. Zehmakan; Jerri Nummenpalo; Alexander Pilz; Daniel Wolleb-Graf (CoRR, 2019)

Collaborative delivery with energy-constrained mobile robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2020)