Thomas Böhme

Affiliations:
  • TU Ilmenau, Germany


According to our database1, Thomas Böhme authored at least 33 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Rooted minors and locally spanning subgraphs.
J. Graph Theory, February, 2024

GraphLearner: An Approach to Sequence Recognition and Generation.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2024

2017
Horst Sachs (1927-2016).
Discret. Math., 2017

Spreading activation: a fast calculation method for text centroids.
Proceedings of the 3rd International Conference on Communication and Information Processing, 2017

2014
PDSearch: Using Pictures as Queries.
Proceedings of the Recent Advances in Information and Communication Technology, 2014

2013
Bounds for the Security of the Vivaldi Network Coordinate System.
Proceedings of the 2013 Conference on Networked Systems, 2013

2012
A Note on Semi-steady States in Stochastic Cellular Automata.
Proceedings of the Autonomous Systems: Developments and Trends, 2012

2011
Minors in Graphs with High Chromatic Number.
Comb. Probab. Comput., 2011

Local Computation of Vertex Colorings.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Hadwiger numbers and over-dominating colourings.
Discret. Math., 2010

2009
Linear connectivity forces large complete bipartite minors.
J. Comb. Theory B, 2009

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

Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory, 2009

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.
Discret. Math., 2009

A Game Theoretic Approach to Graph Probleras.
Proceedings of the 9th International Conference on Innovative Coummunity Systems, 2009

2008
Ordered and linked chordal graphs.
Discuss. Math. Graph Theory, 2008

2006
Linkability in iterated line graphs.
Discret. Math., 2006

2005
Disjoint <i>K<sub>r</sub></i>-minors in large graphs with given average degree.
Eur. J. Comb., 2005

Evaluating profiling and query expansion methods for P2P information retrieval.
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks, 2005

2004
Subdivisions of large complete bipartite graphs and long induced paths in <i>k</i>-connected graphs.
J. Graph Theory, 2004

2003
Domination, Packing and Excluded Minors.
Electron. J. Comb., 2003

2002
Long Cycles in Graphs on a Fixed Surface.
J. Comb. Theory B, 2002

<i>K</i><sub>a, k</sub> Minors in Graphs of Bounded Tree-Width.
J. Comb. Theory B, 2002

Labeled <i>K</i><sub>2, t</sub> Minors in Plane Graphs.
J. Comb. Theory B, 2002

2001
Menger's Theorem.
J. Graph Theory, 2001

1999
Dirac's map-color theorem for choosability.
J. Graph Theory, 1999

More than one tough chordal planar graphs are Hamiltonian.
J. Graph Theory, 1999

On certain Hamiltonian cycles in planar graphs.
J. Graph Theory, 1999

1998
A planarity criterion for cubic bipartite graphs.
Discret. Math., 1998

On Hamiltonian cycles in 4- and 5-connected plane triangulations.
Discret. Math., 1998

1997
Spanning trees with pairwise nonadjacent endvertices.
Discret. Math., 1997

1996
Toughness and longest cycles in 2-connected planar graphs.
J. Graph Theory, 1996

1993
Aspects of the Automatic Generation of Parallel Programs.
Proceedings of the Parallel Computing: Trends and Applications, 1993


  Loading...