Thomas Andreae
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 38
- Complexity and Algorithms in Graphs 7
- semigroups and automata theory 3
- Graph Labeling and Dimension Problems 1
-
- Limits and Structures in Graph Theory 9
- Co-authors
- Hans‐Jürgen Bandelt (1 shared paper)Martin Aigner (1 shared paper)Michael Nölle (4 shared papers)
In The Last Decade
Thomas Andreae
39 papers receiving 435 citations
Peers
Comparison fields: 5 of 22
- Computational Theory and Mathematics 404
- Discrete Mathematics and Combinatorics 58
- Geometry and Topology 40
- Computer Graphics and Computer-Aided Design 17
- Computer Networks and Communications 25
Countries citing papers authored by Thomas Andreae
This map shows the geographic impact of Thomas Andreae'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 Thomas Andreae with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Andreae more than expected).
Fields of papers citing papers by Thomas Andreae
This network shows the impact of papers produced by Thomas Andreae. 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 Thomas Andreae. The network helps show where Thomas Andreae may publish in the future.
Co-authors
The 3 scholars most cited alongside Thomas Andreae, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 41 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 72 | |
| 2 | 1986 | 59 | |
| 3 | 1991 | 50 | |
| 4 | 2001 | 46 | |
| 5 | 1984 | 37 | |
| 6 | 1998 | 20 | |
| 7 | 1996 | 19 | |
| 8 | 1992 | 18 | |
| 9 | 1986 | 12 | |
| 10 | 1989 | 12 | |
| 11 | 1981 | 10 | |
| 12 | 1982 | 10 | |
| 13 | 1996 | 10 | |
| 14 | 1977 | 8 | |
| 15 | 1979 | 8 | |
| 16 | 1987 | 7 | |
| 17 | 1978 | 6 | |
| 18 | 1991 | 6 | |
| 19 | 1993 | 6 | |
| 20 | 2002 | 6 |
About Thomas Andreae
Thomas Andreae is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Computer Vision and Pattern Recognition, having authored 41 papers that have together received 466 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (38 papers), Limits and Structures in Graph Theory (9 papers), Complexity and Algorithms in Graphs (7 papers), Advanced Topology and Set Theory (6 papers), Graph theory and applications (5 papers), Interconnection Networks and Systems (3 papers), semigroups and automata theory (3 papers) and Graph Labeling and Dimension Problems (1 paper). The work is most often cited by research in Computational Theory and Mathematics (404 citations), Discrete Mathematics and Combinatorics (58 citations), Geometry and Topology (40 citations), Computer Graphics and Computer-Aided Design (17 citations) and Computer Networks and Communications (25 citations). Thomas Andreae has collaborated with scholars based in Germany, Hungary and Austria. Frequent co-authors include Hans‐Jürgen Bandelt, Martin Aigner and Michael Nölle. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Applied Mathematics, Discrete Mathematics and Mathematische Nachrichten.
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.