Frank Kammer

According to our database, Frank Kammer authored at least 43 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Space-Efficient Graph Kernelizations.

Frank Kammer, Andrej Sajenko

Proceedings of the Theory and Applications of Models of Computation, 2024

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.

Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

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

Proceedings of the AKWI Jahrestagung 2024: Wissenschaft und Praxis, 2024

2023

ItsSQL: Intelligent Tutoring System for SQL.

Sören Aguirre Reid, Frank Kammer, Johannes Kunz, Timon Pellekoorne, Markus Siepermann, Jonas Wölfer

CoRR, 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

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).

Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism.

Frank Kammer, Johannes Meintrup, Andrej Sajenko

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Succinct Planar Encoding with Minor Operations.

Frank Kammer, Johannes Meintrup

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

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

Proceedings of the Design Science Research for a New Society: Society 5.0, 2023

2022

Space-Efficient Vertex Separators for Treewidth.

Frank Kammer, Johannes Meintrup, Andrej Sajenko

Algorithmica, 2022

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings.

Frank Kammer, Johannes Meintrup

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

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

On temporal graph exploration.

Thomas Erlebach, Michael Hoffmann, Frank Kammer

J. Comput. Syst. Sci., 2021

2020

FPT-space Graph Kernelizations.

Frank Kammer, Andrej Sajenko

CoRR, 2020

Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism.

Frank Kammer, Andrej Sajenko

CoRR, 2020

2019

Space-efficient Euler partition and bipartite edge coloring.

Torben Hagerup, Frank Kammer, Moritz Laudahn

Theor. Comput. Sci., 2019

Multistage Problems on a Global Budget.

Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko

CoRR, 2019

Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs.

Frank Kammer, Dieter Kratsch, Moritz Laudahn

Algorithmica, 2019

Two Moves per Time Step Make a Difference.

Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Linear-Time In-Place DFS and BFS on the Word RAM.

Frank Kammer, Andrej Sajenko

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Linear-Time In-Place DFS and BFS in the Restore Model.

Frank Kammer, Andrej Sajenko

CoRR, 2018

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays.

Frank Kammer, Andrej Sajenko

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Simple 2^f-Color Choice Dictionaries.

Frank Kammer, Andrej Sajenko

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

On-the-Fly Array Initialization in Less Space.

Torben Hagerup, Frank Kammer

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Approximate tree decompositions of planar graphs in linear time.

Frank Kammer, Torsten Tholey

Theor. Comput. Sci., 2016

Query-competitive algorithms for cheapest set problems under uncertainty.

Thomas Erlebach, Michael Hoffmann, Frank Kammer

Theor. Comput. Sci., 2016

Space-Efficient Hidden Surface Removal.

Frank Kammer, Maarten Löffler, Rodrigo I. Silveira

CoRR, 2016

Succinct Choice Dictionaries.

Torben Hagerup, Frank Kammer

CoRR, 2016

Space-Efficient Plane-Sweep Algorithms.

Amr Elmasry, Frank Kammer

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

A linear-time kernelization for the Rooted k-Leaf Outbranching Problem.

Frank Kammer

Discret. Appl. Math., 2015

Space-efficient Basic Graph Algorithms.

Amr Elmasry, Torben Hagerup, Frank Kammer

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Approximation Algorithms for Intersection Graphs.

Frank Kammer, Torsten Tholey

Algorithmica, 2014

Practical Approaches to Partially Guarding a Polyhedral Terrain.

Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals

Proceedings of the Geographic Information Science - 8th International Conference, 2014

2012

Treelike and Chordal Graphs: Algorithms and Generalizations.

Frank Kammer

PhD thesis, 2012

The complexity of minimum convex coloring.

Frank Kammer, Torsten Tholey

Discret. Appl. Math., 2012

Removing local extrema from imprecise terrains.

Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira

Comput. Geom., 2012

2011

Maximising lifetime for fault-tolerant target coverage in sensor networks.

Thomas Erlebach, Tom Grant, Frank Kammer

Sustain. Comput. Informatics Syst., 2011

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

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010

Approximation Algorithms for Intersection Graphs.

Frank Kammer, Torsten Tholey, Heiko Voepel

Proceedings of the Approximation, 2010

2009

The k-Disjoint Paths Problem on Chordal Graphs.

Frank Kammer, Torsten Tholey

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2007

Determining the Smallest <i>k</i> Such That <i>G</i> Is <i>k</i> -Outerplanar.

Frank Kammer

Proceedings of the Algorithms, 2007

2006

Simultaneous Embedding with Two Bends per Edge in Polynomial Area.

Frank Kammer

Proceedings of the Algorithm Theory, 2006

2004

Connectivity.

Frank Kammer, Hanjo Täubig

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004