Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Delling, Daniel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Robust distance queries on massive networks
Daniel Delling
,
Andrew V. Goldberg
,
Thomas Pajor
,
Renato F. Werneck
Lecture Notes in Computer Science
8737
, 2014, pp. 321-333
PHAST: Hardware-accelerated shortest path trees
Daniel Delling
,
Andrew V. Goldberg
,
Andreas Nowatzyk
,
Renato F. Werneck
Journal Parallel Distributed Computing
73
(7), 2013, pp. 940-952
Hierarchical hub labelings for shortest paths
Ittai Abraham
,
Daniel Delling
,
Andrew V. Goldberg
,
Renato F.Werneck
Lecture Notes in Computer Science
7501
, 2012, pp. 24-35
Better bounds for graph bisection
Daniel Delling
,
Renato F. Werneck
Lecture Notes in Computer Science
7501
, 2012, pp. 407-418
Bidirectional
A^{\ast}
search on time-dependent road networks
Giacomo Nannicini
,
Daniel Delling
,
Dominik Schultes
,
Leo Liberti
Networks
59
(2), 2012, pp. 240-251
VC-dimension and shortest path algorithms
Ittai Abraham
,
Daniel Delling
,
Amos Fiat
,
Andrew V. Goldberg
,
Renato F. Werneck
Lecture Notes in Computer Science
6755
, 2011, pp. 690-699
Experimental study of speed up techniques for timetable information systems
Reinhard Bauer
,
Daniel Delling
,
Dorothea Wagner
Networks
57
(1), 2011, pp. 38-52
Time-dependent SHARK-routing
Daniel Delling
Algorithmica
60
(1), 2011, pp. 60-94
Path schematization for route sketches
Daniel Delling
,
Andreas Gemsa
,
Martin Nöllenburg
,
Thomas Pajor
Lecture Notes in Computer Science
6139
, 2010, pp. 285-296
Accelerating multi-modal route planning by access-nodes
Daniel Delling
,
Thomas Pajor
,
Dorothea Wagner
Lecture Notes in Computer Science
5757
, 2009, pp. 587-598
Bidirectional core-based routing in dynamic time-dependent road networks
Daniel Delling
,
Giacomo Nannicini
Lecture Notes in Computer Science
5369
, 2008, pp. 812-823
Time-dependent SHARK-routing
Daniel Delling
Lecture Notes in Computer Science
5193
, 2008, pp. 332-343
On finding graph clusterings with maximum modularity
Ulrik Brandes
,
Daniel Delling
,
Marco Gaertler
,
Robert Görke
,
Martin Hoefer
,
Zoran Nikoloski
,
Dorothea Wagner
Lecture Notes in Computer Science
4769
, 2007, pp. 121-132