Frank Kammer
Frank Kammer
Professor, THM - University of Appied Sciences Mittelhessen
Bestätigte E-Mail-Adresse bei mni.thm.de
Titel
Zitiert von
Zitiert von
Jahr
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer
International Colloquium on Automata, Languages, and Programming, 444-455, 2015
592015
Space-efficient basic graph algorithms
A Elmasry, T Hagerup, F Kammer
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
392015
Space-efficient biconnected components and recognition of outerplanar graphs
F Kammer, D Kratsch, M Laudahn
Algorithmica 81 (3), 1180-1204, 2019
252019
Approximation algorithms for intersection graphs
F Kammer, T Tholey
Algorithmica 68 (2), 312-336, 2014
252014
Connectivity
F Kammer, H Täubig
Network analysis, 143-177, 2005
242005
Succinct choice dictionaries
T Hagerup, F Kammer
arXiv preprint arXiv:1604.06058, 2016
222016
The complexity of minimum convex coloring
F Kammer, T Tholey
Discrete Applied Mathematics 160 (6), 810-833, 2012
222012
Determining the Smallest k Such That G Is k-Outerplanar
F Kammer
European Symposium on Algorithms, 359-370, 2007
202007
Approximate tree decompositions of planar graphs in linear time
F Kammer, T Tholey
Theoretical Computer Science 645, 60-90, 2016
192016
Maximising lifetime for fault-tolerant target coverage in sensor networks
T Erlebach, T Grant, F Kammer
Sustainable Computing: Informatics and Systems 1 (3), 213-225, 2011
192011
Query-competitive algorithms for cheapest set problems under uncertainty
T Erlebach, M Hoffmann, F Kammer
Theoretical Computer Science 613, 51-64, 2016
182016
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
International Symposium on Parameterized and Exact Computation, 194-206, 2011
182011
Removing local extrema from imprecise terrains
C Gray, F Kammer, M Löffler, RI Silveira
Computational Geometry 45 (7), 334-349, 2012
172012
Space-efficient Euler partition and bipartite edge coloring
T Hagerup, F Kammer, M Laudahn
Theoretical Computer Science 754, 16-34, 2019
162019
Simultaneous embedding with two bends per edge in polynomial area
F Kammer
Scandinavian Workshop on Algorithm Theory, 255-267, 2006
142006
The k-disjoint paths problem on chordal graphs
F Kammer, T Tholey
International Workshop on Graph-Theoretic Concepts in Computer Science, 190-201, 2009
122009
Graph connectivity
F Kammer, H Täubig
122004
Approximation algorithms for intersection graphs
F Kammer, T Tholey, H Voepel
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010
112010
Space-efficient plane-sweep algorithms
A Elmasry, F Kammer
arXiv preprint arXiv:1507.01767, 2015
102015
The complexity of minimum convex coloring
F Kammer, T Tholey
International Symposium on Algorithms and Computation, 16-27, 2008
102008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20