| 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 | 29 | 2020 |
| 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 | 26 | 2016 |
| Faster algorithms for all-pairs bounded min-cuts A Abboud, L Georgiadis, GF Italiano, R Krauthgamer, N Parotsidis, ... arXiv preprint arXiv:1807.05803, 2018 | 20 | 2018 |
| Hamming distance completeness K Labib, P Uznanski, D Wolleb-Graf 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) 128, 14, 2019 | 14 | 2019 |
| 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 | 14 | 2018 |
| Truthful mechanisms for delivery with mobile agents A Bärtschi, D Graf, P Penna arXiv preprint arXiv:1702.07665, 2017 | 13 | 2017 |
| Collective fast delivery by energy-efficient agents A Bärtschi, D Graf, M Mihalák arXiv preprint arXiv:1809.00077, 2018 | 12 | 2018 |
| How to sort by walking on a tree D Graf Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 10 | 2015 |
| All-Pairs 2-Reachability in Time L Georgiadis, D Graf, GF Italiano, N Parotsidis, P Uznański arXiv preprint arXiv:1612.08075, 2016 | 7 | 2016 |
| How to sort by walking and swapping on paths and trees D Graf Algorithmica 78 (4), 1151-1181, 2017 | 5 | 2017 |
| Brief announcement: Hamming distance completeness and sparse matrix multiplication DS Wolleb, K Labib, P Uznanski Leibniz International Proceedings in Informatics (LIPIcs) 107, 109, 2018 | 4 | 2018 |
| On computing the total displacement number via weighted Motzkin paths A Bärtschi, B Geissmann, D Graf, T Hruz, P Penna, T Tschager Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki …, 2016 | 4 | 2016 |
| Mobile Image Retargeting. D Graf, D Panozzo, O Sorkine-Hornung VMV, 49-56, 2013 | 4 | 2013 |
| Hamming distance completeness and sparse matrix multiplication D Graf, K Labib, P Uznański arXiv preprint arXiv:1711.03887, 2017 | 2 | 2017 |
| Scheduling and Sorting Algorithms for Robotic Warehousing Systems D Graf ETH-Zürich, 2015 | 2 | 2015 |
| Switches in Eulerian graphs AN Zehmakan, J Nummenpalo, A Pilz, D Wolleb-Graf arXiv preprint arXiv:1905.06895, 2019 | 1 | 2019 |
| Digraph Reachability Algorithms D Wolleb-Graf ETH Zurich, 2018 | 1 | 2018 |
| 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 | 1 | 2016 |
| 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 |
Przemysław UznańskiPathwayVerified email at pathway.com
