default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Geisberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j3]Gernot Veit Batz, Robert Geisberger, Peter Sanders, Christian Vetter:
Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics 18 (2013)- 2012
- [j2]Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras
:
Route planning with flexible edge restrictions. ACM J. Exp. Algorithmics 17(1) (2012) - [j1]Robert Geisberger, Peter Sanders, Dominik Schultes, Christian Vetter:
Exact Routing in Large Road Networks Using Contraction Hierarchies. Transp. Sci. 46(3): 388-404 (2012) - [c13]Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders, Roman Zubkov:
Efficient Route Compression for Hybrid Route Planning. MedAlg 2012: 93-107 - 2011
- [b1]Robert Geisberger:
Advanced Route Planning in Transportation Networks. Karlsruhe University, Germany, 2011 - [c12]Roland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders:
Alternative Route Graphs in Road Networks. TAPAS 2011: 21-32 - [c11]Robert Geisberger, Christian Vetter:
Efficient Routing in Road Networks with Turn Costs. SEA 2011: 100-111 - 2010
- [c10]Nathan R. Sturtevant, Robert Geisberger:
A Comparison of High-Level Approaches for Speeding Up Pathfinding. AIIDE 2010 - [c9]Robert Geisberger, Moritz Kobitzsch, Peter Sanders:
Route Planning with Flexible Objective Functions. ALENEX 2010: 124-137 - [c8]Robert Geisberger, Peter Sanders:
Engineering Time-Dependent Many-to-Many Shortest Paths Computation. ATMOS 2010: 74-87 - [c7]Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker:
Fast Detour Computation for Ride Sharing. ATMOS 2010: 88-99 - [c6]Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger:
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. ESA (1) 2010: 290-301 - [c5]Robert Geisberger, Dennis Schieferdecker:
Heuristic Contraction Hierarchies with Approximation Guarantee. SOCS 2010: 31-38 - [c4]Robert Geisberger:
Contraction of Timetable Networks with Realistic Transfers. SEA 2010: 71-82 - [c3]Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders:
Time-Dependent Contraction Hierarchies and Approximation. SEA 2010: 166-177 - [i6]Robert Geisberger:
Heuristic Contraction Hierarchies with Approximation Guarantee. CoRR abs/1002.1021 (2010) - [i5]Jonathan Dees, Robert Geisberger, Peter Sanders, Roland Bader:
Defining and Computing Alternative Routes in Road Networks. CoRR abs/1002.4330 (2010) - [i4]Robert Geisberger:
Engineering Time-dependent One-To-All Computation. CoRR abs/1010.0809 (2010) - [i3]Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders:
Compressed Transmission of Route Descriptions. CoRR abs/1011.4465 (2010)
2000 – 2009
- 2009
- [i2]Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker:
Fast Detour Computation for Ride Sharing. CoRR abs/0907.5269 (2009) - [i1]Robert Geisberger:
Contraction of Timetable Networks with Realistic Transfers. CoRR abs/0908.1528 (2009) - 2008
- [c2]Robert Geisberger, Peter Sanders, Dominik Schultes:
Better Approximation of Betweenness Centrality. ALENEX 2008: 90-100 - [c1]Robert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling:
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. WEA 2008: 319-333
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-25 05:49 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:
