Rooted minors and locally spanning subgraphs - Thomas Böhme; Jochen Harant; Matthias Kriesell; Samuel Mohr; Jens M. Schmidt (J. Graph Theory, 2024)

GraphLearner: An Approach to Sequence Recognition and Generation - T. G. Harrison; Thomas Böhme; Mario Kubek; Herwig Unger (IEEE International Conference on Big Data and Smart Computing, BigComp 2024, Bangkok, Thailand, February 18-21, 2024, 2024)

Horst Sachs (1927-2016) - Thomas Böhme; Jochen Harant; Matthias Kriesell; Michael Stiebitz (Discret. Math., 2017)

Spreading activation: a fast calculation method for text centroids - Mario M. Kubek; Thomas Böhme; Herwig Unger (Proceedings of the 3rd International Conference on Communication and Information Processing, ICCIP 2017, Tokyo, Japan, November 24-26, 2017, 2017)

PDSearch: Using Pictures as Queries - Panchalee Sukjit; Mario Kubek; Thomas Böhme; Herwig Unger (Recent Advances in Information and Communication Technology - Proceedings of the 10th International Conference on Computing and Information Technology, IC2IT 2014, Angsana Laguna, Phuket, Thailand, 8-9 May, 2014, 2014)

Bounds for the Security of the Vivaldi Network Coordinate System - Franz Girlich; Michael Rossberg; Guenter Schaefer; Thomas Böhme; Jens Schreyer (2013 Conference on Networked Systems, NetSys 2013, Stuttgart, Germany, March 11-15, 2013, 2013)

A Note on Semi-steady States in Stochastic Cellular Automata - Thomas Böhme; Jens Schreyer; Erika Skrabul'áková (Autonomous Systems: Developments and Trends, 2012)

Minors in Graphs with High Chromatic Number - Thomas Böhme; Alexandr V. Kostochka; Andrew Thomason (Comb. Probab. Comput., 2011)

Local Computation of Vertex Colorings - Thomas Böhme; Jens Schreyer (Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011, 2011)

Hadwiger numbers and over-dominating colourings - Thomas Böhme; Alexandr V. Kostochka; Andrew Thomason (Discret. Math., 2010)

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density - Thomas Böhme; Alexandr V. Kostochka (Discret. Math., 2009)

Learning of winning strategies for terminal games with linear-size memory - Thomas Böhme; Frank Göring; Zsolt Tuza; Herwig Unger (Int. J. Game Theory, 2009)

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] - Thomas Böhme; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

Linear connectivity forces large complete bipartite minors - Thomas Böhme; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

A Game Theoretic Approach to Graph Probleras - Thomas Böhme; Jens Schreyer (9th International Conference on Innovative Coummunity Systems, I\(^2\)CS 2009, June 15-17, 2009, Jena, Germany, 2009)

Ordered and linked chordal graphs - Thomas Böhme; Tobias Gerlach; Michael Stiebitz (Discuss. Math. Graph Theory, 2008)

Linkability in iterated line graphs - Thomas Böhme; Martin Knor; Ludovít Niepel (Discret. Math., 2006)

Innovative Internet Community Systems, 4th InternationalWorkshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004, Revised Papers - Thomas Böhme; Victor M. Larios-Rosillo; Helena Unger; Herwig Unger (Springer, 2006)

Innovative Internet Community Systems, 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005, Revised Papers - Alain Bui; Marc Bui; Thomas Böhme; Herwig Unger (Springer, 2006)

Disjoint K\(_r\)-minors in large graphs with given average degree - Thomas Böhme; Alexandr V. Kostochka (Eur. J. Comb., 2005)

Evaluating profiling and query expansion methods for P2P information retrieval - Hans Friedrich Witschel; Thomas Böhme (Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks, P2PIR '05, Bremen, Germany, November 4, 2005, 2005)

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs - Thomas Böhme; Bojan Mohar; Riste Skrekovski; Michael Stiebitz (J. Graph Theory, 2004)

Domination, Packing and Excluded Minors - Thomas Böhme; Bojan Mohar (Electron. J. Comb., 2003)

Innovative Internet Community Systems, Third International Workshop, IICS 2003, Leipzig, Germany, June 19-21, 2003, Revised Papers - Thomas Böhme; Gerhard Heyer; Herwig Unger (Springer, 2003)

Labeled K\(_2, t\) Minors in Plane Graphs - Thomas Böhme; Bojan Mohar (J. Comb. Theory B, 2002)

Long Cycles in Graphs on a Fixed Surface - Thomas Böhme; Bojan Mohar; Carsten Thomassen (J. Comb. Theory B, 2002)

K\(_a, k\) Minors in Graphs of Bounded Tree-Width - Thomas Böhme; John Maharry; Bojan Mohar (J. Comb. Theory B, 2002)

Innovative Internet Computing Systems, Second International Workshop, IICS 2002, Kühlungsborn, Germany, June 20-22, 2002, Proceedings - Herwig Unger; Thomas Böhme; Armin R. Mikler (Springer, 2002)

Menger's Theorem - Thomas Böhme; Frank Göring; Jochen Harant (J. Graph Theory, 2001)

Innovative Internet Computing Systems, International Workshop IICS 2001, Ilmenau, Germany, June 21-22, 2001, Proceedings - Thomas Böhme; Herwig Unger (Springer, 2001)

On certain Hamiltonian cycles in planar graphs - Thomas Böhme; Jochen Harant; Michal Tkác (J. Graph Theory, 1999)

Dirac's map-color theorem for choosability - Thomas Böhme; Bojan Mohar; Michael Stiebitz (J. Graph Theory, 1999)

More than one tough chordal planar graphs are Hamiltonian - Thomas Böhme; Jochen Harant; Michal Tkác (J. Graph Theory, 1999)

On Hamiltonian cycles in 4- and 5-connected plane triangulations - Thomas Böhme; Jochen Harant (Discret. Math., 1998)

A planarity criterion for cubic bipartite graphs - Thomas Böhme; Jochen Harant; Anja Pruchnewski; Ingo Schiermeyer (Discret. Math., 1998)

Spanning trees with pairwise nonadjacent endvertices - Thomas Böhme; Hajo Broersma; F. Göbel; Alexandr V. Kostochka; Michael Stiebitz (Discret. Math., 1997)

Toughness and longest cycles in 2-connected planar graphs - Thomas Böhme; Haitze J. Broersma; Henk Jan Veldman (J. Graph Theory, 1996)

Aspects of the Automatic Generation of Parallel Programs - Thomas Böhme; Herwig Unger (Parallel Computing: Trends and Applications, PARCO 1993, Grenoble, France, 1993)