Dorothea Wagner 个人学术档案

引用次数

	总计	2019 年至今
引用	18675	6264
h 指数	63	38
i10 指数	182	109

1300

650

325

975

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202492 51 73 60 161 211 265 361 436 519 648 712 753 848 1096 937 1162 1216 1235 1068 1186 1232 1219 1192 1046 387

开放获取的出版物数量

查看全部

110 篇文章

3 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Ulrik BrandesETH Zürich, Social Networks Lab在 ethz.ch 的电子邮件经过验证
Daniel DellingGoogle在 google.com 的电子邮件经过验证
Peter SandersProfessor of Computer Science, Karlsruhe Institute of Technology在 kit.edu 的电子邮件经过验证
Christos ZaroliagisProfessor of Algorithm Design, Analysis and Engineering, University of Patras在 ceid.upatras.gr 的电子邮件经过验证
Julian DibbeltApple在 apple.com 的电子邮件经过验证
Thomas PajorApple在 apple.com 的电子邮件经过验证
Michael KaufmannProfessor of Computer Science, Tübingen University在 informatik.uni-tuebingen.de 的电子邮件经过验证
Ben StrasserDr. rer. nat.在 ben-strasser.net 的电子邮件经过验证
Ignaz RutterUniversity of Passau在 uni-passau.de 的电子邮件经过验证
Moritz BaumKarlsruhe Institute of Technology在 kit.edu 的电子邮件经过验证
Michael HamannXWiki SAS在 xwiki.com 的电子邮件经过验证
Dominik SchultesProfessor für Informatik, Technische Hochschule Mittelhessen在 iem.thm.de 的电子邮件经过验证
Tobias ZündorfKarlsruhe Institute of Technology在 kit.edu 的电子邮件经过验证
Martin HoeferProfessor of Computer Science, RWTH Aachen University在 cs.rwth-aachen.de 的电子邮件经过验证
Henning MeyerhenkeProfessor of Computer Science, HU Berlin在 hu-berlin.de 的电子邮件经过验证
Rolf H. MöhringProfessor für Mathematik, Technische Universität Berlin在 tu-berlin.de 的电子邮件经过验证
Renato WerneckAmazon在 cs.princeton.edu 的电子邮件经过验证
Anita SchoebelProfessorin für Angewandte Mathematik, TU Kaiserslautern und Fraunhofer ITWM在 itwm.fraunhofer.de 的电子邮件经过验证
Michael BaurFormerly Universität Karlsruhe (TH)在 michaelbaur.de 的电子邮件经过验证
Andreas GemsaKarlsruhe Institute of Technology (KIT)在 kit.edu 的电子邮件经过验证

关注

Dorothea Wagner

Professor of Computer Science, Karlsruhe Institute of Technology (KIT)

在 kit.edu 的电子邮件经过验证 - 首页

Algorithm Engineering Graph Algorithms Combinatorial Optimization Route Planning Graph Drawing


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	1648	2007
Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm engineering: Selected results and surveys, 19-80, 2016	952	2016
Analysis and visualization of social networks U Brandes, D Wagner Graph drawing software, 321-340, 2004	889*	2004
Drawing graphs: methods and models M Kaufmann, D Wagner Springer Verlag, 2001	869*	2001
Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009	773	2009
Experiments on graph clustering algorithms U Brandes, M Gaertler, D Wagner European symposium on algorithms, 568-579, 2003	486	2003
Comparing clusterings: an overview S Wagner, D Wagner Universität Karlsruhe, Fakultät für Informatik, 2007	436	2007
Finding, counting and listing all triangles in large graphs, an experimental study T Schank, D Wagner Experimental and Efficient Algorithms, 61-66, 2005	419	2005
Maximizing modularity is hard U Brandes, D Delling, M Gaertler, R Görke, M Hoefer, Z Nikoloski, ... Arxiv preprint physics/0608255, 2006	409*	2006
Graph partitioning and graph clustering DH Bader, H Meyerhenke, P Sanders, D Wagner American Mathematical Soc., 2013	387*	2013
Approximating clustering-coefficient and transitivity T Schank, D Wagner Journal of Graph Algorithms and Applications 9 (2), 265-275, 2005	370	2005
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	317	2008
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	304	2007
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	264	1999
Between min cut and graph bisection D Wagner, F Wagner Mathematical Foundations of Computer Science 1993: 18th International …, 1993	258	1993
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	238	2000
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	232	2007
Time-dependent route planning D Delling, D Wagner Robust and Online Large-Scale Optimization, 207-230, 2009	231*	2009
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm R Bauer, D Delling, P Sanders, D Schieferdecker, D Schultes, D Wagner Journal of Experimental Algorithmics (JEA) 15, 2.1-2.31, 2010	226	2010
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	213	2002

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用