Thomas Böhme

	2009
18		Thomas Böhme, Jens Schreyer: A Game Theoretic Approach to Graph Probleras. IICS 2009: 149-156
17		Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar: Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] J. Comb. Theory, Ser. B 99(2): 323 (2009)
	2006
16		Thomas Böhme, Victor Larios-Rosillo, Helena Unger, Herwig Unger: Innovative Internet Community Systems, 4th InternationalWorkshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004, Revised Papers Springer 2006
15		Alain Bui, Marc Bui, Thomas Böhme, Herwig Unger: Innovative Internet Community Systems, 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005, Revised Papers Springer 2006
14		Thomas Böhme, Martin Knor, Ludovít Niepel: Linkability in iterated line graphs. Discrete Mathematics 306(7): 666-669 (2006)
	2005
13		Thomas Böhme, Alexandr V. Kostochka: Disjoint Kr-minors in large graphs with given average degree. Eur. J. Comb. 26(3-4): 289-292 (2005)
	2004
12		Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz: Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. Journal of Graph Theory 45(4): 270-274 (2004)
	2003
11		Thomas Böhme, Gerhard Heyer, Herwig Unger: Innovative Internet Community Systems, Third International Workshop, IICS 2003, Leipzig, Germany, June 19-21, 2003, Revised Papers Springer 2003
10		Thomas Böhme, Bojan Mohar: Domination, Packing and Excluded Minors. Electr. J. Comb. 10: (2003)
	2002
9		Herwig Unger, Thomas Böhme, Armin R. Mikler: Innovative Internet Computing Systems, Second International Workshop, IICS 2002, Kühlungsborn, Germany, June 20-22, 2002, Proceedings Springer 2002
8		Thomas Böhme, Bojan Mohar: Labeled K2, t Minors in Plane Graphs. J. Comb. Theory, Ser. B 84(2): 291-300 (2002)
7		Thomas Böhme, Bojan Mohar, Carsten Thomassen: Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 85(2): 338-347 (2002)
6		Thomas Böhme, John Maharry, Bojan Mohar: Ka, k Minors in Graphs of Bounded Tree-Width. J. Comb. Theory, Ser. B 86(1): 133-147 (2002)
	2001
5		Thomas Böhme, Herwig Unger: Innovative Internet Computing Systems, International Workshop IICS 2001, Ilmenau, Germany, June 21-22, 2001, Proceedings Springer 2001
	1998
4		Thomas Böhme, Jochen Harant: On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discrete Mathematics 191(1-3): 25-30 (1998)
3		Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer: A planarity criterion for cubic bipartite graphs. Discrete Mathematics 191(1-3): 31-43 (1998)
	1997
2		Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz: Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics 170(1-3): 219-222 (1997)
	1993
1		Thomas Böhme, Herwig Unger: Aspects of the Automatic Generation of Parallel Programs. PARCO 1993: 573-576

Coauthor Index

1	Hajo Broersma (H. J. Broersma)	[2]
2	Alain Bui	[15]
3	Marc Bui	[15]
4	F. Göbel	[2]
5	Jochen Harant	[3] [4]
6	Gerhard Heyer	[11]
7	Ken-ichi Kawarabayashi	[17]
8	Martin Knor	[14]
9	Alexandr V. Kostochka	[2] [13]
10	Victor Larios-Rosillo	[16]
11	John Maharry	[6] [17]
12	Armin R. Mikler	[9]
13	Bojan Mohar	[6] [7] [8] [10] [12] [17]
14	Ludovít Niepel	[14]
15	Anja Pruchnewski	[3]
16	Ingo Schiermeyer	[3]
17	Jens Schreyer	[18]
18	Riste Skrekovski	[12]
19	Michael Stiebitz	[2] [12]
20	Carsten Thomassen	[7]
21	Helena Unger	[16]
22	Herwig Unger	[1] [5] [9] [11] [15] [16]

Colors in the list of coauthors