Karl Bringmann

2.2k total citations
71 papers, 757 citations indexed

About

Karl Bringmann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Karl Bringmann has authored 71 papers receiving a total of 757 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 31 papers in Artificial Intelligence and 18 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Karl Bringmann's work include Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (19 papers) and Computational Geometry and Mesh Generation (18 papers). Karl Bringmann is often cited by papers focused on Advanced Graph Theory Research (19 papers), Complexity and Algorithms in Graphs (19 papers) and Computational Geometry and Mesh Generation (18 papers). Karl Bringmann collaborates with scholars based in Germany, Switzerland and Denmark. Karl Bringmann's co-authors include Tobias Friedrich, Marvin Künnemann, Frank Neumann, Markus Wagner, Christian Igel, Amir Abboud, Kasper Green Larsen, Wolfgang Mulzer, Κωνσταντίνος Παναγιώτου and Víctor Álvarez and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Artificial Intelligence.

In The Last Decade

Karl Bringmann

67 papers receiving 737 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Karl Bringmann Germany 14 526 439 86 81 78 71 757
Sanjeeb Dash United States 15 278 0.5× 120 0.3× 67 0.8× 109 1.3× 14 0.2× 46 714
Remigijus Paulavičius Lithuania 16 354 0.7× 250 0.6× 67 0.8× 107 1.3× 12 0.2× 48 728
Sukhamay Kundu United States 10 205 0.4× 122 0.3× 73 0.8× 113 1.4× 60 0.8× 48 553
Bertrand Neveu France 10 110 0.2× 156 0.4× 37 0.4× 86 1.1× 30 0.4× 31 423
Thomas H. Spencer United States 14 367 0.7× 180 0.4× 33 0.4× 240 3.0× 86 1.1× 27 739
Jyotirmoy V. Deshmukh United States 16 473 0.9× 376 0.9× 36 0.4× 104 1.3× 57 0.7× 61 885
Frédéric Benhamou France 10 284 0.5× 244 0.6× 34 0.4× 298 3.7× 108 1.4× 25 600
Ted Bapty United States 14 165 0.3× 377 0.9× 116 1.3× 216 2.7× 13 0.2× 61 899
Jakub Mareček Czechia 10 105 0.2× 241 0.5× 156 1.8× 152 1.9× 36 0.5× 45 693
Jean‐Louis Goffin Canada 18 503 1.0× 76 0.2× 80 0.9× 75 0.9× 19 0.2× 42 1.1k

Countries citing papers authored by Karl Bringmann

Since Specialization
Citations

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

Fields of papers citing papers by Karl Bringmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Karl Bringmann

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

All Works

20 of 20 papers shown
1.
Bringmann, Karl, et al.. (2024). The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
2.
Bringmann, Karl, et al.. (2024). The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds. SHILAP Revista de lepidopterología. Volume 3. 1 indexed citations
3.
Abboud, Amir, et al.. (2023). Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. 391–404. 9 indexed citations
4.
Bringmann, Karl, et al.. (2021). Fast n-fold Boolean Convolution via Additive Combinatorics. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–17. 3 indexed citations
5.
Bringmann, Karl, et al.. (2021). Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations
6.
Abboud, Amir & Karl Bringmann. (2018). Tighter Connections Between Formula-SAT and Shaving Logs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 5 indexed citations
7.
Bringmann, Karl, et al.. (2017). De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica. 80(11). 3397–3427. 2 indexed citations
8.
Bringmann, Karl, et al.. (2017). Greedy Routing and the Algorithmic Small-World Phenomenon. 371–380. 10 indexed citations
9.
Bringmann, Karl, László Kozma, Shay Moran, & N. S. Narayanaswamy. (2016). Hitting Set for Hypergraphs of Low VC-dimension. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
10.
Bringmann, Karl, Danny Hermelin, Matthias Mnich, & Erik Jan van Leeuwen. (2016). Parameterized complexity dichotomy for Steiner Multicut. Journal of Computer and System Sciences. 82(6). 1020–1043. 3 indexed citations
11.
Bringmann, Karl & Wolfgang Mulzer. (2015). Approximability of the Discrete Fréchet Distance. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
12.
Bringmann, Karl, et al.. (2015). Online Checkpointing with Improved Worst-Case Guarantees. INFORMS journal on computing. 27(3). 478–490.
13.
Álvarez, Víctor, Karl Bringmann, Saurabh Ray, & Raimund Seidel. (2014). Counting triangulations and other crossing-free structures approximately. Computational Geometry. 48(5). 386–397. 4 indexed citations
14.
Álvarez, Víctor, Karl Bringmann, Saurabh Ray, & Raimund Seidel. (2013). Counting Triangulations Approximately. MPG.PuRe (Max Planck Society). 85–89.
15.
Bringmann, Karl, et al.. (2013). Speeding up many-objective optimization by Monte Carlo approximations. Artificial Intelligence. 204. 22–29. 29 indexed citations
16.
Bringmann, Karl & Kasper Green Larsen. (2013). Succinct sampling from discrete distributions. 775–782. 6 indexed citations
17.
Bringmann, Karl & Tobias Friedrich. (2012). Approximation quality of the hypervolume indicator. Artificial Intelligence. 195. 265–290. 59 indexed citations
18.
Bringmann, Karl, Tobias Friedrich, Frank Neumann, & Markus Wagner. (2011). Approximation-guided evolutionary multi-objective optimization. Adelaide Research & Scholarship (AR&S) (University of Adelaide). 50 indexed citations
19.
Bringmann, Karl. (2011). An improved algorithm for Kleeʼs measure problem on fat boxes. Computational Geometry. 45(5-6). 225–233. 11 indexed citations
20.
Bringmann, Karl & Tobias Friedrich. (2010). Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science. 425. 104–116. 47 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

Breakdown of academic impact, for papers by Sanjeeb Dash Breakdown of academic impact, for papers by Remigijus Paulavičius Breakdown of academic impact, for papers by Sukhamay Kundu Breakdown of academic impact, for papers by Bertrand Neveu Breakdown of academic impact, for papers by Thomas H. Spencer Breakdown of academic impact, for papers by Jyotirmoy V. Deshmukh Breakdown of academic impact, for papers by Frédéric Benhamou Breakdown of academic impact, for papers by Ted Bapty Breakdown of academic impact, for papers by Jakub Mareček Breakdown of academic impact, for papers by Jean‐Louis Goffin
Rankless by CCL
2026