Connectivity. - Frank Kammer; Hanjo Täubig (Network Analysis, 2004)

Simultaneous Embedding with Two Bends per Edge in Polynomial Area. - Frank Kammer (SWAT, 2006)

Determining the Smallest k Such That G Is k -Outerplanar. - Frank Kammer (ESA, 2007)

The k-Disjoint Paths Problem on Chordal Graphs. - Frank Kammer; Torsten Tholey (WG, 2009)

Approximation Algorithms for Intersection Graphs. - Frank Kammer; Torsten Tholey; Heiko Voepel (APPROX-RANDOM, 2010)

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. - René van Bevern; Sepp Hartung; Frank Kammer; Rolf Niedermeier; Mathias Weller (IPEC, 2011)

Maximising lifetime for fault-tolerant target coverage in sensor networks. - Thomas Erlebach; Tom Grant; Frank Kammer (Sustain. Comput. Informatics Syst., 2011)

Removing local extrema from imprecise terrains. - Chris Gray; Frank Kammer; Maarten Löffler; Rodrigo I. Silveira (Comput. Geom., 2012)

The complexity of minimum convex coloring. - Frank Kammer; Torsten Tholey (Discret. Appl. Math., 2012)

Treelike and Chordal Graphs: Algorithms and Generalizations. - Frank Kammer (2012)

Practical Approaches to Partially Guarding a Polyhedral Terrain. - Frank Kammer; Maarten Löffler; Paul Mutser; Frank Staals (GIScience, 2014)

Approximation Algorithms for Intersection Graphs. - Frank Kammer; Torsten Tholey (Algorithmica, 2014)

Space-efficient Basic Graph Algorithms. - Amr Elmasry; Torben Hagerup; Frank Kammer (STACS, 2015)

A linear-time kernelization for the Rooted k-Leaf Outbranching Problem. - Frank Kammer (Discret. Appl. Math., 2015)

Space-Efficient Plane-Sweep Algorithms. - Amr Elmasry; Frank Kammer (ISAAC, 2016)

Succinct Choice Dictionaries. - Torben Hagerup; Frank Kammer (CoRR, 2016)

Space-Efficient Hidden Surface Removal. - Frank Kammer; Maarten Löffler; Rodrigo I. Silveira (CoRR, 2016)

Query-competitive algorithms for cheapest set problems under uncertainty. - Thomas Erlebach; Michael Hoffmann 002; Frank Kammer (Theor. Comput. Sci., 2016)

Approximate tree decompositions of planar graphs in linear time. - Frank Kammer; Torsten Tholey (Theor. Comput. Sci., 2016)

On-the-Fly Array Initialization in Less Space. - Torben Hagerup; Frank Kammer (ISAAC, 2017)

Simple 2^f-Color Choice Dictionaries. - Frank Kammer; Andrej Sajenko (ISAAC, 2018)

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. - Frank Kammer; Andrej Sajenko (MFCS, 2018)

Linear-Time In-Place DFS and BFS in the Restore Model. - Frank Kammer; Andrej Sajenko (CoRR, 2018)

Linear-Time In-Place DFS and BFS on the Word RAM. - Frank Kammer; Andrej Sajenko (CIAC, 2019)

Two Moves per Time Step Make a Difference. - Thomas Erlebach; Frank Kammer; Kelin Luo; Andrej Sajenko; Jakob T. Spooner (ICALP, 2019)

Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. - Frank Kammer; Dieter Kratsch; Moritz Laudahn (Algorithmica, 2019)

Multistage Problems on a Global Budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (CoRR, 2019)

Space-efficient Euler partition and bipartite edge coloring. - Torben Hagerup; Frank Kammer; Moritz Laudahn (Theor. Comput. Sci., 2019)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. - Frank Kammer; Andrej Sajenko (CoRR, 2020)

FPT-space Graph Kernelizations. - Frank Kammer; Andrej Sajenko (CoRR, 2020)

On temporal graph exploration. - Thomas Erlebach; Michael Hoffmann 002; Frank Kammer (J. Comput. Syst. Sci., 2021)

Multistage graph problems on a global budget. - Klaus Heeger; Anne-Sophie Himmel; Frank Kammer; Rolf Niedermeier; Malte Renken; Andrej Sajenko (Theor. Comput. Sci., 2021)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. - Frank Kammer; Johannes Meintrup (ISAAC, 2022)

Space-Efficient Vertex Separators for Treewidth. - Frank Kammer; Johannes Meintrup; Andrej Sajenko (Algorithmica, 2022)

Know the Knowledge of Your Students: A Flexible Analytics Tool for Student Exercises. - Sören Aguirre Reid; Frank Kammer; Daria Schüller; Markus Siepermann; Jonas Wölfer (DESRIST, 2023)

Succinct Planar Encoding with Minor Operations. - Frank Kammer; Johannes Meintrup (ISAAC, 2023)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. - Frank Kammer; Johannes Meintrup; Andrej Sajenko (IWOCA, 2023)

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). - Alexander Leonhardt; Holger Dell; Anselm Haak; Frank Kammer; Johannes Meintrup; Ulrich Meyer 001; Manuel Penschuck (IPEC, 2023)

Improving Feedback from Automated Reviews of Student Spreadsheets. - Sören Aguirre Reid; Frank Kammer; Jonas-Ian Kuche; Pia-Doreen Ritzke; Markus Siepermann; Max Stephan; Armin Wagenknecht (CoRR, 2023)

ItsSQL: Intelligent Tutoring System for SQL. - Sören Aguirre Reid; Frank Kammer; Johannes Kunz; Timon Pellekoorne; Markus Siepermann; Jonas Wölfer (CoRR, 2023)

Digital Classroom - A Communication Platform for Online Teaching. - Sören Aguirre Reid; Frank Kammer; Dominik Kröll; Timon Pellekoorne; Harald Ritz; Markus Siepermann; Jonas Wölfer (AKWI Jahrestagung, 2024)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. - Konstantinos Dogeas; Thomas Erlebach; Frank Kammer; Johannes Meintrup; William K. Moses Jr. (ICALP, 2024)

Space-Efficient Graph Kernelizations. - Frank Kammer; Andrej Sajenko (TAMC, 2024)

Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism. - Frank Kammer; Johannes Meintrup; Andrej Sajenko (Theor. Comput. Sci., 2025)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings. - Michael Elberfeld; Frank Kammer; Johannes Meintrup (CoRR, 2025)