( en | de | ru )

 

Disambiguation of "Wagner, Dorothea"

Author of the publication

copydeleteadd this publication to your clipboard
Intriguingly Simple and Fast Transit Routing.

, , , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 43-54. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dorothea Wagner

Dorothea Wagner

Dorothea Wagner

Dorothea Wagner-Ferrer

Anna Dorothea Wagner

 

Other publications of authors with the same name

Customizable Contraction Hierarchies., , and . ACM Journal of Experimental Algorithmics, 21 (1): 1.5:1-1.5:49 (2016)Erratum: Customizable Contraction Hierarchies., , and . SEA, volume 8504 of Lecture Notes in Computer Science, Springer, (2014)Intriguingly Simple and Fast Transit Routing., , , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 43-54. Springer, (2013)Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study., and . WEA, volume 3503 of Lecture Notes in Computer Science, page 606-609. Springer, (2005)Engineering Negative Cycle Canceling for Wind Farm Cabling., , , , and . ESA, volume 144 of LIPIcs, page 55:1-55:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Communicating Centrality in Policy Network Drawings., , and . IEEE Trans. Vis. Comput. Graph., 9 (2): 241-253 (2003)Dynamic Time-Dependent Route Planning in Road Networks with User Preferences., , , and . CoRR, (2015)Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles., , and . J. Graph Algorithms Appl., 9 (1): 99-115 (2005)Approximating Clustering Coefficient and Transitivity., and . J. Graph Algorithms Appl., 9 (2): 265-275 (2005)α-Vertex separator is NP-hard even for 3-regular graphs., and . Computing, 46 (4): 343-353 (1991)