Suivre
Frank Kammer
Frank Kammer
Professor, THM - University of Appied Sciences Mittelhessen
Adresse e-mail validée de mni.thm.de
Titre
Citée par
Citée par
Année
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer
Journal of Computer and System Sciences 119, 1-18, 2021
1042021
Space-efficient basic graph algorithms
A Elmasry, T Hagerup, F Kammer
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
542015
Approximation algorithms for intersection graphs
F Kammer, T Tholey
Algorithmica 68 (2), 312-336, 2014
312014
Space-efficient biconnected components and recognition of outerplanar graphs
F Kammer, D Kratsch, M Laudahn
Algorithmica 81 (3), 1180-1204, 2019
292019
Connectivity
F Kammer, H Täubig
Network analysis, 143-177, 2005
282005
Query-competitive algorithms for cheapest set problems under uncertainty
T Erlebach, M Hoffmann, F Kammer
Theoretical Computer Science 613, 51-64, 2016
252016
Removing local extrema from imprecise terrains
C Gray, F Kammer, M Löffler, RI Silveira
Computational Geometry 45 (7), 334-349, 2012
232012
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
222007
Space-efficient Euler partition and bipartite edge coloring
T Hagerup, F Kammer, M Laudahn
Theoretical Computer Science 754, 16-34, 2019
212019
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
212011
Approximate tree decompositions of planar graphs in linear time
F Kammer, T Tholey
Theoretical Computer Science 645, 60-90, 2016
202016
Succinct choice dictionaries
T Hagerup, F Kammer
arXiv preprint arXiv:1604.06058, 2016
192016
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
182019
Linear-time computation of a linear problem kernel for dominating set on planar graphs
R Bevern, S Hartung, F Kammer, R Niedermeier, M Weller
International Symposium on Parameterized and Exact Computation, 194-206, 2011
182011
Simultaneous embedding with two bends per edge in polynomial area
F Kammer
Scandinavian Workshop on Algorithm Theory, 255-267, 2006
152006
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
132021
Graph connectivity
F Kammer, H Täubig
132004
Space-efficient plane-sweep algorithms
A Elmasry, F Kammer
arXiv preprint arXiv:1507.01767, 2015
122015
Practical approaches to partially guarding a polyhedral terrain
F Kammer, M Löffler, P Mutser, F Staals
International Conference on Geographic Information Science, 318-332, 2014
122014
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20