Follow
Frank Kammer
Frank Kammer
Professor, THM - University of Appied Sciences Mittelhessen
Verified email at mni.thm.de
Title
Cited by
Cited by
Year
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer
Journal of Computer and System Sciences 119, 1-18, 2021
1332021
Space-efficient basic graph algorithms
A Elmasry, T Hagerup, F Kammer
582015
Approximation algorithms for intersection graphs
F Kammer, T Tholey
Algorithmica 68, 312-336, 2014
402014
Query-competitive algorithms for cheapest set problems under uncertainty
T Erlebach, M Hoffmann, F Kammer
Theoretical Computer Science 613, 51-64, 2016
322016
Space-efficient biconnected components and recognition of outerplanar graphs
F Kammer, D Kratsch, M Laudahn
Algorithmica 81, 1180-1204, 2019
312019
Connectivity
F Kammer, H Täubig
Network Analysis: Methodological Foundations, 143-177, 2005
292005
Approximate tree decompositions of planar graphs in linear time
F Kammer, T Tholey
Theoretical Computer Science 645, 60-90, 2016
28*2016
Determining the Smallest k Such That G Is k-Outerplanar
F Kammer
Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007
272007
Succinct choice dictionaries
T Hagerup, F Kammer
arXiv preprint arXiv:1604.06058, 2016
262016
Removing local extrema from imprecise terrains
C Gray, F Kammer, M Löffler, RI Silveira
Computational Geometry 45 (7), 334-349, 2012
262012
Two moves per time step make a difference
T Erlebach, F Kammer, K Luo, A Sajenko, JT Spooner
46th International Colloquium on Automata, Languages, and Programming, ICALP …, 2019
252019
The complexity of minimum convex coloring
F Kammer, T Tholey
Discrete Applied Mathematics 160 (6), 810-833, 2012
232012
Maximising lifetime for fault-tolerant target coverage in sensor networks
T Erlebach, T Grant, F Kammer
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
222011
Space-efficient Euler partition and bipartite edge coloring
T Hagerup, F Kammer, M Laudahn
Theoretical Computer Science 754, 16-34, 2019
212019
Linear-time computation of a linear problem kernel for dominating set on planar graphs
R Van Bevern, S Hartung, F Kammer, R Niedermeier, M Weller
Parameterized and Exact Computation: 6th International Symposium, IPEC 2011 …, 2012
182012
Multistage graph problems on a global budget
K Heeger, AS Himmel, F Kammer, R Niedermeier, M Renken, A Sajenko
Theoretical Computer Science 868, 46-64, 2021
162021
Simultaneous embedding with two bends per edge in polynomial area
F Kammer
Algorithm Theory–SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory …, 2006
152006
Graph connectivity
F Kammer, H Täubig
152004
Practical approaches to partially guarding a polyhedral terrain
F Kammer, M Löffler, P Mutser, F Staals
Geographic Information Science: 8th International Conference, GIScience 2014 …, 2014
142014
The k-disjoint paths problem on chordal graphs
F Kammer, T Tholey
International Workshop on Graph-Theoretic Concepts in Computer Science, 190-201, 2009
142009
The system can't perform the operation now. Try again later.
Articles 1–20