Lehrstuhl für Informatik V - Frank Kammer  

Lehrstuhl für Theoretische Informatik


Dr. Frank Kammer

 Postal Address:
Dr. Frank Kammer
Lehrstuhl für Theoretische Informatik
Institut für Informatik
Universität Augsburg
D-86135 Augsburg

 House Address:
Raum 3070
Universitätsstr. 6a, 2. Stock
D-86159 Augsburg

 Telefon:
0049 - 821 - 598 - 2381

 Fax:
0049 - 821 - 598 - 2385

 Email:


 Research Interests:

            Graph Algorithms
            FPT Algorithms
            Tree Decompositions
            Planar Graphs
            MSO Logics
            Online Algorithms








  Conference Papers: The original publications of all LNCS Papers below are available at www.springerlink.com and the copyright is held by Springer.

2012
Networks
Frank Kammer and Torsten Tholey. Approximate Tree Decompositions of Planar Graphs in Linear Time. SODA 2012: 683-698. Abstract  
2011
Planar Dominating Set
Rene van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller. Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011, to appear. Abstract 
Sensor Cover
Thomas Erlebach, Tom Grant, and Frank Kammer. Maximising Lifetime for Fault-Tolerant Target Coverage in Sensor Networks SPAA 2011, p. 187-196. Abstract 
2010
Intersection Graphs
Frank Kammer, Torsten Tholey, and Heiko Vöpel. Approximation Algorithms for Intersection Graphs. Approx 2010, p. 260-273. AbstractIntersection
Graphs 
Imprecise Terrains
Chris Gray, Frank Kammer, Maarten Löffler, and Rodrigo I. Silveira. Removing Local Extrema from Imprecise Terrains. EuroCG 2010 and CoRR abs/1002.2580 (2010). AbstractImprecise Terrains
2009
DPP on Chordal Graphs
Frank Kammer and Torsten Tholey. The k-Disjoint Paths Problem on Chordal Graphs. WG 2009, p. 190-201. AbstractDPP on Chordal Graphs
2008
Convex Coloring
Frank Kammer and Torsten Tholey. The Complexity of Minimum Convex Coloring. ISAAC 2008, p. 16-27. AbstractConvex Coloring
2007
k-outerplanar
Frank Kammer. Determining the Smallest k Such That G is k-Outerplanar. ESA 2007, p. 359-370. Abstractk-outerplanar
2006
Simultaneous Embedding
Frank Kammer. Simultaneous Embedding with Two Bends per Edge in Polynomial Area. SWAT 2006, p. 255-267. AbstractSimultaneous Embedding


  Journals:

2012
Intersection Graphs
Frank Kammer, Torsten Tholey. Approximation Algorithms for Intersection Graphs. Algorithmica 2012.
Sensor Cover
Chris Gray, Frank Kammer, Maarten Löffler, and Rodrigo I. Silveira. Removing local extrema from imprecise terrains. Computational Geometry 2012.
Convex Coloring
Frank Kammer and Torsten Tholey. The Complexity of Minimum Convex Coloring. Discrete Applied Mathematics, vol. 160, p. 810-833, 2012.  
2011
Sensor Cover
Thomas Erlebach, Tom Grant, and Frank Kammer. Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustainable Computing 1(3): Informatics and Systems (2011), p. 213-225, doi:10.1016/j.suscom.2011.05.005.


  Thesis and Book Chapters:

2010
Thesis
Frank Kammer. Treelike and Chordal Graphs: Algorithms and Generalizations. k-outerplanar
2004
Networks
Frank Kammer and Hanjo Täubig. Connectivity. Network Analysis 2004, p. 143-177.


  Some Talks:

DPP on Chordal Graphs
My disputation (in german) at the University of Augsburg in 2010.
Disputation
DPP on Chordal Graphs
Talk given University of Bergen at their algorithms-seminar-series 2010.
Generalize from and to Chordal Graphs
DPP on Chordal Graphs
Talk given at the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Monpellier, France, June 24-26, 2009.
Talk DPP on Chordal Graphs
Convex Coloring
Talk given at the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, December 15-17, 2008.
Talk Convex Coloring
k-outerplanar
Talk given at the 15th Annual European Symposium on Algorithms (ESA 2007), Eilat, Israel, October 8-10, 2007.
Talk k-outerplanar


  Technical Reports and ArXiv.org Papers (not published at a conference or in a journal):

2009
Networks
Frank Kammer and Torsten Tholey. A Lower Bound for the Treewidth of k-Outerplanar Graphs. Uni Augsburg, Report 2009-7, 2009. treewidth of k-outer graphs
2004
Networks
Frank Kammer and Hanjo Täubig. Graph Connectivity. TU München, TUM-I0422, 2004. Graph Connectivity


  Teaching:

SS 13
Einführung in die Theoretische Informatik
Algorithmen für NP-harte Probleme (assistant to Prof. Dr. Torben Hagerup)
WS 12/13
Teile-und-Herrsche-Algorithmen
Informatik III (assistant to Prof. Dr. Torben Hagerup)
Algorithmische Geometrie (assistant to Prof. Dr. Torben Hagerup)
SS 12
Online Algorithmen (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Graphalgorithmen
WS 11/12
Teile-und-Herrsche-Algorithmen
SS 11
Datenstrukturen (assistant to Prof. Dr. Torben Hagerup)
I/O effiziente Algorithmen (assistant to Prof. Dr. Torben Hagerup)
Praktikum: NP-harte Graphprobleme
WS 10/11
Informatik III (assistant to Prof. Dr. Torben Hagerup)
Seminar über Algorithmen und Datenstrukturen (assistant to Prof. Dr. Torben Hagerup)
SS 10 (University of Leicester, Great Britain)
Mini Course on Tree Decompositions
SS 09
Online Algorithmen (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Zeichnen von Graphen
WS 08/09
Informatik III (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Implementierung von Graphenalgorithmen
SS 08
Datenstrukturen (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Implementierung von Graphenalgorithmen
WS 07/08
Informatik III (assistant to Prof. Dr. Torben Hagerup)
Algorithmische Geometrie (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Zeichnen von Graphen
SS 07
Algorithmen für NP-harte Probleme (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Visualisieren von Graphalgorithmen
WS 06/07
Informatik III (assistant to Prof. Dr. Walter Vogler)
Praktikum: Visualisieren von Graphalgorithmen
SS 06
Einführung in die Theoretische Informatik (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Zeichnen von Graphen
WS 05/06
Online Algorithmen (assistant to Prof. Dr. Torben Hagerup)
Praktikum: Zeichnen von Graphen
SS 05
Datenstrukturen (assistant to Prof. Dr. Torben Hagerup)
Einführung in die Komplexitätstheorie (assistant to Prof. Dr. Torben Hagerup)
WS 04/05
Informatik III (assistant to Prof. Dr. Torben Hagerup)
SS 04
Flüsse in Netzwerken (assistant to Prof. Dr. Torben Hagerup)
WS 03/04
Informatik III (assistant to Prof. Dr. Torben Hagerup)
Einführung in die Komplexitätstheorie (assistant to Prof. Dr. Torben Hagerup)


External links are selected and reviewed when they are added to my page. However, I'm not responsible for the content of external websites.