Các bài viết có thể truy cập công khai - Dorothea WagnerTìm hiểu thêm
Không có ở bất kỳ nơi nào: 4
Towards route planning algorithms for electric vehicles with realistic constraints
M Baum, J Dibbelt, A Gemsa, D Wagner
Computer Science-Research and Development 31, 105-109, 2016
Các cơ quan ủy nhiệm: European Commission
Lunarvis–analytic visualizations of large graphs
R Görke, M Gaertler, D Wagner
International Symposium on Graph Drawing, 352-364, 2007
Các cơ quan ủy nhiệm: German Research Foundation
Algorithm engineering
P Sanders, D Wagner
Informatik-Spektrum 36, 187-190, 2013
Các cơ quan ủy nhiệm: German Research Foundation
Column-based graph layouts
G Betz, C Doll, A Gemsa, I Rutter, D Wagner
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
Các cơ quan ủy nhiệm: German Research Foundation
Có tại một số nơi: 110
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
Các cơ quan ủy nhiệm: German Research Foundation
Engineering route planning algorithms
D Delling, P Sanders, D Schultes, D Wagner
Algorithmics of large and complex networks, 117-139, 2009
Các cơ quan ủy nhiệm: German Research Foundation
Maximizing modularity is hard
U Brandes, D Delling, M Gaertler, R Görke, M Hoefer, Z Nikoloski, ...
Arxiv preprint physics/0608255, 2006
Các cơ quan ủy nhiệm: German Research Foundation
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
Các cơ quan ủy nhiệm: German Research Foundation
On finding graph clusterings with maximum modularity
U Brandes, D Delling, M Gaertler, R Görke, M Hoefer, Z Nikoloski, ...
Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 2007
Các cơ quan ủy nhiệm: German Research Foundation
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
Các cơ quan ủy nhiệm: German Research Foundation
Time-dependent route planning
D Delling, D Wagner
Robust and Online Large-Scale Optimization, 207-230, 2009
Các cơ quan ủy nhiệm: German Research Foundation
Benchmarking for graph clustering and partitioning
P Sanders, C Schulz, D Wagner
Encyclopedia of social network analysis and mining Springer, 2014
Các cơ quan ủy nhiệm: German Research Foundation
Customizable contraction hierarchies
J Dibbelt, B Strasser, D Wagner
Journal of Experimental Algorithmics (JEA) 21, 1-49, 2016
Các cơ quan ủy nhiệm: German Research Foundation, European Commission
Engineering multilevel overlay graphs for shortest-path queries
M Holzer, F Schulz, D Wagner
Journal of Experimental Algorithmics (JEA) 13, 5, 2009
Các cơ quan ủy nhiệm: German Research Foundation
Intriguingly simple and fast transit routing
J Dibbelt, T Pajor, B Strasser, D Wagner
International Symposium on Experimental Algorithms, 43-54, 2013
Các cơ quan ủy nhiệm: German Research Foundation
Computing many-to-many shortest paths using highway hierarchies
S Knopp, P Sanders, D Schultes, F Schulz, D Wagner
Workshop on Algorithm Engineering and Experiments, 2007
Các cơ quan ủy nhiệm: German Research Foundation
Engineering graph clustering: Models and experimental evaluation
U Brandes, M Gaertler, D Wagner
Journal of Experimental Algorithmics (JEA) 12, 1-26, 2008
Các cơ quan ủy nhiệm: German Research Foundation
User-Constrained Multi-Modal Route Planning
J Dibbelt, T Pajor, D Wagner
ALENEX, Proceedings of the 14th Meeting on Algorithm Engineering and …, 2012
Các cơ quan ủy nhiệm: German Research Foundation
Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm
R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
Các cơ quan ủy nhiệm: German Research Foundation
Pareto paths with SHARC
D Delling, D Wagner
International Symposium on Experimental Algorithms, 125-136, 2009
Các cơ quan ủy nhiệm: German Research Foundation
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ