Torsten Ueckerdt

877 total citations
32 papers, 237 citations indexed

About

Torsten Ueckerdt is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Torsten Ueckerdt has authored 32 papers receiving a total of 237 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 15 papers in Computer Graphics and Computer-Aided Design and 6 papers in Computer Networks and Communications. Recurrent topics in Torsten Ueckerdt's work include Advanced Graph Theory Research (20 papers), Computational Geometry and Mesh Generation (15 papers) and Limits and Structures in Graph Theory (6 papers). Torsten Ueckerdt is often cited by papers focused on Advanced Graph Theory Research (20 papers), Computational Geometry and Mesh Generation (15 papers) and Limits and Structures in Graph Theory (6 papers). Torsten Ueckerdt collaborates with scholars based in Germany, France and Poland. Torsten Ueckerdt's co-authors include Kolja Knauer, Kurt Mehlhorn, Telikepalli Kavitha, Katharina A. Zweig, Roméo Rizzi, Christian Liebchen, Dimitrios Michail, Stefan Felsner, Michael Kaufmann and David R. Wood and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Discrete Applied Mathematics.

In The Last Decade

Torsten Ueckerdt

29 papers receiving 222 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Torsten Ueckerdt Germany	8	129	70	50	45	42	32	237
Eyal Ackerman Israel	9	89 0.7×	92 1.3×	30 0.6×	34 0.8×	27 0.6×	26	229
F. Hurtado Spain	10	140 1.1×	228 3.3×	32 0.6×	73 1.6×	32 0.8×	29	322
Fabrizio Frati Italy	9	175 1.4×	223 3.2×	31 0.6×	98 2.2×	42 1.0×	61	299
Hans Raj Tiwary Belgium	8	194 1.5×	35 0.5×	70 1.4×	27 0.6×	37 0.9×	22	315
Yann Vaxès France	9	171 1.3×	41 0.6×	33 0.7×	14 0.3×	71 1.7×	36	271
János Pach Hungary	6	180 1.4×	197 2.8×	38 0.8×	91 2.0×	22 0.5×	15	365
Christian Wulff‐Nilsen Denmark	9	164 1.3×	60 0.9×	19 0.4×	23 0.5×	96 2.3×	36	235
Pierre Rosenstiehl France	10	155 1.2×	206 2.9×	40 0.8×	95 2.1×	44 1.0×	24	356
J. Matoušek Czechia	5	87 0.7×	139 2.0×	11 0.2×	55 1.2×	38 0.9×	13	249
Xavier Goaoc France	8	49 0.4×	102 1.5×	14 0.3×	75 1.7×	10 0.2×	32	191

Countries citing papers authored by Torsten Ueckerdt

Since Specialization

Citations

This map shows the geographic impact of Torsten Ueckerdt'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 Torsten Ueckerdt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Torsten Ueckerdt more than expected).

Fields of papers citing papers by Torsten Ueckerdt

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Torsten Ueckerdt. 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 Torsten Ueckerdt. The network helps show where Torsten Ueckerdt may publish in the future.

Co-authorship network of co-authors of Torsten Ueckerdt

This figure shows the co-authorship network connecting the top 25 collaborators of Torsten Ueckerdt. A scholar is included among the top collaborators of Torsten Ueckerdt 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 Torsten Ueckerdt. Torsten Ueckerdt 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

Cardinal, Jean, et al.. (2023). Colouring bottomless rectangles and arborescences. Computational Geometry. 115. 102020–102020.

Felsner, Stefan & Torsten Ueckerdt. (2019). A note on covering Young diagrams with applications to local dimension of posets. arXiv (Cornell University). 88(3). 673–678. 1 indexed citations

Bekos, Michael A., et al.. (2019). Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM Journal on Computing. 48(5). 1487–1502. 4 indexed citations

Bekos, Michael A., et al.. (2019). Planar graphs of bounded degree have bounded queue number. 176–184. 2 indexed citations

Angelini, Patrizio, et al.. (2018). Beyond Planarity: Turán-Type Results for Non-Planar Bipartite Graphs. 2 indexed citations

Bläsius, Thomas, et al.. (2018). Local and union boxicity. Discrete Mathematics. 341(5). 1307–1315. 3 indexed citations

Ueckerdt, Torsten, et al.. (2018). Towards negative cycle canceling in wind farm cable layout optimization. Energy Informatics. 1(S1). 5 indexed citations

Ueckerdt, Torsten, et al.. (2018). Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. Energy Informatics. 1(1). 2 indexed citations

Chimani, Markus, Stefan Felsner, Stephen Kobourov, et al.. (2017). On the Maximum Crossing Number. Journal of Graph Algorithms and Applications. 22(1). 67–87. 2 indexed citations

10.

Felsner, Stefan, Kolja Knauer, George B. Mertzios, & Torsten Ueckerdt. (2016). Intersection graphs of L-shapes and segments in the plane. Discrete Applied Mathematics. 206. 48–55. 5 indexed citations

11.

Knauer, Kolja & Torsten Ueckerdt. (2015). Three ways to cover a graph. Discrete Mathematics. 339(2). 745–758. 7 indexed citations

12.

Knauer, Kolja, et al.. (2014). On the bend-number of planar and outerplanar graphs. Discrete Applied Mathematics. 179. 109–119. 9 indexed citations

13.

Axenovich, Maria, Ryan R. Martin, & Torsten Ueckerdt. (2014). Twins in graphs. European Journal of Combinatorics. 39. 188–197. 1 indexed citations

14.

Axenovich, Maria, et al.. (2014). Online and size anti-Ramsey numbers. HAL (Le Centre pour la Communication Scientifique Directe). 5(1). 87–114. 3 indexed citations

15.

Cardinal, Jean, Kolja Knauer, Piotr Micek, & Torsten Ueckerdt. (2014). Making Octants Colorful and Related Covering Decomposition Problems. SIAM Journal on Discrete Mathematics. 28(4). 1948–1959. 1 indexed citations

16.

Walzer, Stefan, Maria Axenovich, & Torsten Ueckerdt. (2013). Packing polyominoes clumsily. Computational Geometry. 47(1). 52–60. 1 indexed citations

17.

Knauer, Kolja, et al.. (2013). Edge-intersection graphs of grid paths: The bend-number. Discrete Applied Mathematics. 167. 144–162. 21 indexed citations

18.

Cardinal, Jean, Kolja Knauer, Piotr Micek, & Torsten Ueckerdt. (2013). Making Octants Colorful and Related Covering Decomposition Problems. arXiv (Cornell University). 1424–1432. 3 indexed citations

19.

Biedl, Thérèse, et al.. (2013). Computing Cartograms with Optimal Complexity. Discrete & Computational Geometry. 50(3). 784–810. 21 indexed citations

20.

Knauer, Kolja, Piotr Micek, & Torsten Ueckerdt. (2011). How to eat 4/9 of a pizza. Discrete Mathematics. 311(16). 1635–1645. 6 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