default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Kammer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Sören Aguirre Reid, Frank Kammer, Dominik Kröll, Timon Pellekoorne, Harald Ritz, Markus Siepermann, Jonas Wölfer:
Digital Classroom - A Communication Platform for Online Teaching. AKWI Jahrestagung 2024: 97-114- [c29]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP 2024: 55:1-55:18 - [c28]Frank Kammer
, Andrej Sajenko:
Space-Efficient Graph Kernelizations. TAMC 2024: 260-271 - 2023
- [c27]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: 329-344 - [c26]Frank Kammer, Johannes Meintrup:
Succinct Planar Encoding with Minor Operations. ISAAC 2023: 44:1-44:18 - [c25]Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. IWOCA 2023: 356-367 - [c24]Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck:
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - [i19]Frank Kammer, Johannes Meintrup:
Succinct Planar Encoding with Minor Operations. CoRR abs/2301.10564 (2023) - [i18]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 abs/2311.10728 (2023) - [i17]Sören Aguirre Reid, Frank Kammer, Johannes Kunz, Timon Pellekoorne, Markus Siepermann, Jonas Wölfer:
ItsSQL: Intelligent Tutoring System for SQL. CoRR abs/2311.10730 (2023) - [i16]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR abs/2312.07140 (2023) - 2022
- [j12]Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Space-Efficient Vertex Separators for Treewidth. Algorithmica 84(9): 2414-2461 (2022) - [c23]Frank Kammer, Johannes Meintrup:
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. ISAAC 2022: 62:1-62:15 - [i15]Frank Kammer, Johannes Meintrup:
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. CoRR abs/2205.06128 (2022) - 2021
- [j11]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On temporal graph exploration. J. Comput. Syst. Sci. 119: 1-18 (2021) - [j10]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage graph problems on a global budget. Theor. Comput. Sci. 868: 46-64 (2021) - 2020
- [i14]Frank Kammer, Andrej Sajenko:
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. CoRR abs/2002.07287 (2020) - [i13]Frank Kammer, Andrej Sajenko:
FPT-space Graph Kernelizations. CoRR abs/2007.11643 (2020)
2010 – 2019
- 2019
- [j9]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. Algorithmica 81(3): 1180-1204 (2019) - [j8]Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-efficient Euler partition and bipartite edge coloring. Theor. Comput. Sci. 754: 16-34 (2019) - [c22]Frank Kammer, Andrej Sajenko:
Linear-Time In-Place DFS and BFS on the Word RAM. CIAC 2019: 286-298 - [c21]Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner:
Two Moves per Time Step Make a Difference. ICALP 2019: 141:1-141:14 - [i12]Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Space-Efficient Vertex Separators for Treewidth. CoRR abs/1907.00676 (2019) - [i11]Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage Problems on a Global Budget. CoRR abs/1912.04392 (2019) - 2018
- [c20]Frank Kammer, Andrej Sajenko:
Simple 2^f-Color Choice Dictionaries. ISAAC 2018: 66:1-66:12 - [c19]Frank Kammer, Andrej Sajenko:
Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. MFCS 2018: 65:1-65:16 - [i10]Frank Kammer, Andrej Sajenko:
Linear-Time In-Place DFS and BFS in the Restore Model. CoRR abs/1803.04282 (2018) - [i9]Frank Kammer, Andrej Sajenko:
Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays. CoRR abs/1803.09675 (2018) - 2017
- [c18]Torben Hagerup, Frank Kammer, Moritz Laudahn:
Space-Efficient Euler Partition and Bipartite Edge Coloring. CIAC 2017: 322-333 - [c17]Torben Hagerup, Frank Kammer:
On-the-Fly Array Initialization in Less Space. ISAAC 2017: 44:1-44:12 - [i8]Torben Hagerup, Frank Kammer:
On-the-Fly Array Initialization in Less Space. CoRR abs/1709.10477 (2017) - 2016
- [j7]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613: 51-64 (2016) - [j6]Frank Kammer, Torsten Tholey:
Approximate tree decompositions of planar graphs in linear time. Theor. Comput. Sci. 645: 60-90 (2016) - [c16]Amr Elmasry, Frank Kammer:
Space-Efficient Plane-Sweep Algorithms. ISAAC 2016: 30:1-30:13 - [c15]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. MFCS 2016: 56:1-56:14 - [i7]Torben Hagerup, Frank Kammer:
Succinct Choice Dictionaries. CoRR abs/1604.06058 (2016) - [i6]Frank Kammer, Dieter Kratsch, Moritz Laudahn:
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. CoRR abs/1606.04679 (2016) - [i5]Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Space-Efficient Hidden Surface Removal. CoRR abs/1611.06915 (2016) - 2015
- [j5]Frank Kammer:
A linear-time kernelization for the Rooted k-Leaf Outbranching Problem. Discret. Appl. Math. 193: 126-138 (2015) - [c14]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. ICALP (1) 2015: 444-455 - [c13]Amr Elmasry, Torben Hagerup, Frank Kammer:
Space-efficient Basic Graph Algorithms. STACS 2015: 288-301 - [i4]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. CoRR abs/1504.07976 (2015) - [i3]Amr Elmasry, Frank Kammer:
Space-Efficient Plane-Sweep Algorithms. CoRR abs/1507.01767 (2015) - 2014
- [j4]Frank Kammer, Torsten Tholey:
Approximation Algorithms for Intersection Graphs. Algorithmica 68(2): 312-336 (2014) - [c12]Frank Kammer, Maarten Löffler, Paul Mutser, Frank Staals:
Practical Approaches to Partially Guarding a Polyhedral Terrain. GIScience 2014: 318-332 - [c11]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) 2014: 263-274 - 2013
- [c10]Frank Kammer:
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. WG 2013: 310-320 - 2012
- [b1]Frank Kammer:
Treelike and Chordal Graphs: Algorithms and Generalizations. University of Augsburg, 2012 - [j3]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Removing local extrema from imprecise terrains. Comput. Geom. 45(7): 334-349 (2012) - [j2]Frank Kammer, Torsten Tholey:
The complexity of minimum convex coloring. Discret. Appl. Math. 160(6): 810-833 (2012) - [c9]Frank Kammer, Torsten Tholey:
Approximate tree decompositions of planar graphs in linear time. SODA 2012: 683-698 - 2011
- [j1]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. 1(3): 213-225 (2011) - [c8]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: 194-206 - [c7]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196 - [i2]Frank Kammer, Torsten Tholey:
Approximate Tree Decompositions of Planar Graphs in Linear Time. CoRR abs/1104.2275 (2011) - 2010
- [c6]Frank Kammer, Torsten Tholey, Heiko Voepel:
Approximation Algorithms for Intersection Graphs. APPROX-RANDOM 2010: 260-273 - [i1]Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira:
Removing Local Extrema from Imprecise Terrains. CoRR abs/1002.2580 (2010)
2000 – 2009
- 2009
- [c5]Frank Kammer, Torsten Tholey:
The k-Disjoint Paths Problem on Chordal Graphs. WG 2009: 190-201 - 2008
- [c4]Frank Kammer, Torsten Tholey:
The Complexity of Minimum Convex Coloring. ISAAC 2008: 16-27 - 2007
- [c3]Frank Kammer:
Determining the Smallest k Such That G Is k -Outerplanar. ESA 2007: 359-370 - 2006
- [c2]Frank Kammer:
Simultaneous Embedding with Two Bends per Edge in Polynomial Area. SWAT 2006: 255-267 - 2004
- [c1]Frank Kammer, Hanjo Täubig:
Connectivity. Network Analysis 2004: 143-177
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
