Aspects of the Automatic Generation of Parallel Programs. - Thomas Böhme 001; Herwig Unger (PARCO, 1993)

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

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

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

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

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

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

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

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

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

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

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

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

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

Evaluating profiling and query expansion methods for P2P information retrieval. - Hans Friedrich Witschel; Thomas Böhme 001 (P2PIR@CIKM, 2005)

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

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

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

A Game Theoretic Approach to Graph Probleras. - Thomas Böhme 001; Jens Schreyer (IICS, 2009)

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

Learning of winning strategies for terminal games with linear-size memory. - Thomas Böhme 001; 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 001; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

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

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

Local Computation of Vertex Colorings. - Thomas Böhme 001; Jens Schreyer (CTW, 2011)

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

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

Bounds for the Security of the Vivaldi Network Coordinate System. - Franz Girlich; Michael Rossberg; Guenter Schaefer; Thomas Böhme 001; Jens Schreyer (NetSys, 2013)

PDSearch: Using Pictures as Queries. - Panchalee Sukjit; Mario Kubek; Thomas Böhme 001; Herwig Unger (IC2IT, 2014)

Spreading activation: a fast calculation method for text centroids. - Mario M. Kubek; Thomas Böhme 001; Herwig Unger (ICCIP, 2017)

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

GraphLearner: An Approach to Sequence Recognition and Generation. - T. G. Harrison; Thomas Böhme 001; Mario Kubek; Herwig Unger (BigComp, 2024)

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

On Self-Improving Token Embeddings. - Mario M. Kubek; Shiraj Pokharel; Thomas Böhme 001; Emma Louise McDaniel; Herwig Unger; Armin R. Mikler (I4CS, 2025)