Thomas Böhme

39 papers C 2Journal 24Unranked 7
YearRankTypeTitle / Venue / Authors
2025 C conf
On Self-Improving Token Embeddings.
I4CS
Mario M. Kubek, Shiraj Pokharel, Thomas Böhme, Emma Louise McDaniel, Herwig Unger, Armin R. Mikler
2025 J jnl
On Self-improving Token Embeddings.
CoRR
Mario M. Kubek, Shiraj Pokharel, Thomas Böhme, Emma Louise McDaniel, Herwig Unger, Armin R. Mikler
2024 — conf
GraphLearner: An Approach to Sequence Recognition and Generation.
BigComp
T. G. Harrison, Thomas Böhme, Mario Kubek, Herwig Unger
2024 J jnl
Rooted minors and locally spanning subgraphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
2017 J jnl
Horst Sachs (1927-2016).
Discret. Math.
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
2017 — conf
Spreading activation: a fast calculation method for text centroids.
ICCIP
Mario M. Kubek, Thomas Böhme, Herwig Unger
2014 — conf
PDSearch: Using Pictures as Queries.
IC2IT
Panchalee Sukjit, Mario Kubek, Thomas Böhme, Herwig Unger
2013 — conf
Bounds for the Security of the Vivaldi Network Coordinate System.
NetSys
Franz Girlich, Michael Rossberg, Guenter Schaefer, Thomas Böhme, Jens Schreyer
2012 — ch.
A Note on Semi-steady States in Stochastic Cellular Automata.
Autonomous Systems: Developments and Trends
Thomas Böhme, Jens Schreyer, Erika Skrabul'áková
2011 C conf
Local Computation of Vertex Colorings.
CTW
Thomas Böhme, Jens Schreyer
2011 J jnl
Minors in Graphs with High Chromatic Number.
Comb. Probab. Comput.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2010 J jnl
Hadwiger numbers and over-dominating colourings.
Discret. Math.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2009 — conf
A Game Theoretic Approach to Graph Probleras.
IICS
Thomas Böhme, Jens Schreyer
2009 J jnl
Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory
Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger
2009 J jnl
Linear connectivity forces large complete bipartite minors.
J. Comb. Theory B
Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009 J jnl
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]
J. Comb. Theory B
Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009 J jnl
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.
Discret. Math.
Thomas Böhme, Alexandr V. Kostochka
2008 J jnl
Ordered and linked chordal graphs.
Discuss. Math. Graph Theory
Thomas Böhme, Tobias Gerlach, Michael Stiebitz
2006 — ed.
Innovative Internet Community Systems, 4th InternationalWorkshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004, Revised Papers
IICS
Thomas Böhme, Victor M. Larios-Rosillo, Helena Unger, Herwig Unger
2006 — ed.
Innovative Internet Community Systems, 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005, Revised Papers
IICS
Alain Bui, Marc Bui, Thomas Böhme, Herwig Unger
2006 J jnl
Linkability in iterated line graphs.
Discret. Math.
Thomas Böhme, Martin Knor, Ludovít Niepel
2005 J jnl
Disjoint
Eur. J. Comb.
Thomas Böhme, Alexandr V. Kostochka
2005 — conf
Evaluating profiling and query expansion methods for P2P information retrieval.
P2PIR@CIKM
Hans Friedrich Witschel, Thomas Böhme
2004 J jnl
Subdivisions of large complete bipartite graphs and long induced paths in
J. Graph Theory
Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
2003 J jnl
Domination, Packing and Excluded Minors.
Electron. J. Comb.
Thomas Böhme, Bojan Mohar
2003 — ed.
Innovative Internet Community Systems, Third International Workshop, IICS 2003, Leipzig, Germany, June 19-21, 2003, Revised Papers
IICS
Thomas Böhme, Gerhard Heyer, Herwig Unger
2002 — ed.
Innovative Internet Computing Systems, Second International Workshop, IICS 2002, Kühlungsborn, Germany, June 20-22, 2002, Proceedings
IICS
Herwig Unger, Thomas Böhme, Armin R. Mikler
2002 J jnl
Labeled
J. Comb. Theory B
Thomas Böhme, Bojan Mohar
2002 J jnl
Long Cycles in Graphs on a Fixed Surface.
J. Comb. Theory B
Thomas Böhme, Bojan Mohar, Carsten Thomassen
2001 — ed.
Innovative Internet Computing Systems, International Workshop IICS 2001, Ilmenau, Germany, June 21-22, 2001, Proceedings
IICS
Thomas Böhme, Herwig Unger
2001 J jnl
Menger's Theorem.
J. Graph Theory
Thomas Böhme, Frank Göring, Jochen Harant
1999 J jnl
Dirac's map-color theorem for choosability.
J. Graph Theory
Thomas Böhme, Bojan Mohar, Michael Stiebitz
1999 J jnl
More than one tough chordal planar graphs are Hamiltonian.
J. Graph Theory
Thomas Böhme, Jochen Harant, Michal Tkác
1999 J jnl
On certain Hamiltonian cycles in planar graphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Michal Tkác
1998 J jnl
A planarity criterion for cubic bipartite graphs.
Discret. Math.
Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
1998 J jnl
On Hamiltonian cycles in 4- and 5-connected plane triangulations.
Discret. Math.
Thomas Böhme, Jochen Harant
1997 J jnl
Spanning trees with pairwise nonadjacent endvertices.
Discret. Math.
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
1996 J jnl
Toughness and longest cycles in 2-connected planar graphs.
J. Graph Theory
Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
1993 — conf
Aspects of the Automatic Generation of Parallel Programs.
PARCO
Thomas Böhme, Herwig Unger