Thomas Böhme

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 4

Top Topics

Spreading Activation

Correct Recognition

Top Venues

J. Graph Theory

Publications

Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
Rooted minors and locally spanning subgraphs. J. Graph Theory 105 (2) (2024)
T. G. Harrison, Thomas Böhme, Mario Kubek, Herwig Unger
GraphLearner: An Approach to Sequence Recognition and Generation. BigComp (2024)
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
Horst Sachs (1927-2016). Discret. Math. 340 (11) (2017)
Mario M. Kubek, Thomas Böhme, Herwig Unger
Spreading activation: a fast calculation method for text centroids. ICCIP (2017)
Panchalee Sukjit, Mario Kubek, Thomas Böhme, Herwig Unger
PDSearch: Using Pictures as Queries. IC2IT (2014)
Franz Girlich, Michael Rossberg, Guenter Schaefer, Thomas Böhme, Jens Schreyer
Bounds for the Security of the Vivaldi Network Coordinate System. NetSys (2013)
Thomas Böhme, Jens Schreyer
Local Computation of Vertex Colorings. CTW (2011)
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
Minors in Graphs with High Chromatic Number. Comb. Probab. Comput. 20 (4) (2011)
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
Hadwiger numbers and over-dominating colourings. Discret. Math. 310 (20) (2010)
Thomas Böhme, Alexandr V. Kostochka
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. Discret. Math. 309 (4) (2009)
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) (2009)
Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
Linear connectivity forces large complete bipartite minors. J. Comb. Theory, Ser. B 99 (3) (2009)
Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger
Learning of winning strategies for terminal games with linear-size memory. Int. J. Game Theory 38 (2) (2009)
Thomas Böhme, Jens Schreyer
A Game Theoretic Approach to Graph Probleras. IICS (2009)
Thomas Böhme, Tobias Gerlach, Michael Stiebitz
Ordered and linked chordal graphs. Discuss. Math. Graph Theory 28 (2) (2008)
Thomas Böhme, Martin Knor, Ludovít Niepel
Linkability in iterated line graphs. Discret. Math. 306 (7) (2006)
Hans Friedrich Witschel, Thomas Böhme
Evaluating profiling and query expansion methods for P2P information retrieval. P2PIR@CIKM (2005)
Thomas Böhme, Alexandr V. Kostochka
-minors in large graphs with given average degree. Eur. J. Comb. 26 (3-4) (2005)
Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
-connected graphs. J. Graph Theory 45 (4) (2004)
Thomas Böhme, Bojan Mohar
Domination, Packing and Excluded Minors. Electron. J. Comb. 10 (2003)
Thomas Böhme, John Maharry, Bojan Mohar
Minors in Graphs of Bounded Tree-Width. J. Comb. Theory, Ser. B 86 (1) (2002)
Thomas Böhme, Bojan Mohar
Minors in Plane Graphs. J. Comb. Theory, Ser. B 84 (2) (2002)
Thomas Böhme, Bojan Mohar, Carsten Thomassen
Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 85 (2) (2002)
Thomas Böhme, Frank Göring, Jochen Harant
Menger's Theorem. J. Graph Theory 37 (1) (2001)
Thomas Böhme, Bojan Mohar, Michael Stiebitz
Dirac's map-color theorem for choosability. J. Graph Theory 32 (4) (1999)
Thomas Böhme, Jochen Harant, Michal Tkác
On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32 (1) (1999)
Thomas Böhme, Jochen Harant, Michal Tkác
More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32 (4) (1999)
Thomas Böhme, Jochen Harant
On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discret. Math. 191 (1-3) (1998)
Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
A planarity criterion for cubic bipartite graphs. Discret. Math. 191 (1-3) (1998)
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170 (1-3) (1997)
Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23 (3) (1996)
Thomas Böhme, Herwig Unger
Aspects of the Automatic Generation of Parallel Programs. PARCO (1993)