Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="B{\"o}hme, Thomas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear connectivity forces large complete bipartite minors
Thomas Böhme
,
Ken-ichi Kawarabayashi
,
John Maharry
,
Bojan Mohar
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 557-582
Subdivisions of large complete bipartite graphs and long induced paths in
k
-connected graphs
Thomas Böhme
,
Bojan Mohar
,
Riste S̑krekovski
,
Michael Stiebitz
Journal of Graph Theory
45
(4), 2004, pp. 270-274
K_{a,k}
minors in graphs of bounded tree-width
Thomas Böhme
,
John Maharry
,
Bojan Mohar
Journal of Combinatorial Theory Series B
86
(1), 2002, pp. 133-147
Long cycles in graphs on a fixed surface
Thomas Böhme
,
Bojan Mohar
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 338-347
Labeled
K_{2,t}
minors in plane graphs
Thomas Böhme
,
Bojan Mohar
Journal of Combinatorial Theory Series B
84
(2), 2002, pp. 291-300
More than one tough chordal planar graphs are Hamiltonian
Thomas Böhme
,
Jochen Harant
,
Michal Tkác̑
Journal of Graph Theory
32
(4), 1999, pp. 405-410
A decentral, adaptive load sharing approach for workstation clusters using fuzzy logic
Thomas Böhme
,
Herwig Unger
Workshop Anwendungsbezogene Lastverteilung, ALV'98 (München, Germany, March 25-26, 1998) (TUM-I9806), 1998, pp. 33-40