Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Wolleb-Graf
Person information
- affiliation: ETH Zürich, Department of Computer Science, Switzerland
Other persons with the same name
- Daniel Graf 0002 — Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
- Daniel Graf 0003 — University of Applied Sciences, Konstanz, Germany
- Daniel Graf 0004
![[0000-0002-9135-9363]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9135-9363")
— University of Vienna, Faculty of Psychology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Daniel Wolleb-Graf:
Digraph Reachability Algorithms. ETH Zurich, Zürich, Switzerland, 2018
Journal Articles
- 2020
- [j2]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - 2017
- [j1]Daniel Graf:
How to Sort by Walking and Swapping on Paths and Trees. Algorithmica 78(4): 1151-1181 (2017)
Conference and Workshop Papers
- 2019
- [c12]Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Hamming Distance Completeness. CPM 2019: 14:1-14:17 - [c11]Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Faster Algorithms for All-Pairs Bounded Min-Cuts. ICALP 2019: 7:1-7:15 - [c10]Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf:
A Framework for Searching in Graphs in the Presence of Errors. SOSA 2019: 4:1-4:17 - 2018
- [c9]Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP 2018: 109:1-109:4 - [c8]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective Fast Delivery by Energy-Efficient Agents. MFCS 2018: 56:1-56:16 - 2017
- [c7]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Agents. ATMOS 2017: 2:1-2:17 - [c6]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs 2-Reachability in O(n^w log n) Time. ICALP 2017: 74:1-74:14 - [c5]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017: 10:1-10:14 - 2016
- [c4]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA 2016: 423-434 - [c3]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - 2015
- [c2]Daniel Graf:
How to Sort by Walking on a Tree. ESA 2015: 643-655 - 2013
- [c1]Daniel Graf, Daniele Panozzo, Olga Sorkine-Hornung:
Mobile Image Retargeting. VMV 2013: 49-56
Informal and Other Publications
- 2019
- [i10]Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf:
Switches in Eulerian graphs. CoRR abs/1905.06895 (2019) - 2018
- [i9]Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uznanski:
A Framework for Searching in Graphs in the Presence of Errors. CoRR abs/1804.02075 (2018) - [i8]Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski:
Faster Algorithms for All-Pairs Bounded Min-Cuts. CoRR abs/1807.05803 (2018) - [i7]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective fast delivery by energy-efficient agents. CoRR abs/1809.00077 (2018) - 2017
- [i6]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Mobile Agents. CoRR abs/1702.07665 (2017) - [i5]Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Hamming distance completeness and sparse matrix multiplication. CoRR abs/1711.03887 (2017) - 2016
- [i4]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On computing the total displacement number via weighted Motzkin paths. CoRR abs/1606.05538 (2016) - [i3]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - [i2]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR abs/1610.02361 (2016) - [i1]Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski:
All-Pairs $2$-reachability in Õ(nω) Time. CoRR abs/1612.08075 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-19 04:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
