| 2026 | HCI | Navigating Examination Regulations: Reliable Chatbot Support for Students. | Sren Aguirre Reid, Frank Kammer, Nicolas Lang, Harald Ritz, Markus Siepermann, Jonas Wlfer |
| 2026 | SAC | Evaluating Knowledge Preferences in Question Answering via Bloom's Taxonomy. | Ruben Bimberg, Maximilian Huber, Frank Kammer, Johannes Meintrup, Markus Siepermann |
| 2025 | ISAAC | Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings. | Michael Elberfeld, Frank Kammer, Johannes Meintrup |
| 2024 | ICALP | Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. | Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr. |
| 2024 | TAMC | Space-Efficient Graph Kernelizations. | Frank Kammer, Andrej Sajenko |
| 2023 | ISAAC | Succinct Planar Encoding with Minor Operations. | Frank Kammer, Johannes Meintrup |
| 2023 | IWOCA | Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. | Frank Kammer, Johannes Meintrup, Andrej Sajenko |
| 2022 | ISAAC | Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. | Frank Kammer, Johannes Meintrup |
| 2019 | CIAC | Linear-Time In-Place DFS and BFS on the Word RAM. | Frank Kammer, Andrej Sajenko |
| 2019 | ICALP | Two Moves per Time Step Make a Difference. | Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner |
| 2018 | ISAAC | Simple 2^f-Color Choice Dictionaries. | Frank Kammer, Andrej Sajenko |
| 2018 | MFCS | Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. | Frank Kammer, Andrej Sajenko |
| 2017 | CIAC | Space-Efficient Euler Partition and Bipartite Edge Coloring. | Torben Hagerup, Frank Kammer, Moritz Laudahn |
| 2017 | ISAAC | On-the-Fly Array Initialization in Less Space. | Torben Hagerup, Frank Kammer |
| 2016 | ISAAC | Space-Efficient Plane-Sweep Algorithms. | Amr Elmasry, Frank Kammer |
| 2016 | MFCS | Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. | Frank Kammer, Dieter Kratsch, Moritz Laudahn |
| 2015 | ICALP | On Temporal Graph Exploration. | Thomas Erlebach, Michael Hoffmann, Frank Kammer |
| 2015 | STACS | Space-efficient Basic Graph Algorithms. | Amr Elmasry, Torben Hagerup, Frank Kammer |
| 2014 | MFCS | Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. | Thomas Erlebach, Michael Hoffmann, Frank Kammer |
| 2013 | WG | A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. | Frank Kammer |
| 2012 | SODA | Approximate tree decompositions of planar graphs in linear time. | Frank Kammer, Torsten Tholey |
| 2011 | SPAA | Maximising lifetime for fault-tolerant target coverage in sensor networks. | Thomas Erlebach, Tom Grant, Frank Kammer |
| 2009 | WG | The k-Disjoint Paths Problem on Chordal Graphs. | Frank Kammer, Torsten Tholey |
| 2008 | ISAAC | The Complexity of Minimum Convex Coloring. | Frank Kammer, Torsten Tholey |
| 2007 | ESA | Determining the Smallest | Frank Kammer |