Dorothea Wagner

9.0k total citations · 1 hit paper
148 papers, 2.8k citations indexed

About

Dorothea Wagner is a scholar working on Computer Networks and Communications, Signal Processing and Computer Vision and Pattern Recognition. According to data from OpenAlex, Dorothea Wagner has authored 148 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computer Networks and Communications, 44 papers in Signal Processing and 37 papers in Computer Vision and Pattern Recognition. Recurrent topics in Dorothea Wagner's work include Data Management and Algorithms (44 papers), Complex Network Analysis Techniques (24 papers) and Data Visualization and Analytics (21 papers). Dorothea Wagner is often cited by papers focused on Data Management and Algorithms (44 papers), Complex Network Analysis Techniques (24 papers) and Data Visualization and Analytics (21 papers). Dorothea Wagner collaborates with scholars based in Germany, Greece and United States. Dorothea Wagner's co-authors include Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Thomas Schank, Julian Dibbelt, Frank Schulz and Thomas Willhalm and has published in prestigious journals such as ACM Computing Surveys, IEEE Transactions on Knowledge and Data Engineering and IEEE Transactions on Computers.

In The Last Decade

Dorothea Wagner

141 papers receiving 2.6k citations

Hit Papers

On Modularity Clustering 2008 2026 2014 2020 2008 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. On Modularity Clustering
    2008 739 citations Ulrik Brandes, Daniel Delling et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Dorothea Wagner Germany 24 823 586 575 560 454 148 2.8k
Daniel Delling Germany 20 543 0.7× 488 0.8× 359 0.6× 659 1.2× 310 0.7× 55 1.9k
Ruoming Jin United States 33 609 0.7× 1.0k 1.7× 1.4k 2.4× 1.0k 1.9× 681 1.5× 140 3.1k
Massimiliano Zanin Spain 31 1.6k 1.9× 500 0.9× 448 0.8× 260 0.5× 304 0.7× 151 4.0k
Hao Peng China 34 406 0.5× 671 1.1× 2.9k 5.1× 568 1.0× 544 1.2× 177 5.1k
Josep M. Pujol Spain 15 502 0.6× 723 1.2× 2.4k 4.2× 334 0.6× 1.0k 2.3× 27 5.1k
Jordi Delgado Spain 12 436 0.5× 455 0.8× 2.3k 4.0× 288 0.5× 892 2.0× 21 4.5k
Seth A. Myers United States 10 1.4k 1.7× 970 1.7× 649 1.1× 406 0.7× 227 0.5× 15 3.6k
Delbert Dueck Canada 6 497 0.6× 391 0.7× 1.9k 3.2× 531 0.9× 1.6k 3.4× 9 5.0k
Mohammad Mahdian United States 28 543 0.7× 1.1k 1.9× 533 0.9× 202 0.4× 138 0.3× 99 3.4k
Shenghuo Zhu United States 38 1.3k 1.6× 825 1.4× 3.1k 5.3× 500 0.9× 2.0k 4.4× 126 6.1k

Countries citing papers authored by Dorothea Wagner

Since Specialization
Citations

This map shows the geographic impact of Dorothea Wagner's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dorothea Wagner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dorothea Wagner more than expected).

Fields of papers citing papers by Dorothea Wagner

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dorothea Wagner. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dorothea Wagner. The network helps show where Dorothea Wagner may publish in the future.

Co-authorship network of co-authors of Dorothea Wagner

This figure shows the co-authorship network connecting the top 25 collaborators of Dorothea Wagner. A scholar is included among the top collaborators of Dorothea Wagner based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Dorothea Wagner. Dorothea Wagner is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Çatalyürek, Ümit V., Karen Devine, Henning Meyerhenke, et al.. (2022). More Recent Advances in (Hyper)Graph Partitioning. ACM Computing Surveys. 55(12). 1–38. 28 indexed citations
2.
Strasser, Ben, et al.. (2020). Engineering Exact Quasi-Threshold Editing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Wagner, Dorothea, et al.. (2019). Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
4.
Strasser, Ben, et al.. (2017). Simple Distributed Graph Clustering using Modularity and Map Equation.. arXiv (Cornell University). 1 indexed citations
5.
Bläsius, Thomas, Ignaz Rutter, & Dorothea Wagner. (2016). Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Transactions on Algorithms. 12(3). 1–32. 3 indexed citations
6.
Schulz, Andreas S. & Dorothea Wagner. (2014). Algorithms -- ESA 2014 : 22nd annual European Symposium, Wroclaw, Poland, September 8-10, 2014 : proceedings. Springer eBooks.
7.
Dibbelt, Julian, Ben Strasser, & Dorothea Wagner. (2014). Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
8.
Delling, Daniel, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, & Renato F. Werneck. (2012). Computing and Evaluating Multimodal Journeys. Repository KITopen (Karlsruhe Institute of Technology). 4 indexed citations
9.
Bläsius, Thomas, et al.. (2012). Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica. 68(4). 859–885. 9 indexed citations
10.
Wagner, Dorothea, et al.. (2011). Fully-Dynamic Cut Tree Construction. Repository KITopen (Karlsruhe Institute of Technology). 1 indexed citations
11.
Wagner, Dorothea, et al.. (2010). Energy efficient scheduling with power control for wireless networks. HAL (Le Centre pour la Communication Scientifique Directe). 160–169. 14 indexed citations
12.
Delling, Daniel, Martin Hölzer, Kirill Müller, Frank Schulz, & Dorothea Wagner. (2009). High-performance multi-level routing. 73–91. 2 indexed citations
13.
Wagner, Dorothea & Roger Wattenhofer. (2007). Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures (Lecture Notes in Computer Science). Springer eBooks. 2 indexed citations
14.
Wagner, Dorothea & Roger Wattenhofer. (2007). Algorithms for sensor and ad hoc networks: advanced lectures. DIAL (Catholic University of Leuven). 18 indexed citations
15.
Kaufmann, Michael & Dorothea Wagner. (2007). Graph drawing : 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006 : revised papers. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).
16.
Müller‐Hannemann, Matthias, et al.. (2006). Timetable Information: Models and Algorithms. 7 indexed citations
17.
Brandes, Ulrik, et al.. (2004). How to draw the minimum cuts of a planar graph. Computational Geometry. 29(2). 117–133. 4 indexed citations
18.
Brandes, Ulrik, Jörg Raab, & Dorothea Wagner. (2001). Exploratory Network Visualization : Simultaneous Display of Actor Status and Connections. KOPS (University of Konstanz). 2(4). 57 indexed citations
19.
Brandes, Ulrik, et al.. (1999). A software package of algorithms and heuristics for disjoint paths in Planar Networks. Discrete Applied Mathematics. 92(2-3). 91–110. 1 indexed citations
20.
Wagner, Dorothea, et al.. (1991). Routing through a dense channel with minimum total wire length. Symposium on Discrete Algorithms. 475–482. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Daniel Delling Breakdown of academic impact, for papers by Ruoming Jin Breakdown of academic impact, for papers by Massimiliano Zanin Breakdown of academic impact, for papers by Hao Peng Breakdown of academic impact, for papers by Josep M. Pujol Breakdown of academic impact, for papers by Jordi Delgado Breakdown of academic impact, for papers by Seth A. Myers Breakdown of academic impact, for papers by Delbert Dueck Breakdown of academic impact, for papers by Mohammad Mahdian Breakdown of academic impact, for papers by Shenghuo Zhu
Rankless by CCL
2026