Frank Kammer

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

2023

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.

[BibT_eX]

[DOI]

CoRR, 2023

ItsSQL: Intelligent Tutoring System for SQL.

[BibT_eX]

[DOI]

CoRR, 2023

Improving Feedback from Automated Reviews of Student Spreadsheets.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Succinct Planar Encoding with Minor Operations.

[BibT_eX]

[DOI]

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

Know the Knowledge of Your Students: A Flexible Analytics Tool for Student Exercises.

[BibT_eX]

[DOI]

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

2022

Space-Efficient Vertex Separators for Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2022

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

[BibT_eX]

[DOI]

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

2021

Multistage graph problems on a global budget.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On temporal graph exploration.

[BibT_eX]

[DOI]

Thomas Erlebach

Michael Hoffmann

J. Comput. Syst. Sci., 2021

2020

FPT-space Graph Kernelizations.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Space-efficient Euler partition and bipartite edge coloring.

[BibT_eX]

[DOI]

Moritz Laudahn

Theor. Comput. Sci., 2019

Multistage Problems on a Global Budget.

[BibT_eX]

[DOI]

CoRR, 2019

Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs.

[BibT_eX]

[DOI]

Dieter Kratsch

Moritz Laudahn

Algorithmica, 2019

Two Moves per Time Step Make a Difference.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

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

Simple 2^f-Color Choice Dictionaries.

[BibT_eX]

[DOI]

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

2017

On-the-Fly Array Initialization in Less Space.

[BibT_eX]

[DOI]

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

2016

Approximate tree decompositions of planar graphs in linear time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Query-competitive algorithms for cheapest set problems under uncertainty.

[BibT_eX]

[DOI]

Thomas Erlebach

Michael Hoffmann

Theor. Comput. Sci., 2016

Space-Efficient Hidden Surface Removal.

[BibT_eX]

[DOI]

Maarten Löffler

Rodrigo I. Silveira

CoRR, 2016

Succinct Choice Dictionaries.

[BibT_eX]

[DOI]

CoRR, 2016

Space-Efficient Plane-Sweep Algorithms.

[BibT_eX]

[DOI]

Amr Elmasry

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

2015

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Space-efficient Basic Graph Algorithms.

[BibT_eX]

[DOI]

Amr Elmasry

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

2014

Approximation Algorithms for Intersection Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2014

Practical Approaches to Partially Guarding a Polyhedral Terrain.

[BibT_eX]

[DOI]

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

2012

Treelike and Chordal Graphs: Algorithms and Generalizations.

[BibT_eX]

[DOI]

PhD thesis, 2012

The complexity of minimum convex coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Removing local extrema from imprecise terrains.

[BibT_eX]

[DOI]

Comput. Geom., 2012

2011

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

[BibT_eX]

[DOI]

Thomas Erlebach

Tom Grant

Sustain. Comput. Informatics Syst., 2011

Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.

[BibT_eX]

[DOI]

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

2010

Approximation Algorithms for Intersection Graphs.

[BibT_eX]

[DOI]

Heiko Voepel

Proceedings of the Approximation, 2010

2009

The k-Disjoint Paths Problem on Chordal Graphs.

[BibT_eX]

[DOI]

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

2007

Determining the Smallest k Such That G Is k -Outerplanar.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Simultaneous Embedding with Two Bends per Edge in Polynomial Area.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

2004

Connectivity.

[BibT_eX]

[DOI]