Thomas Böhme

发表

Innovative internet computing systems : Second International Workshop IICS 2002, Kühlungsborn, Germany, June 20-22, 2002 : proceedings

Armin R. Mikler, Herwig Unger, Thomas Böhme, 2002 .

Aspects of the Automatic Generation of Parallel Programs

Thomas Böhme, Herwig Unger, 1993, PARCO.

Ordered and linked chordal graphs

Michael Stiebitz, Thomas Böhme, Tobias Gerlach, 2008, Discuss. Math. Graph Theory.

Minors in Graphs with High Chromatic Number

Alexandr V. Kostochka, Andrew Thomason, Thomas Böhme, 2011, Comb. Probab. Comput..

Bounds for the Security of the Vivaldi Network Coordinate System

Günter Schäfer, Thomas Böhme, Michael Roßberg, 2013, 2013 Conference on Networked Systems.

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]

Ken-ichi Kawarabayashi, Thomas Böhme, Bojan Mohar, 2009, J. Comb. Theory, Ser. B.

PDSearch: Using Pictures as Queries

Thomas Böhme, Herwig Unger, Mario Kubek, 2014, IC2IT.

A planarity criterion for cubic bipartite graphs

Jochen Harant, Thomas Böhme, Ingo Schiermeyer, 1998, Discret. Math..

Dirac's map-color theorem for choosability

Michael Stiebitz, Thomas Böhme, Bojan Mohar, 1999, J. Graph Theory.

Proceedings of the Second International Workshop on Innovative Internet Computing Systems

Armin R. Mikler, Herwig Unger, Thomas Böhme, 2001 .

Labeled K2, t Minors in Plane Graphs

Thomas Böhme, Bojan Mohar, 2002, J. Comb. Theory, Ser. B.

Domination, Packing and Excluded Minors

Thomas Böhme, Bojan Mohar, 2003, Electron. J. Comb..

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

Michael Stiebitz, Thomas Böhme, Bojan Mohar, 2004, J. Graph Theory.

Linear connectivity forces large complete bipartite minors

Ken-ichi Kawarabayashi, Thomas Böhme, Bojan Mohar, 2009, J. Comb. Theory, Ser. B.

Innovative Internet Community Systems, 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005, Revised Papers

Alain Bui, Thomas Böhme, Herwig Unger, 2006, IICS.

Simulation of Search and Distribution Methods for Jobs in a WEB Operating System (WOS)

Herwig Unger, Thomas Böhme, Gilbert Babin, 1998 .

Spanning trees with pairwise nonadjacent endvertices

Alexandr V. Kostochka, Michael Stiebitz, Thomas Böhme, 1997, Discret. Math..

Innovative internet computing systems : International Workshop IICS 2001, Ilmenau, Germany, June 21-22, 2001 : proceedings

Herwig Unger, Thomas Böhme, 2001 .

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density

Alexandr V. Kostochka, Thomas Böhme, A. Kostochka, 2009, Discret. Math..

A Game Theoretic Approach to Graph Probleras

Thomas Böhme, Jens Schreyer, 2009, IICS.

On certain Hamiltonian cycles in planar graphs

Jochen Harant, Thomas Böhme, Michal Tkác, 1999, J. Graph Theory.

Long Cycles in Graphs on a Fixed Surface

Thomas Böhme, Carsten Thomassen, Bojan Mohar, 2002, J. Comb. Theory, Ser. B.

Spreading activation: a fast calculation method for text centroids

Thomas Böhme, Mario M. Kubek, Herwig Unger, 2017, ICCIP '17.

Ka, k Minors in Graphs of Bounded Tree-Width

Thomas Böhme, Bojan Mohar, John Maharry, 2002, J. Comb. Theory, Ser. B.

On Hamiltonian cycles in 4- and 5-connected plane triangulations

Jochen Harant, Thomas Böhme, 1998, Discret. Math..

Learning of winning strategies for terminal games with linear-size memory

Zsolt Tuza, Thomas Böhme, Herwig Unger, 2009, Int. J. Game Theory.

Disjoint Kr-minors in large graphs with given average degree

Alexandr V. Kostochka, Thomas Böhme, A. Kostochka, 2005, Eur. J. Comb..

Empiric Experiments with Text Representing Centroids

Herwig Unger, Thomas Böhme, Mario Kubek, 2017 .

Menger's Theorem

Jochen Harant, Thomas Böhme, Frank Göring, 2001, J. Graph Theory.

Innovative Internet Community Systems: 4th International Workshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004. Revised Papers (Lecture Notes in Computer Science)

Thomas Böhme, Herwig Unger, Helena Unger, 2006 .

More than one tough chordal planar graphs are Hamiltonian

Jochen Harant, Thomas Böhme, Michal Tkác, 1999, J. Graph Theory.

A Note on Semi-steady States in Stochastic Cellular Automata

Thomas Böhme, Jens Schreyer, Erika Skrabul'áková, 2012, Autonomous Systems: Developments and Trends.

Toughness and longest cycles in 2-connected planar graphs

Thomas Böhme, Henk Jan Veldman, Haitze J. Broersma, 1996, J. Graph Theory.

Hadwiger numbers and over-dominating colourings

Alexandr V. Kostochka, Andrew Thomason, Thomas Böhme, 2010, Discret. Math..

Innovative Internet Community Systems: Third International Workshop, IICS 2003, Leipzig, Germany, June 19-21, 2003, Revised Papers

Herwig Unger, Thomas Böhme, Gerhard Heyer, 2003 .

Publisher's Note: Linear connectivity forces large complete bipartite minors

Ken-ichi Kawarabayashi, Thomas Böhme, Bojan Mohar, 2009 .

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

Michael Stiebitz, Thomas Böhme, Bojan Mohar, 2004 .

Dirac's map-color theorem for choosability

Michael Stiebitz, Thomas Böhme, Bojan Mohar, 1999 .

More than one tough chordal planar graphs are Hamiltonian

Jochen Harant, Thomas Böhme, Michal Tkáč, 1999 .

A note on spanning trees with pairwise nonadjacent end-vertices

Alexandr V. Kostochka, Michael Stiebitz, Thomas Böhme, 1995 .

The Benefits and Challenges of Providing Content Protection in Peer-to-Peer Systems

Mark Strembeck, Sandro Etalle, Mostafa Ammar, 2022 .

Menger's Theorem

Jochen Harant, Thomas Böhme, Frank Göring, 2001 .

On certain Hamiltonian cycles in planar graphs

Jochen Harant, Thomas Böhme, Michal Tkáč, 1999 .