Thomas Andreae

628 total citations
39 papers, 365 citations indexed

About

Thomas Andreae is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Thomas Andreae has authored 39 papers receiving a total of 365 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 18 papers in Discrete Mathematics and Combinatorics and 11 papers in Geometry and Topology. Recurrent topics in Thomas Andreae's work include Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (16 papers) and Graph Labeling and Dimension Problems (12 papers). Thomas Andreae is often cited by papers focused on Advanced Graph Theory Research (22 papers), Limits and Structures in Graph Theory (16 papers) and Graph Labeling and Dimension Problems (12 papers). Thomas Andreae collaborates with scholars based in Germany, Hungary and Austria. Thomas Andreae's co-authors include Hans‐Jürgen Bandelt, Martin Aigner, U. Hennig and Michael Nölle and has published in prestigious journals such as Theoretical Computer Science, Journal of Parallel and Distributed Computing and Networks.

In The Last Decade

Thomas Andreae

38 papers receiving 341 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Thomas Andreae Germany	10	275	94	88	78	47	39	365
A.M.H. Gerards Netherlands	11	361 1.3×	75 0.8×	48 0.5×	97 1.2×	13 0.3×	33	431
Dömötör Pálvölgyi Hungary	10	150 0.5×	83 0.9×	49 0.6×	27 0.3×	41 0.9×	56	285
Richard D. Ringeisen United States	9	206 0.7×	47 0.5×	52 0.6×	41 0.5×	44 0.9×	21	286
Mitre C. Dourado Brazil	13	539 2.0×	191 2.0×	147 1.7×	74 0.9×	22 0.5×	80	614
C. Berge France	9	218 0.8×	64 0.7×	65 0.7×	29 0.4×	11 0.2×	13	278
Eyal Ackerman Israel	9	89 0.3×	48 0.5×	25 0.3×	27 0.3×	34 0.7×	26	229
Dorit Dor Israel	6	128 0.5×	66 0.7×	11 0.1×	45 0.6×	20 0.4×	10	250
Chı́nh T. Hoàng Canada	18	895 3.3×	389 4.1×	150 1.7×	148 1.9×	18 0.4×	78	957
Jenő Lehel Hungary	15	746 2.7×	361 3.8×	276 3.1×	163 2.1×	18 0.4×	83	853
Nicolas Nisse France	11	242 0.9×	34 0.4×	27 0.3×	189 2.4×	18 0.4×	70	384

Countries citing papers authored by Thomas Andreae

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Thomas Andreae

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Andreae. A scholar is included among the top collaborators of Thomas Andreae 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 Thomas Andreae. Thomas Andreae is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Andreae, Thomas. (2012). Classes of locally finite ubiquitous graphs. Journal of Combinatorial Theory Series B. 103(2). 274–290. 4 indexed citations

Andreae, Thomas. (2003). On immersions of uncountable graphs. Journal of Combinatorial Theory Series B. 87(1). 130–137. 1 indexed citations

Andreae, Thomas. (2001). On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks. 38(2). 59–67. 28 indexed citations

Andreae, Thomas, et al.. (1999). A two-person game on graphs where each player tries to encircle his opponent's men. Theoretical Computer Science. 215(1-2). 305–323. 5 indexed citations

Andreae, Thomas. (1998). On the clique-transversal number of chordal graphs. Discrete Mathematics. 191(1-3). 3–11. 19 indexed citations

Andreae, Thomas, et al.. (1997). Embedding Cartesian Products of Graphs into de Bruijn Graphs. Journal of Parallel and Distributed Computing. 46(2). 194–200. 2 indexed citations

Andreae, Thomas. (1994). On Reconstructing Rooted Trees. Journal of Combinatorial Theory Series B. 62(2). 183–198. 1 indexed citations

Andreae, Thomas. (1992). Some results on visibility graphs. Discrete Applied Mathematics. 40(1). 5–17. 13 indexed citations

Andreae, Thomas, et al.. (1991). Clique-transversal sets of line graphs and complements of line graphs. Discrete Mathematics. 88(1). 11–20. 44 indexed citations

10.

Andreae, Thomas. (1991). A search problem on graphs which generalizes some group testing problems with two defectives. Discrete Mathematics. 88(2-3). 121–127. 6 indexed citations

11.

Andreae, Thomas. (1989). A ternary search problem on graphs. Discrete Applied Mathematics. 23(1). 1–10. 2 indexed citations

12.

Andreae, Thomas. (1986). On a pursuit game played on graphs for which a minor is excluded. Journal of Combinatorial Theory Series B. 41(1). 37–47. 43 indexed citations

13.

Andreae, Thomas. (1986). On an extremal problem concerning the interval number of a graph. Discrete Applied Mathematics. 14(1). 1–9. 10 indexed citations

14.

Andreae, Thomas. (1986). On well-quasi-ordering-finite graphs by immersion. COMBINATORICA. 6(4). 287–298. 1 indexed citations

15.

Andreae, Thomas. (1984). Note on a pursuit game played on graphs. Discrete Applied Mathematics. 9(2). 111–115. 32 indexed citations

16.

Andreae, Thomas. (1982). An edge-deletion problem for locally finite graphs. Journal of Combinatorial Theory Series B. 33(2). 178–186. 1 indexed citations

17.

Andreae, Thomas. (1982). Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. Journal of Combinatorial Theory Series B. 32(3). 258–263. 3 indexed citations

18.

Andreae, Thomas. (1980). On a problem of R. Halin concerning infinite graphs II. Discrete Mathematics. 29(3). 219–227. 2 indexed citations

19.

Andreae, Thomas. (1979). Über eine eigenschaft lokalfiniter, unendlicher bäume. Journal of Combinatorial Theory Series B. 27(2). 202–215. 7 indexed citations

20.

Andreae, Thomas. (1977). Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 46(1). 91–95. 7 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