Dennis Komm

959 total citations
31 papers, 192 citations indexed

About

Dennis Komm is a scholar working on Computer Networks and Communications, Computer Science Applications and Computational Theory and Mathematics. According to data from OpenAlex, Dennis Komm has authored 31 papers receiving a total of 192 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computer Networks and Communications, 11 papers in Computer Science Applications and 7 papers in Computational Theory and Mathematics. Recurrent topics in Dennis Komm's work include Optimization and Search Problems (16 papers), Teaching and Learning Programming (9 papers) and Caching and Content Delivery (8 papers). Dennis Komm is often cited by papers focused on Optimization and Search Problems (16 papers), Teaching and Learning Programming (9 papers) and Caching and Content Delivery (8 papers). Dennis Komm collaborates with scholars based in Switzerland, Germany and Slovakia. Dennis Komm's co-authors include Hans-Joachim Böckenhauer, Richard Královič, Juraj Hromkovič, Tobias Kohn, Rastislav Kráľovič, Peter Rossmanith, Walter Unger, Tobias Mömke, Sebastian Seibert and Davide Bilò and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.

In The Last Decade

Dennis Komm

27 papers receiving 184 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Dennis Komm Switzerland	9	130	68	40	35	34	31	192
René van Bevern Germany	8	52 0.4×	89 1.3×	49 1.2×	4 0.1×	8 0.2×	22	173
Ana Silva Brazil	9	29 0.2×	130 1.9×	9 0.2×	6 0.2×	12 0.4×	50	181
Elias C. Stavropoulos Greece	9	23 0.2×	50 0.7×	2 0.1×	59 1.7×	5 0.1×	20	223
Marta Cialdea Mayer Italy	9	41 0.3×	71 1.0×	12 0.3×	7 0.2×	3 0.1×	31	233
D. Brian Larkins United States	6	203 1.6×	7 0.1×	4 0.1×	34 1.0×	3 0.1×	19	292
Pim van ’t Hof Norway	12	122 0.9×	280 4.1×	19 0.5×		16 0.5×	40	327
Adrián Riesco Spain	8	40 0.3×	80 1.2×	2 0.1×	8 0.2×	14 0.4×	30	173
Haodi Feng China	8	51 0.4×	37 0.5×	67 1.7×		12 0.4×	20	200
Stefan Naujokat Germany	7	26 0.2×	32 0.5×	6 0.1×	2 0.1×	9 0.3×	20	141
Daniel Moldt Germany	6	21 0.2×	31 0.5×	7 0.2×	5 0.1×	13 0.4×	44	117

Countries citing papers authored by Dennis Komm

Since Specialization

Citations

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

Fields of papers citing papers by Dennis Komm

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Dennis Komm

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

Böckenhauer, Hans-Joachim, Juraj Hromkovič, Dennis Komm, Peter Rossmanith, & Moritz Stocker. (2025). A survey of online knapsack problems. Discrete Applied Mathematics. 378. 492–507.

Böckenhauer, Hans-Joachim, Juraj Hromkovič, Ralf Klasing, et al.. (2025). Online Unbounded Knapsack. Theory of Computing Systems. 69(1). 1 indexed citations

Erickson, Jeff, et al.. (2024). A Survey of Undergraduate Theory of Computing Curricula. 281–282. 3 indexed citations

Erickson, Jeff, et al.. (2024). A Survey of Undergraduate Theory of Computation Curricula in the United States. 1–14.

Hromkovič, Juraj & Dennis Komm. (2019). Can Solving Short Tasks be an Essential Part of Constructionist Learning. Constructivist Foundations. 14(3). 402–404. 1 indexed citations

Böckenhauer, Hans-Joachim, et al.. (2019). An Elementary Approach Towards Teaching Dynamic Programming. Bulletin of the European Association for Theoretical Computer Science. 128(128). 587.

Komm, Dennis, et al.. (2018). Interdisciplinary education in mathematics and informatics at swiss high schools. Bulletin of the European Association for Theoretical Computer Science. 2018(126). 67–78. 2 indexed citations

Hromkovič, Juraj, et al.. (2017). Algorithmic Thinking from the Start. Bulletin of the European Association for Theoretical Computer Science. 121(121). 132–139. 4 indexed citations

Böckenhauer, Hans-Joachim, Dennis Komm, Rastislav Kráľovič, Richard Královič, & Tobias Mömke. (2017). Online algorithms with advice: The tape model. Information and Computation. 254. 59–83. 15 indexed citations

10.

Böckenhauer, Hans-Joachim, Dennis Komm, Rastislav Kráľovič, & Richard Královič. (2017). On the advice complexity of the k-server problem. Journal of Computer and System Sciences. 86. 159–170. 9 indexed citations

11.

Komm, Dennis & Tobias Kohn. (2017). An Introduction to Running Time Analysis for an SOI Workshop. 11(1). 77–86. 1 indexed citations

12.

Dobrev, Stefan, Jeff Edmonds, Dennis Komm, et al.. (2017). Improved analysis of the online set cover problem with advice. Theoretical Computer Science. 689. 96–107. 2 indexed citations

13.

Hromkovič, Juraj, et al.. (2016). Examples of Algorithmic Thinking in Programming Education. 10(1). 111–124. 11 indexed citations

14.

Komm, Dennis. (2016). An Introduction to Online Computation. DIAL (Catholic University of Leuven). 18 indexed citations

15.

Böckenhauer, Hans-Joachim, et al.. (2014). The string guessing problem as a method to prove lower bounds on the advice complexity. Theoretical Computer Science. 554. 95–108. 23 indexed citations

16.

Komm, Dennis, Rastislav Kráľovič, Richard Královič, & Tobias Mömke. (2014). Randomized Online Algorithms with High Probability Guarantees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

17.

Böckenhauer, Hans-Joachim, Dennis Komm, Richard Královič, & Peter Rossmanith. (2014). The online knapsack problem: Advice and randomization. Theoretical Computer Science. 527. 61–72. 25 indexed citations

18.

Hromkovič, Juraj, et al.. (2011). Fehlerkorrigierende Codes - Ein Unterrichtsbeispiel zum gelenkten entdeckenden Lernen.. 31. 50–55. 1 indexed citations

19.

Bilò, Davide, Hans-Joachim Böckenhauer, Dennis Komm, et al.. (2010). Reoptimization of the Shortest Common Superstring Problem. Algorithmica. 61(2). 227–251. 6 indexed citations

20.

Böckenhauer, Hans-Joachim & Dennis Komm. (2009). Reoptimization of the metric deadline TSP. Journal of Discrete Algorithms. 8(1). 87–100. 10 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