default search action
Dominik Schultes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c19]Larissa Schneider, Dominik Schultes:
Evaluating Swift-to-Kotlin and Kotlin-to-Swift Transpilers. MOBILESoft 2022: 102-106 - 2021
- [c18]Dominik Schultes:
SequalsK - A Bidirectional Swift-Kotlin-Transpiler. MOBILESoft@ICSE 2021: 73-83
2010 – 2019
- 2018
- [c17]Thomas Breitbach, Peter Sanders, Dominik Schultes:
Optimizing energy consumption and user experience in a mobile video streaming scenario. CCNC 2018: 1-9 - 2016
- [r2]Dominik Schultes:
Routing in Road Networks with Transit Nodes. Encyclopedia of Algorithms 2016: 1875-1879 - 2015
- [j6]Dominik Schultes:
Teaching at a university of applied sciences. it Inf. Technol. 57(1): 60-62 (2015) - 2012
- [j5]Peter Sanders, Dominik Schultes:
Engineering highway hierarchies. ACM J. Exp. Algorithmics 17(1) (2012) - [j4]Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti
:
Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012) - [j3]Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter:
Exact Routing in Large Road Networks Using Contraction Hierarchies. Transp. Sci. 46(3): 388-404 (2012) - 2010
- [j2]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM J. Exp. Algorithmics 15 (2010)
2000 – 2009
- 2009
- [c16]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139 - 2008
- [c15]Robert Geisberger, Peter Sanders, Dominik Schultes:
Better Approximation of Betweenness Centrality. ALENEX 2008: 90-100 - [c14]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135 - [c13]Peter Sanders, Dominik Schultes, Christian Vetter:
Mobile Route Planning. ESA 2008: 732-743 - [c12]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318 - [c11]Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333 - [c10]Giacomo Nannicini, Daniel Delling, Leo Liberti
Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346 - [p1]Dominik Schultes:
Routenplanung in Straßennetzen [Route Planning in Road Networks]. Ausgezeichnete Informatikdissertationen 2008: 271-280 - [r1]Dominik Schultes:
Routing in Road Networks with Transit Nodes. Encyclopedia of Algorithms 2008 - 2007
- [c9]Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007 - [c8]Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz
Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007 - [c7]Peter Sanders, Dominik Schultes:
Engineering Fast Route Planning Algorithms. WEA 2007: 23-36 - [c6]Dominik Schultes, Peter Sanders:
Dynamic Highway-Node Routing. WEA 2007: 66-79 - 2006
- [j1]Dominik Schultes:
Rainbow Sort: Sorting at the Speed of Light. Nat. Comput. 5(1): 67-82 (2006) - [c5]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Highway Hierarchies Star. The Shortest Path Problem 2006: 141-174 - [c4]Peter Sanders, Dominik Schultes:
Robust, Almost Constant Time Shortest-Path Queries in Road Networks. The Shortest Path Problem 2006: 193-218 - [c3]Peter Sanders, Dominik Schultes:
Engineering Highway Hierarchies. ESA 2006: 804-816 - 2005
- [c2]Peter Sanders, Dominik Schultes:
Highway Hierarchies Hasten Exact Shortest Path Queries. ESA 2005: 568-579 - 2004
- [c1]Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS 2004: 195-208
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-04-24 22:51 CEST 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: