Frank Kammer

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 37

Top Venues

University of Augsburg (PHD)

Education History

University of Augsburg

PHD

Publications

Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP (2024)
Frank Kammer, Andrej Sajenko
Space-Efficient Graph Kernelizations. TAMC (2024)
Frank Kammer, Johannes Meintrup
Succinct Planar Encoding with Minor Operations. CoRR (2023)
Sören Aguirre Reid, Frank Kammer, Johannes Kunz, Timon Pellekoorne, Markus Siepermann, Jonas Wölfer
ItsSQL: Intelligent Tutoring System for SQL. CoRR (2023)
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR (2023)
Sören Aguirre Reid, Frank Kammer, Jonas-Ian Kuche, Pia-Doreen Ritzke, Markus Siepermann, Max Stephan, Armin Wagenknecht
Improving Feedback from Automated Reviews of Student Spreadsheets. CoRR (2023)
Frank Kammer, Johannes Meintrup, Andrej Sajenko
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. IWOCA (2023)
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC (2023)
Sören Aguirre Reid, Frank Kammer, Daria Schüller, Markus Siepermann, Jonas Wölfer
Know the Knowledge of Your Students: A Flexible Analytics Tool for Student Exercises. DESRIST (2023)
Frank Kammer, Johannes Meintrup
Succinct Planar Encoding with Minor Operations. ISAAC (2023)
Frank Kammer, Johannes Meintrup
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. ISAAC (2022)
Frank Kammer, Johannes Meintrup, Andrej Sajenko
Space-Efficient Vertex Separators for Treewidth. Algorithmica 84 (9) (2022)
Frank Kammer, Johannes Meintrup
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. CoRR (2022)
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
Multistage graph problems on a global budget. Theor. Comput. Sci. 868 (2021)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On temporal graph exploration. J. Comput. Syst. Sci. 119 (2021)
Frank Kammer, Andrej Sajenko
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. CoRR (2020)
Frank Kammer, Andrej Sajenko
FPT-space Graph Kernelizations. CoRR (2020)
Frank Kammer, Andrej Sajenko
Linear-Time In-Place DFS and BFS on the Word RAM. CIAC (2019)
Frank Kammer, Dieter Kratsch, Moritz Laudahn
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica 81 (3) (2019)
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko
Multistage Problems on a Global Budget. CoRR (2019)
Torben Hagerup, Frank Kammer, Moritz Laudahn
Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754 (2019)
Frank Kammer, Johannes Meintrup, Andrej Sajenko
Space-Efficient Vertex Separators for Treewidth. CoRR (2019)
Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner
Two Moves per Time Step Make a Difference. ICALP (2019)
Frank Kammer, Andrej Sajenko
Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. MFCS (2018)
Frank Kammer, Andrej Sajenko
Linear-Time In-Place DFS and BFS in the Restore Model. CoRR (2018)
Frank Kammer, Andrej Sajenko
Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays. CoRR (2018)
Frank Kammer, Andrej Sajenko
Simple 2^f-Color Choice Dictionaries. ISAAC (2018)
Torben Hagerup, Frank Kammer, Moritz Laudahn
Space-Efficient Euler Partition and Bipartite Edge Coloring. CIAC (2017)
Torben Hagerup, Frank Kammer
On-the-Fly Array Initialization in Less Space. CoRR (2017)
Torben Hagerup, Frank Kammer
On-the-Fly Array Initialization in Less Space. ISAAC (2017)
Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
Space-Efficient Hidden Surface Removal. CoRR (2016)
Frank Kammer, Dieter Kratsch, Moritz Laudahn
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. MFCS (2016)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613 (2016)
Frank Kammer, Torsten Tholey
Approximate tree decompositions of planar graphs in linear time. Theor. Comput. Sci. 645 (2016)
Amr Elmasry, Frank Kammer
Space-Efficient Plane-Sweep Algorithms. ISAAC (2016)
Torben Hagerup, Frank Kammer
Succinct Choice Dictionaries. CoRR (2016)
Frank Kammer, Dieter Kratsch, Moritz Laudahn
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. CoRR (2016)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On Temporal Graph Exploration. CoRR (2015)
Amr Elmasry, Torben Hagerup, Frank Kammer
Space-efficient Basic Graph Algorithms. STACS (2015)
Frank Kammer
A linear-time kernelization for the Rooted k-Leaf Outbranching Problem. Discret. Appl. Math. 193 (2015)
Amr Elmasry, Frank Kammer
Space-Efficient Plane-Sweep Algorithms. CoRR (2015)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On Temporal Graph Exploration. ICALP (1) (2015)
Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals
Practical Approaches to Partially Guarding a Polyhedral Terrain. GIScience (2014)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) (2014)
Frank Kammer, Torsten Tholey
Approximation Algorithms for Intersection Graphs. Algorithmica 68 (2) (2014)
Frank Kammer
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. WG (2013)
Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
Removing local extrema from imprecise terrains. Comput. Geom. 45 (7) (2012)
Frank Kammer, Torsten Tholey
The complexity of minimum convex coloring. Discret. Appl. Math. 160 (6) (2012)
Frank Kammer, Torsten Tholey
Approximate tree decompositions of planar graphs in linear time. SODA (2012)
Thomas Erlebach, Tom Grant, Frank Kammer
Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. 1 (3) (2011)
Frank Kammer, Torsten Tholey
Approximate Tree Decompositions of Planar Graphs in Linear Time CoRR (2011)
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC (2011)
Thomas Erlebach, Tom Grant, Frank Kammer
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA (2011)
Frank Kammer, Torsten Tholey, Heiko Voepel
Approximation Algorithms for Intersection Graphs. APPROX-RANDOM (2010)
Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira
Removing Local Extrema from Imprecise Terrains CoRR (2010)
Frank Kammer, Torsten Tholey
The k-Disjoint Paths Problem on Chordal Graphs. WG (2009)
Frank Kammer, Torsten Tholey
The Complexity of Minimum Convex Coloring. ISAAC (2008)
Frank Kammer
-Outerplanar. ESA (2007)
Frank Kammer
Simultaneous Embedding with Two Bends per Edge in Polynomial Area. SWAT (2006)
Frank Kammer, Hanjo Täubig
Connectivity. Network Analysis (2004)

Frank Kammer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frank Kammer