Frank Kammer

Citata da

	Tutte	Dal 2020
Citazioni	763	366
Indice H	16	9
i10-index	25	9

100

200920102011201220132014201520162017201820192020202120222023202420252 8 13 22 25 25 34 56 34 99 66 69 50 73 78 65 28

Accesso pubblico

Visualizza tutto

9 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Andrej SajenkoTHM, University of Applied Sciences Mittelhessen, GermanyEmail verificata su mni.thm.de
Thomas ErlebachProfessor, Department of Computer Science, Durham UniversityEmail verificata su durham.ac.uk
Johannes MeintrupUniversity of Applied Sciences MittelhessenEmail verificata su mni.thm.de
Markus SiepermannProfessor, Technische Hochschule MittelhessenEmail verificata su tu-dortmund.de
Maarten LöfflerComputer Science, Utrecht UniversityEmail verificata su cs.uu.nl
Amr ElmasryProfessor, Egypt University of Informatics and Alexandria UniversityEmail verificata su eui.edu.eg
Hanjo TäubigTechnische Universität MünchenEmail verificata su in.tum.de
Rolf NiedermeierTU BerlinEmail verificata su tu-berlin.de
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaEmail verificata su upc.edu
Dieter Kratschprofesseur d'informatique, Universite de LorraineEmail verificata su univ-lorraine.fr
René van BevernHuawei Technologies Co., Ltd.Email verificata su huawei.com
Sepp HartungEmail verificata su tu-berlin.de
Mathias WellerLIGM, Paris, FranceEmail verificata su u-pem.fr
Manuel PenschuckGoethe University FrankfurtEmail verificata su ae.cs.uni-frankfurt.de
Ulrich MeyerProfessor of Algorithm Engineering, Goethe University FrankfurtEmail verificata su cs.uni-frankfurt.de
Holger DellGoethe University FrankfurtEmail verificata su uni-frankfurt.de

Segui

Frank Kammer

Professor, THM - University of Appied Sciences Mittelhessen

Email verificata su mni.thm.de

Graph Algorithms FPT Algorithms Tree Decompositions Planar Graphs Space-Efficient Algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
On temporal graph exploration T Erlebach, M Hoffmann, F Kammer Journal of Computer and System Sciences 119, 1-18, 2021	152	2021
Space-efficient basic graph algorithms A Elmasry, T Hagerup, F Kammer	57	2015
Approximation algorithms for intersection graphs F Kammer, T Tholey Algorithmica 68, 312-336, 2014	40	2014
Space-efficient biconnected components and recognition of outerplanar graphs F Kammer, D Kratsch, M Laudahn Algorithmica 81, 1180-1204, 2019	32	2019
Query-competitive algorithms for cheapest set problems under uncertainty T Erlebach, M Hoffmann, F Kammer International Symposium on Mathematical Foundations of Computer Science, 263-274, 2014	32	2014
Determining the Smallest k Such That G Is k-Outerplanar F Kammer Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007	32	2007
Connectivity F Kammer, H Täubig Network Analysis: Methodological Foundations, 143-177, 2005	30	2005
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	29	2019
Approximate tree decompositions of planar graphs in linear time F Kammer, T Tholey Theoretical Computer Science 645, 60-90, 2016	29*	2016
Removing local extrema from imprecise terrains C Gray, F Kammer, M Löffler, RI Silveira Computational Geometry 45 (7), 334-349, 2012	29	2012
Succinct choice dictionaries T Hagerup, F Kammer arXiv preprint arXiv:1604.06058, 2016	25	2016
The complexity of minimum convex coloring F Kammer, T Tholey Discrete Applied Mathematics 160 (6), 810-833, 2012	24	2012
Space-efficient Euler partition and bipartite edge coloring T Hagerup, F Kammer, M Laudahn Theoretical Computer Science 754, 16-34, 2019	22	2019
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	22	2011
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	18	2021
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	18	2011
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	14	2014
The k-disjoint paths problem on chordal graphs F Kammer, T Tholey International Workshop on Graph-Theoretic Concepts in Computer Science, 190-201, 2009	14	2009
Simultaneous embedding with two bends per edge in polynomial area F Kammer Algorithm Theory–SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory …, 2006	14	2006
Graph connectivity F Kammer, H Täubig	14	2004

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori