Bernd Gärtner

2.4k total citations
63 papers, 692 citations indexed

About

Bernd Gärtner is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence. According to data from OpenAlex, Bernd Gärtner has authored 63 papers receiving a total of 692 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 20 papers in Computer Graphics and Computer-Aided Design and 13 papers in Artificial Intelligence. Recurrent topics in Bernd Gärtner's work include Computational Geometry and Mesh Generation (20 papers), Complexity and Algorithms in Graphs (14 papers) and Advanced Graph Theory Research (13 papers). Bernd Gärtner is often cited by papers focused on Computational Geometry and Mesh Generation (20 papers), Complexity and Algorithms in Graphs (14 papers) and Advanced Graph Theory Research (13 papers). Bernd Gärtner collaborates with scholars based in Switzerland, Germany and United States. Bernd Gärtner's co-authors include Jiřı́ Matoušek, Emo Welzl, Martin Jaggi, Martin Henk, Günter M. Ziegler, Volker Kaibel, Francisco J. Valero‐Cuevas, Komei Fukuda, Franz Aurenhammer and David S. Alberts and has published in prestigious journals such as SHILAP Revista de lepidopterología, Mathematical Programming and SIAM Journal on Computing.

In The Last Decade

Bernd Gärtner

58 papers receiving 620 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Bernd Gärtner Switzerland	14	240	179	169	113	98	63	692
E. Alper Yıldırım Türkiye	13	237 1.0×	124 0.7×	193 1.1×	195 1.7×	69 0.7×	43	925
Mihai Bâdoiu United States	10	173 0.7×	177 1.0×	255 1.5×	200 1.8×	83 0.8×	15	565
Paul C. Kainen United States	15	299 1.2×	142 0.8×	272 1.6×	120 1.1×	87 0.9×	56	718
Yuri Rabinovich Israel	14	631 2.6×	208 1.2×	265 1.6×	172 1.5×	325 3.3×	38	1.2k
Leonid G. Khachiyan United States	8	203 0.8×	63 0.4×	104 0.6×	42 0.4×	104 1.1×	8	506
Yin Tat Lee United States	18	373 1.6×	57 0.3×	338 2.0×	85 0.8×	211 2.2×	46	816
J. E. Yukich United States	18	173 0.7×	77 0.4×	314 1.9×	122 1.1×	81 0.8×	65	1.2k
Ioannis Z. Emiris Greece	23	935 3.9×	315 1.8×	144 0.9×	147 1.3×	47 0.5×	120	1.5k
Chris Walshaw United Kingdom	17	155 0.6×	111 0.6×	132 0.8×	157 1.4×	450 4.6×	65	1.0k
Raghu Meka United States	17	305 1.3×	36 0.2×	332 2.0×	148 1.3×	79 0.8×	48	792

Countries citing papers authored by Bernd Gärtner

Since Specialization

Citations

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

Fields of papers citing papers by Bernd Gärtner

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Bernd Gärtner

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

Gärtner, Bernd, et al.. (2018). ARRIVAL: Next Stop in CLS. arXiv (Cornell University).

Gärtner, Bernd, et al.. (2018). Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control. Frontiers in Computational Neuroscience. 12. 62–62. 17 indexed citations

Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pável Valtr, & Uli Wagner. (2018). The Crossing Tverberg Theorem. arXiv (Cornell University). 1 indexed citations

Kyrillidis, Anastasios, et al.. (2016). Learning Sparse Additive Models with Interactions in High Dimensions. International Conference on Artificial Intelligence and Statistics. 111–120. 2 indexed citations

Emiris, Ioannis Z., et al.. (2015). Efficient edge-skeleton computation for polytopes defined by oracles. Journal of Symbolic Computation. 73. 139–152. 1 indexed citations

Stich, Sebastian U., Christian L. Müller, & Bernd Gärtner. (2015). Variable metric random pursuit. Mathematical Programming. 156(1-2). 549–579. 5 indexed citations

Fukuda, Komei, et al.. (2015). Combinatorial Redundancy Detection. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 34. 328. 1 indexed citations

Gärtner, Bernd, et al.. (2013). Counting unique-sink orientations. Discrete Applied Mathematics. 163. 155–164. 3 indexed citations

Gärtner, Bernd, et al.. (2010). Clarkson's algorithm for violator spaces. Computational Geometry. 44(2). 70–81. 1 indexed citations

10.

Gärtner, Bernd, et al.. (2008). Violator spaces: Structure and algorithms. Discrete Applied Mathematics. 156(11). 2124–2141. 8 indexed citations

11.

Gärtner, Bernd & Remco C. Veltkamp. (2007). A decade of CGAL. Computational Geometry. 38(1-2). 1–3. 2 indexed citations

12.

Gärtner, Bernd, et al.. (2006). Linear programming and unique sink orientations. Symposium on Discrete Algorithms. 749–757. 9 indexed citations

13.

Gärtner, Bernd, et al.. (2006). Understanding and Using Linear Programming (Universitext). Springer eBooks. 12 indexed citations

14.

Gärtner, Bernd, et al.. (2003). Fast smallest-enclosing-ball computation in high dimensions.

15.

Gärtner, Bernd, et al.. (2001). Computing the width of a point set in 3-space.. Canadian Conference on Computational Geometry. 101–103. 3 indexed citations

16.

Ambühl, Christoph, Bernd Gärtner, & Bernhard von Stengel. (2001). A new lower bound for the list update problem in the partial cost model. Theoretical Computer Science. 268(1). 3–16. 4 indexed citations

17.

Dumitrescu, Adrian, et al.. (2000). Enumerating Triangulation Paths.. Canadian Conference on Computational Geometry. 1 indexed citations

18.

Gärtner, Bernd. (1999). Exact arithmetic at low cost – A case study in linear programming. Computational Geometry. 13(2). 121–139. 15 indexed citations

19.

Gärtner, Bernd. (1998). Exact arithmetic at low cost—a case study in linear programming. Symposium on Discrete Algorithms. 283. 157–166. 3 indexed citations

20.

Gärtner, Bernd, et al.. (1998). Exact primitives for smallest enclosing ellipses. Information Processing Letters. 68(1). 33–38. 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