# Dorothea Wagner

> German computer scientist

**Wikidata**: [Q16477](https://www.wikidata.org/wiki/Q16477)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Dorothea_Wagner)  
**Source**: https://4ort.xyz/entity/dorothea-wagner

## Summary  
Dorothea Wagner (born 1957 in Trier) is a German computer scientist renowned for her research in algorithms and graph theory and for her long‑standing professorship at the Karlsruhe Institute of Technology (KIT). She has mentored a generation of leading computer scientists and is a member of the Academia Europaea and the Heidelberg Academy of Sciences.

## Biography  
- **Born:** 1957, Trier, Germany  
- **Nationality:** German  
- **Education:** RWTH Aachen University – Diplom, Doctorate, and habilitation in Mathematics (completed 1983)  
- **Known for:** Pioneering contributions to algorithmic graph theory and extensive mentorship of doctoral students  
- **Employer(s):**  
  - RWTH Aachen University (1983 – 1988)  
  - Technische Universität Berlin (1998 – 1993 – dates as recorded)  
  - Martin Luther University Halle‑Wittenberg (1993)  
  - University of Konstanz (1994 – 2003, Professor)  
  - Karlsruhe Institute of Technology (2003 – present, Professor)  
- **Field(s):** Computer science, algorithms, graph theory, discrete mathematics  

## Contributions  
Dorothea Wagner’s research has shaped modern algorithmic graph theory, especially in the design of efficient shortest‑path and network‑analysis algorithms. Her work appears in high‑impact journals and conference proceedings throughout the 1990s and 2000s, influencing both theoretical foundations and practical applications such as routing in transportation networks. Wagner has supervised more than a dozen doctoral students, including Ulrik Brandes (known for the Brandes betweenness‑centrality algorithm), Martin Nollenburg, Karsten Weihe, and Matthias Müller‑Hannemann, many of whom now hold prominent academic positions. As a professor at KIT since 2003, she leads the Institute for Theoretical Computer Science, overseeing research groups that develop scalable graph‑processing tools used by industry and academia worldwide. Her Erdős number of 2 reflects deep collaborative ties within the combinatorial community.

## FAQs  
### Q: What is Dorothea Wagner’s primary research area?  
A: She specializes in algorithmic graph theory, focusing on efficient algorithms for shortest paths, network analysis, and related combinatorial problems.  

### Q: Where does Dorothea Wagner work today?  
A: She is a professor at the Karlsruhe Institute of Technology (KIT) in Germany, where she heads the Institute for Theoretical Computer Science.  

### Q: Who are some of her notable doctoral students?  
A: Her former students include Ulrik Brandes, Martin Nollenburg, Karsten Weihe, Matthias Müller‑Hannemann, and several others who have become leading researchers in computer science.  

### Q: Has Dorothea Wagner received any major honors?  
A: Yes, she was elected to the Academia Europaea (section Informatics) in 2013 and became an ordinary member of the Heidelberg Academy of Sciences and Humanities in 2021.  

### Q: What is her Erdős number and why is it relevant?  
A: Wagner’s Erdős number is 2, indicating she has co‑authored a paper with a direct collaborator of Paul Erdős, underscoring her strong integration into the international combinatorial research network.  

## Why They Matter  
Dorothea Wagner’s contributions have fundamentally advanced the efficiency of graph algorithms that underpin modern routing, network security, and data‑analysis systems. By introducing novel techniques for shortest‑path computation and network centrality, she enabled faster, more scalable solutions that are now standard in both academic research and commercial software. Her mentorship has multiplied this impact: many of her doctoral students have become influential scholars, extending her research legacy across continents and disciplines. Without Wagner’s work, key algorithmic breakthroughs in transportation planning and large‑scale network analytics would have emerged later, slowing progress in fields ranging from logistics to social‑network analysis.  

## Notable For  
- Pioneering algorithmic results in shortest‑path and network‑analysis problems.  
- Long‑standing professorship at KIT, leading the Institute for Theoretical Computer Science since 2003.  
- Membership in Academia Europaea (2013) and the Heidelberg Academy of Sciences (2021).  
- Supervising a distinguished cohort of doctoral students who now shape computer‑science research worldwide.  
- Holding an Erdős number of 2, reflecting deep collaborative ties in combinatorial mathematics.  

## Body  

### Early Life and Education  
Dorothea Wagner was born in 1957 in Trier, Germany. She pursued higher education at RWTH Aachen University, where she earned a Diplom, completed her doctorate, and achieved habilitation in mathematics by 1983.  

### Academic Career  

- **RWTH Aachen University (1983‑1988):** Early academic appointment following her habilitation.  
- **Technische Universität Berlin (1998‑1993) & Martin Luther University Halle‑Wittenberg (1993):** Short‑term positions recorded in institutional histories.  
- **University of Konstanz (1994‑2003):** Served as professor, establishing a research group in algorithms and graph theory.  
- **Karlsruhe Institute of Technology (2003‑present):** Holds a professorship, heads the Institute for Theoretical Computer Science, and directs multiple research projects on large‑scale graph processing.  

### Research Contributions  

- **Shortest‑Path Algorithms:** Developed refined algorithms that reduce computational complexity for weighted graphs, influencing routing software used by transportation agencies.  
- **Network Centrality Measures:** Co‑authored foundational work on betweenness centrality, later expanded by student Ulrik Brandes.  
- **Publications:** Authored numerous peer‑reviewed articles in leading venues such as *Journal of Algorithms* and *SIAM Journal on Computing* (1990s‑2000s).  

### Mentorship and Doctoral Students  

Wagner has supervised at least ten Ph.D. candidates, including:  

- **Ulrik Brandes** – creator of the Brandes algorithm for betweenness centrality.  
- **Martin Nollenburg** – known for geometric graph algorithms.  
- **Karsten Weihe** – contributions to combinatorial optimization.  
- **Matthias Müller‑Hannemann** – work on graph drawing and visualization.  

These scholars now hold faculty positions worldwide, propagating Wagner’s research ethos.  

### Honors and Professional Memberships  

- **Academia Europaea (section Informatics),** elected 2013.  
- **Heidelberg Academy of Sciences and Humanities,** ordinary member since 2021.  
- **Erdős number 2,** reflecting a direct collaborative chain to Paul Erdős.  

## Schema Markup  
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Dorothea Wagner",
  "jobTitle": "Computer scientist",
  "worksFor": {
    "@type": "Organization",
    "name": "Karlsruhe Institute of Technology"
  },
  "nationality": {
    "@type": "Country",
    "name": "Germany"
  },
  "birthDate": "1957",
  "birthPlace": "Trier, Germany",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "RWTH Aachen University"
    }
  ],
  "knowsAbout": [
    "Computer science",
    "Algorithms",
    "Graph theory"
  ],
  "sameAs": [
    "https://en.wikipedia.org/wiki/Dorothea_Wagner"
  ],
  "description": "German computer scientist known for her work in algorithmic graph theory and for mentoring many leading researchers."
}

## References

1. [Source](http://editors.eptcs.org/)
2. Mathematics Genealogy Project
3. general catalog of BnF
4. Virtual International Authority File
5. [Source](https://www.ae-info.org/ae/User/Wagner_Dorothea_Maria_Anna)
6. www.haw.uni-heidelberg.de
7. ORCID iD