Andreas Karrenbauer

960 total citations
37 papers, 410 citations indexed

About

Andreas Karrenbauer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Andreas Karrenbauer has authored 37 papers receiving a total of 410 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 7 papers in Computer Vision and Pattern Recognition. Recurrent topics in Andreas Karrenbauer's work include Complexity and Algorithms in Graphs (6 papers), Computational Geometry and Mesh Generation (6 papers) and Optimization and Search Problems (4 papers). Andreas Karrenbauer is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), Computational Geometry and Mesh Generation (6 papers) and Optimization and Search Problems (4 papers). Andreas Karrenbauer collaborates with scholars based in Germany, Switzerland and United States. Andreas Karrenbauer's co-authors include Antti Oulasvirta, Tobias Jung, Aditya Shekhar Nittala, Tobias Kraus, Arshad Khan, Jürgen Steimle, Christoph Lenzen, Dominik Wöll, Fabian Kühn and Mohsen Ghaffari and has published in prestigious journals such as Nature Communications, Proceedings of the IEEE and Communications of the ACM.

In The Last Decade

Andreas Karrenbauer

36 papers receiving 390 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andreas Karrenbauer Germany 11 89 77 69 57 50 37 410
Takanori Fujiwara Japan 15 252 2.8× 49 0.6× 24 0.3× 114 2.0× 26 0.5× 69 640
Alex Tek France 8 77 0.9× 49 0.6× 28 0.4× 32 0.6× 28 0.6× 10 519
William V. Wright United States 9 339 3.8× 43 0.6× 96 1.4× 46 0.8× 36 0.7× 13 902
Yichao Zhang China 14 107 1.2× 38 0.5× 8 0.1× 22 0.4× 22 0.4× 62 527
Thomas Bläsius Germany 12 40 0.4× 32 0.4× 34 0.5× 83 1.5× 78 1.6× 42 645
Craig S. Kaplan Canada 19 406 4.6× 19 0.2× 87 1.3× 21 0.4× 68 1.4× 80 935
Yirong Yang United States 9 42 0.5× 58 0.8× 7 0.1× 26 0.5× 71 1.4× 32 360
Carlo Ciliberto Italy 13 187 2.1× 48 0.6× 20 0.3× 79 1.4× 62 1.2× 38 643
Irina Fedulova Russia 9 48 0.5× 11 0.1× 20 0.3× 14 0.2× 28 0.6× 13 417
Jun Yuan China 15 386 4.3× 79 1.0× 18 0.3× 26 0.5× 13 0.3× 36 770

Countries citing papers authored by Andreas Karrenbauer

Since Specialization
Citations

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

Fields of papers citing papers by Andreas Karrenbauer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andreas Karrenbauer

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Karrenbauer. A scholar is included among the top collaborators of Andreas Karrenbauer 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 Andreas Karrenbauer. Andreas Karrenbauer 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.
Koehler, Jana, et al.. (2023). A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme. arXiv (Cornell University). 2 indexed citations
2.
Karrenbauer, Andreas, et al.. (2021). Near-optimal approximate shortest paths and transshipment in distributed and streaming models. ARCA (Università Ca' Foscari Venezia). 6 indexed citations
3.
Nittala, Aditya Shekhar, Andreas Karrenbauer, Arshad Khan, Tobias Kraus, & Jürgen Steimle. (2021). Computational design and optimization of electro-physiological sensors. Nature Communications. 12(1). 6351–6351. 41 indexed citations
4.
Oulasvirta, Antti, et al.. (2020). Combinatorial Optimization of Graphical User Interface Designs. Proceedings of the IEEE. 108(3). 434–464. 68 indexed citations
5.
Karrenbauer, Andreas, et al.. (2018). Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. Max Planck Digital Library. 2898–2907. 5 indexed citations
6.
Ghaffari, Mohsen, Andreas Karrenbauer, Fabian Kühn, Christoph Lenzen, & Boaz Patt-Shamir. (2018). Near-Optimal Distributed Maximum Flow. SIAM Journal on Computing. 47(6). 2078–2117. 10 indexed citations
7.
Oulasvirta, Antti, et al.. (2017). Computational Support for Functionality Selection in Interaction Design. ACM Transactions on Computer-Human Interaction. 24(5). 1–30. 10 indexed citations
8.
Chalermsook, Parinya, José Correa, Andreas Karrenbauer, et al.. (2015). On Guillotine Cutting Sequences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–19. 3 indexed citations
9.
Wöll, Dominik, et al.. (2013). A novel method for automatic single molecule tracking of blinking molecules at low intensities. Physical Chemistry Chemical Physics. 15(17). 6196–6196. 25 indexed citations
10.
Jung, Tobias, et al.. (2010). P‐56: Application of the SSC Local Dimming Algorithm for an Edge‐Lit TV. SID Symposium Digest of Technical Papers. 41(1). 1450–1453. 5 indexed citations
11.
Althaus, Ernst, Stefan Canzar, Mark R. Emmett, et al.. (2010). Computing H/D-Exchange rates of single residues from data of proteolytic fragments. BMC Bioinformatics. 11(1). 424–424. 32 indexed citations
12.
Karrenbauer, Andreas, et al.. (2010). A combinatorial algorithm for the 1-median problem in with the Chebyshev norm. Operations Research Letters. 38(5). 383–385. 2 indexed citations
13.
Althaus, Ernst, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, & Julián Mestre. (2010). Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica. 61(2). 342–361. 1 indexed citations
14.
Althaus, Ernst, Stefan Canzar, Mark R. Emmett, et al.. (2009). Discrete fitting of hydrogen-deuterium-exchange data of overlapping fragments. Data Archiving and Networked Services (DANS). 496–502. 6 indexed citations
15.
Karrenbauer, Andreas, et al.. (2009). 50.3: A Video‐Capable Algorithm for Local Dimming RGB Backlight. SID Symposium Digest of Technical Papers. 40(1). 753–756. 14 indexed citations
16.
Karrenbauer, Andreas, et al.. (2009). Domain walls and chaos in the disordered SOS model. Journal of Statistical Mechanics Theory and Experiment. 2009(8). P08022–P08022. 15 indexed citations
17.
Karrenbauer, Andreas, et al.. (2008). A Clipper-free Algorithm for Efficient HW-Implementation of Local Dimming LED-Backlight. Max Planck Institute for Plasma Physics. 286–289. 10 indexed citations
18.
Eisenbrand, Friedrich, et al.. (2008). Multiline Addressing by Network Flow. Algorithmica. 53(4). 583–596. 3 indexed citations
19.
Karrenbauer, Andreas, et al.. (2007). 8.4: A New Addressing Scheme for PM OLED Display. SID Symposium Digest of Technical Papers. 38(1). 97–100. 6 indexed citations
20.
Eisenbrand, Friedrich, et al.. (2005). Packing a trunk. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 197–206. 16 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

Rankless by CCL
2026