Frank Kammer

491 total citations
21 papers, 110 citations indexed

About

Frank Kammer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Frank Kammer has authored 21 papers receiving a total of 110 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 4 papers in Artificial Intelligence. Recurrent topics in Frank Kammer's work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (7 papers) and Computational Geometry and Mesh Generation (3 papers). Frank Kammer is often cited by papers focused on Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (7 papers) and Computational Geometry and Mesh Generation (3 papers). Frank Kammer collaborates with scholars based in Germany, United States and United Kingdom. Frank Kammer's co-authors include Thomas Erlebach, Michael M. Hoffmann, Torben Hagerup, Amr Elmasry, Maarten Löffler, Daniel Otto, Rodrigo I. Silveira and Chris Gray and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Discrete Applied Mathematics.

In The Last Decade

Frank Kammer

20 papers receiving 108 citations

Peers

Frank Kammer

CTM

CNC

AI

EEE

SP

Alexander Langer Germany

Irit Katriel Germany

Dimitrios M. Thilikos France

Geevarghese Philip India

Alexandru Popa Romania

Frank Gurski Germany

Frederic Dorn Norway

N. S. Narayanaswamy India

Aman Goel United States

Antti E. J. Hyvärinen Switzerland

Alexander Langer Germany

Frank Kammer

122 ×2.1

CTM

50 ×1.0

CNC

20 ×1.5

AI

12 ×1.1

EEE

3 ×0.3

SP

Citations per year, relative to Frank Kammer Frank Kammer (= 1×) peers Alexander Langer

Countries citing papers authored by Frank Kammer

Since Specialization

Citations

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

Fields of papers citing papers by Frank Kammer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Frank Kammer

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

1.

Kammer, Frank, et al.. (2025). Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism. Theoretical Computer Science. 1049. 115358–115358.

2.

Otto, Daniel, et al.. (2024). STUDENT ACCEPTANCE OF AI-BASED FEEDBACK SYSTEMS: AN ANALYSIS BASED ON THE TECHNOLOGY ACCEPTANCE MODEL (TAM). INTED proceedings. 1. 3695–3701. 6 indexed citations

3.

Kammer, Frank, et al.. (2022). Space-Efficient Vertex Separators for Treewidth. Algorithmica. 84(9). 2414–2461. 1 indexed citations

4.

Erlebach, Thomas, Michael M. Hoffmann, & Frank Kammer. (2021). On temporal graph exploration. Journal of Computer and System Sciences. 119. 1–18. 23 indexed citations

5.

Erlebach, Thomas, et al.. (2019). Two Moves per Time Step Make a Difference. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 6 indexed citations

6.

Kammer, Frank, et al.. (2018). Simple 2^f-Color Choice Dictionaries. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 12. 1 indexed citations

7.

Hagerup, Torben, et al.. (2018). Space-efficient Euler partition and bipartite edge coloring. Theoretical Computer Science. 754. 16–34. 5 indexed citations

8.

Kammer, Frank, et al.. (2018). Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica. 81(3). 1180–1204. 1 indexed citations

9.

Hagerup, Torben & Frank Kammer. (2017). On-the-Fly Array Initialization in Less Space. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 92. 12. 2 indexed citations

10.

Kammer, Frank, et al.. (2016). Approximate tree decompositions of planar graphs in linear time. Theoretical Computer Science. 645. 60–90. 4 indexed citations

11.

Elmasry, Amr & Frank Kammer. (2016). Space-Efficient Plane-Sweep Algorithms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 64. 13. 2 indexed citations

12.

Erlebach, Thomas, Michael M. Hoffmann, & Frank Kammer. (2015). Query-competitive algorithms for cheapest set problems under uncertainty. Theoretical Computer Science. 613. 51–64. 9 indexed citations

13.

Kammer, Frank. (2015). A linear-time kernelization for the Rooted k-Leaf Outbranching Problem. Discrete Applied Mathematics. 193. 126–138. 1 indexed citations

14.

Kammer, Frank, et al.. (2012). Approximate tree decompositions of planar graphs in linear time. Symposium on Discrete Algorithms. 683–698. 6 indexed citations

15.

Gray, Chris, Frank Kammer, Maarten Löffler, & Rodrigo I. Silveira. (2012). Removing local extrema from imprecise terrains. Computational Geometry. 45(7). 334–349. 4 indexed citations

16.

Kammer, Frank, et al.. (2012). Approximation Algorithms for Intersection Graphs. Algorithmica. 68(2). 312–336. 9 indexed citations

17.

Kammer, Frank. (2012). Treelike and Chordal Graphs: Algorithms and Generalizations. OPUS (Augsburg University). 2 indexed citations

18.

Kammer, Frank, et al.. (2011). The complexity of minimum convex coloring. Discrete Applied Mathematics. 160(6). 810–833. 12 indexed citations

19.

Erlebach, Thomas, et al.. (2011). Maximising lifetime for fault-tolerant target coverage in sensor networks. Leicester Research Archive (University of Leicester). 187–196. 4 indexed citations

20.

Erlebach, Thomas, et al.. (2011). Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustainable Computing Informatics and Systems. 1(3). 213–225. 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