-
2
-
-
77951688930
-
Highway dimension, shortest paths, and prov-ably efficient algorithms
-
M. Charikar, editor SIAM
-
I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck. Highway Dimension, Shortest Paths, and Prov-ably Efficient Algorithms. In M. Charikar, editor, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), pages 782-793. SIAM, 2010.
-
(2010)
Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10)
, pp. 782-793
-
-
Abraham, I.1
Fiat, A.2
Goldberg, A.V.3
Werneck, R.F.4
-
4
-
-
77955885924
-
-
Demetrescu et al. [20]
-
C. Barrett, K. Bisset, M. Holzer, G. Konjevod, M. V. Marathe, and D. Wagner. Engineering Label-Constrained Shortest-Path Algorithms. In Demetrescu et al. [20], pages 309-319.
-
Engineering Label-Constrained Shortest-Path Algorithms
, pp. 309-319
-
-
Barrett, C.1
Bisset, K.2
Holzer, M.3
Konjevod, G.4
Marathe, M.V.5
Wagner, D.6
-
5
-
-
0034932682
-
Formal-language-constrained path problems
-
C. Barrett, R. Jacob, and M. V. Marathe. Formal-Language-Constrained Path Problems. SIAM Journal on Computing, 30(3):809-837, 2000.
-
(2000)
SIAM Journal on Computing
, vol.30
, Issue.3
, pp. 809-837
-
-
Barrett, C.1
Jacob, R.2
Marathe, M.V.3
-
6
-
-
70349869353
-
Car or public transport - Two worlds
-
S. Albers, H. Alt, and S. Näher, editors Springer
-
H. Bast. Car or Public Transport - Two Worlds. In S. Albers, H. Alt, and S. Näher, editors, Efficient Algorithms, Volume 5760 of Electronic Notes in Theoretical Computer Science, pages 355-367. Springer, 2009.
-
(2009)
Efficient Algorithms, Volume 5760 of Electronic Notes in Theoretical Computer Science
, pp. 355-367
-
-
Bast, H.1
-
7
-
-
78249239772
-
Fast routing in very large public transportation networks using transfer patterns
-
Springer
-
H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson, V. Raychev, and F. Viger. Fast Routing in Very Large Public Transportation Networks using Transfer Patterns. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10), Volume 6346 of Lecture Notes in Computer Science, pages 290-301. Springer, 2010.
-
(2010)
Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10), Volume 6346 of Lecture Notes in Computer Science
, pp. 290-301
-
-
Bast, H.1
Carlsson, E.2
Eigenwillig, A.3
Geisberger, R.4
Harrelson, C.5
Raychev, V.6
Viger, F.7
-
8
-
-
34547959338
-
In transit to constant shortest-path queries in road networks
-
SIAM
-
H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes. In Transit to Constant Shortest-Path Queries in Road Networks. In Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), pages 46-59. SIAM, 2007.
-
(2007)
Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)
, pp. 46-59
-
-
Bast, H.1
Funke, S.2
Matijevic, D.3
Sanders, P.4
Schultes, D.5
-
10
-
-
77955861994
-
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
-
January Special Section devoted to WEA'08
-
R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics, 15(2.3):1-31, January 2010. Special Section devoted to WEA'08.
-
(2010)
ACM Journal of Experimental Algorithmics
, vol.15
, Issue.2-3
, pp. 1-31
-
-
Bauer, R.1
Delling, D.2
Sanders, P.3
Schieferdecker, D.4
Schultes, D.5
Wagner, D.6
-
12
-
-
80053265655
-
PHAST: Hardware-accelerated shortest path trees
-
IEEE Computer Society Best Paper Award - Algorithms Track
-
D. Delling, A. V. Goldberg, A. Nowatzyk, and R. F. Werneck. PHAST: Hardware-Accelerated Shortest Path Trees. In 25th International Parallel and Distributed Processing Symposium (IPDPS'11), pages 921-931. IEEE Computer Society, 2011. Best Paper Award - Algorithms Track.
-
(2011)
25th International Parallel and Distributed Processing Symposium (IPDPS'11)
, pp. 921-931
-
-
Delling, D.1
Goldberg, A.V.2
Nowatzyk, A.3
Werneck, R.F.4
-
14
-
-
79955842779
-
-
Demetrescu et al. [20]
-
D. Delling, M. Holzer, K. Müller, F. Schulz, and D. Wagner. High-Performance Multi-Level Routing. In Demetrescu et al. [20], pages 73-92.
-
High-Performance Multi-Level Routing
, pp. 73-92
-
-
Delling, D.1
Holzer, M.2
Müller, K.3
Schulz, F.4
Wagner, D.5
-
16
-
-
58549085056
-
Bidirectional core-based routing in dynamic time-dependent road networks
-
S.-H. Hong, H. Nagamochi, and T. Fukunaga, editors Springer, December
-
D. Delling and G. Nannicini. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In S.-H. Hong, H. Nagamochi, and T. Fukunaga, editors, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), Volume 5369 of Lecture Notes in Computer Science, pages 813-824. Springer, December 2008.
-
(2008)
Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), Volume 5369 of Lecture Notes in Computer Science
, pp. 813-824
-
-
Delling, D.1
Nannicini, G.2
-
17
-
-
70350426108
-
Accelerating multi-modal route planning by access-nodes
-
A. Fiat and P. Sanders, editors Springer, September
-
D. Delling, T. Pajor, and D. Wagner. Accelerating Multi-Modal Route Planning by Access-Nodes. In A. Fiat and P. Sanders, editors, Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), Volume 5757 of Lecture Notes in Computer Science, pages 587-598. Springer, September 2009.
-
(2009)
Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), Volume 5757 of Lecture Notes in Computer Science
, pp. 587-598
-
-
Delling, D.1
Pajor, T.2
Wagner, D.3
-
19
-
-
70349316563
-
Engineering route planning algorithms
-
J. Lerner, D. Wagner, and K. A. Zweig, editors Springer
-
D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering Route Planning Algorithms. In J. Lerner, D. Wagner, and K. A. Zweig, editors, Algorithmics of Large and Complex Networks, Volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009.
-
(2009)
Algorithmics of Large and Complex Networks, Volume 5515 of Lecture Notes in Computer Science
, pp. 117-139
-
-
Delling, D.1
Sanders, P.2
Schultes, D.3
Wagner, D.4
-
22
-
-
78249255035
-
Contraction of timetable networks with realistic transfers
-
R. Geisberger. Contraction of Timetable Networks with Realistic Transfers. In Festa [21], pages 71-82.
-
Festa [21]
, pp. 71-82
-
-
Geisberger, R.1
-
24
-
-
45449120587
-
Contraction hierarchies: Faster and simpler hierarchical routing in road networks
-
C. C. McGeoch, editor Springer, June
-
R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In C. C. McGeoch, editor, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Volume 5038 of Lecture Notes in Computer Science, pages 319-333. Springer, June 2008.
-
(2008)
Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), Volume 5038 of Lecture Notes in Computer Science
, pp. 319-333
-
-
Geisberger, R.1
Sanders, P.2
Schultes, D.3
Delling, D.4
-
25
-
-
84882328679
-
-
General Transit Feed. http://code.google.com/p/googletransitdatafeed/, 2010.
-
(2010)
General Transit Feed
-
-
-
26
-
-
49749144986
-
A practical shortest path algorithm with linear expected time
-
A. V. Goldberg. A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing, 37:1637-1655, 2008.
-
(2008)
SIAM Journal on Computing
, vol.37
, pp. 1637-1655
-
-
Goldberg, A.V.1
-
29
-
-
84882369957
-
-
HaCon - Ingenieurgesellschaft mbH. http://www.hacon.de, 2008.
-
(2008)
-
-
-
31
-
-
53849100358
-
Engineering multi-level overlay graphs for shortest-path queries
-
December
-
M. Holzer, F. Schulz, and D. Wagner. Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM Journal of Experimental Algorithmics, 13(2.5):1-26, December 2008.
-
(2008)
ACM Journal of Experimental Algorithmics
, vol.13
, Issue.2-5
, pp. 1-26
-
-
Holzer, M.1
Schulz, F.2
Wagner, D.3
-
32
-
-
84873714040
-
UniALT for regular language constraint shortest paths on a multi-modal transportation network
-
D. Kirchler, L. Liberti, T. Pajor, and R. W. Calvo. UniALT for regular language constraint shortest paths on a multi-modal transportation network. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11), Volume 20 of OpenAccess Series in Informatics (OASIcs), 2011.
-
(2011)
Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11), Volume 20 of OpenAccess Series in Informatics (OASIcs)
-
-
Kirchler, D.1
Liberti, L.2
Pajor, T.3
Calvo, R.W.4
-
33
-
-
24944471617
-
An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background
-
IfGI prints
-
U. Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In Geoinformation und Mo- bilität - von der Forschung zur praktischen Anwendung, Volume 22, pages 219-230. IfGI prints, 2004.
-
(2004)
Geoinformation und Mo- Bilität - Von der Forschung Zur Praktischen Anwendung
, vol.22
, pp. 219-230
-
-
Lauther, U.1
-
34
-
-
84867524779
-
Finding regular simple paths in graph databases
-
A. O. Mendelzon and P. T. Wood. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing, 24(6):1235-1258, 1995.
-
(1995)
SIAM Journal on Computing
, vol.24
, Issue.6
, pp. 1235-1258
-
-
Mendelzon, A.O.1
Wood, P.T.2
-
35
-
-
84882360676
-
-
Metropolitan Transportation Authority. http://www.mta.info/default.html, 1965.
-
(1965)
-
-
-
36
-
-
70350350140
-
-
Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik
-
T. Pajor. Multi-Modal Route Planning. Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, 2009. Online available at http://i11www.ira.uka.de/extra/publications/p-mmrp-09.pdf.
-
(2009)
Multi-Modal Route Planning
-
-
Pajor, T.1
-
39
-
-
51149109592
-
Efficient models for timetable information in public transportation systems
-
E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis. Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics, 12(2.4):1-39, 2007.
-
(2007)
ACM Journal of Experimental Algorithmics
, vol.12
, Issue.2-4
, pp. 1-39
-
-
Pyrga, E.1
Schulz, F.2
Wagner, D.3
Zaroliagis, C.4
-
41
-
-
85000327782
-
Dijkstra's algorithm on-line: An empirical case study from public railroad transport
-
F. Schulz, D. Wagner, and K. Weihe. Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics, 5(12):1-23, 2000.
-
(2000)
ACM Journal of Experimental Algorithmics
, vol.5
, Issue.12
, pp. 1-23
-
-
Schulz, F.1
Wagner, D.2
Weihe, K.3
-
42
-
-
84940390958
-
Geometric containers for efficient shortest-path computation
-
D. Wagner, T. Willhalm, and C. Zaroliagis. Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics, 10(1.3):1-30, 2005.
-
(2005)
ACM Journal of Experimental Algorithmics
, vol.10
, Issue.1-3
, pp. 1-30
-
-
Wagner, D.1
Willhalm, T.2
Zaroliagis, C.3
|