Frank Kammer

	2012
13		Frank Kammer, Torsten Tholey: Approximate tree decompositions of planar graphs in linear time. SODA 2012: 683-698
12		Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira: Removing local extrema from imprecise terrains. Comput. Geom. 45(7): 334-349 (2012)
11		Frank Kammer, Torsten Tholey: The complexity of minimum convex coloring. Discrete Applied Mathematics 160(6): 810-833 (2012)
	2011
10		René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller: Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. IPEC 2011: 194-206
9		Thomas Erlebach, Tom Grant, Frank Kammer: Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196
8		Frank Kammer, Torsten Tholey: Approximate Tree Decompositions of Planar Graphs in Linear Time CoRR abs/1104.2275: (2011)
	2010
7		Frank Kammer, Torsten Tholey, Heiko Voepel: Approximation Algorithms for Intersection Graphs. APPROX-RANDOM 2010: 260-273
6		Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira: Removing Local Extrema from Imprecise Terrains CoRR abs/1002.2580: (2010)
	2009
5		Frank Kammer, Torsten Tholey: The k-Disjoint Paths Problem on Chordal Graphs. WG 2009: 190-201
	2008
4		Frank Kammer, Torsten Tholey: The Complexity of Minimum Convex Coloring. ISAAC 2008: 16-27
	2007
3		Frank Kammer: Determining the Smallest k Such That G Is k -Outerplanar. ESA 2007: 359-370
	2006
2		Frank Kammer: Simultaneous Embedding with Two Bends per Edge in Polynomial Area. SWAT 2006: 255-267
	2004
1		Frank Kammer, Hanjo Täubig: Connectivity. Network Analysis 2004: 143-177

Coauthor Index

1	René van Bevern	[10]
2	Thomas Erlebach	[9]
3	Tom Grant	[9]
4	Chris Gray	[6] [12]
5	Sepp Hartung	[10]
6	Maarten Löffler	[6] [12]
7	Rolf Niedermeier	[10]
8	Rodrigo I. Silveira	[6] [12]
9	Hanjo Täubig	[1]
10	Torsten Tholey	[4] [5] [7] [8] [11] [13]
11	Heiko Voepel	[7]
12	Mathias Weller	[10]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page