Dorothea Wagner
Citata da
Citata da
On modularity clustering
U Brandes, D Delling, M Gaertler, R Gorke, M Hoefer, Z Nikoloski, ...
IEEE transactions on knowledge and data engineering 20 (2), 172-188, 2007
Social networks
U Brandes, LC Freeman, D Wagner
Handbook of Graph Drawing and Visualization, 803-837, 2013
Drawing graphs: methods and models
M Kaufmann, D Wagner
Springer Verlag, 2001
Analysis and visualization of social networks
U Brandes, D Wagner
Graph drawing software, 321-340, 2004
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
Route planning in transportation networks
H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ...
Algorithm engineering, 19-80, 2016
Experiments on graph clustering algorithms
U Brandes, M Gaertler, D Wagner
European Symposium on Algorithms, 568-579, 2003
Finding, counting and listing all triangles in large graphs, an experimental study
T Schank, D Wagner
Experimental and Efficient Algorithms, 61-66, 2005
Comparing clusterings: an overview
S Wagner, D Wagner
Universität Karlsruhe, Fakultät für Informatik, 2007
Maximizing modularity is hard
U Brandes, D Delling, M Gaertler, R Görke, M Hoefer, Z Nikoloski, ...
Arxiv preprint physics/0608255, 2006
Approximating clustering-coefficient and transitivity
T Schank, D Wagner
Journal of Graph Algorithms and Applications 9 (2), 265-275, 2005
On finding graph clusterings with maximum modularity
U Brandes, D Delling, M Gaertler, R Görke, M Hoefer, Z Nikoloski, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 121-132, 2007
Efficient models for timetable information in public transportation systems
E Pyrga, F Schulz, D Wagner, C Zaroliagis
Journal of Experimental Algorithmics (JEA) 12, 1-39, 2008
Graph partitioning and graph clustering
DH Bader, H Meyerhenke, P Sanders, D Wagner
American Mathematical Soc., 2013
Explorations into the visualization of policy networks
U Brandes, P Kenis, J Raab, V Schneider, D Wagner
Journal of Theoretical Politics 11 (1), 75, 1999
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
F Schulz, D Wagner, K Weihe
Journal of Experimental Algorithmics (JEA) 5, 12, 2000
Between min cut and graph bisection
D Wagner, F Wagner
International Symposium on Mathematical Foundations of Computer Science, 744-750, 1993
Partitioning graphs to speedup Dijkstra's algorithm
RH Möhring, H Schilling, B Schütz, D Wagner, T Willhalm
Journal of Experimental Algorithmics (JEA) 11, 2.8-es, 2007
Geometric speed-up techniques for finding shortest paths in large sparse graphs
D Wagner, T Willhalm
European Symposium on Algorithms, 776-787, 2003
Using multi-level graphs for timetable information in railway systems
F Schulz, D Wagner, C Zaroliagis
Workshop on Algorithm Engineering and Experimentation, 43-59, 2002
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20