Thomas Böhme - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2014

PDSearch: Using Pictures as QueriesPanchalee Sukjit, Mario Kubek, Thomas Böhme, Herwig Unger. ic2it 2014: 255-262 [doi]

2013

Bounds for the Security of the Vivaldi Network Coordinate SystemFranz Girlich, Michael Rossberg, Guenter Schaefer, Thomas Böhme, Jens Schreyer. kivs 2013: 66-75 [doi]

2012

A Note on Semi-steady States in Stochastic Cellular AutomataThomas Böhme, Jens Schreyer, Erika Skrabul'áková. In Herwig Unger, Kyandoghere Kyamakya, Janusz Kacprzyk, editors, Autonomous Systems: Developments and Trends. Volume 391 of Studies in Computational Intelligence, pages 313-323, Springer, 2012. [doi]

2011

Local Computation of Vertex ColoringsThomas Böhme, Jens Schreyer. colognetwente 2011: 76-79 [doi]

Minors in Graphs with High Chromatic NumberThomas Böhme, Alexandr V. Kostochka, Andrew Thomason. cpc, 20(4):513-518, 2011. [doi]

2010

Hadwiger numbers and over-dominating colouringsThomas Böhme, Alexandr V. Kostochka, Andrew Thomason. DM, 310(20):2662-2665, 2010. [doi]

2009

Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge densityThomas Böhme, Alexandr V. Kostochka. DM, 309(4):997-1000, 2009. [doi]

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. JCT, 99(2):323, 2009. [doi]

Learning of winning strategies for terminal games with linear-size memoryThomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger. ijgt, 38(2):155-168, 2009. [doi]

2008

Ordered and linked chordal graphsThomas Böhme, Tobias Gerlach, Michael Stiebitz. dmgt, 28(2):367-373, 2008. [doi]

2006

Linkability in iterated line graphsThomas Böhme, Martin Knor, Ludovít Niepel. DM, 306(7):666-669, 2006. [doi]

2004

Subdivisions of large complete bipartite graphs and long induced paths in ::::k::::-connected graphsThomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz. jgt, 45(4):270-274, 2004. [doi]

2003

Domination, Packing and Excluded MinorsThomas Böhme, Bojan Mohar. combinatorics, 10, 2003. [doi]

2002

Long Cycles in Graphs on a Fixed SurfaceThomas Böhme, Bojan Mohar, Carsten Thomassen. JCT, 85(2):338-347, 2002. [doi]

::::K::::::a, k:: Minors in Graphs of Bounded Tree-WidthThomas Böhme, John Maharry, Bojan Mohar. JCT, 86(1):133-147, 2002. [doi]

Labeled ::::K::::::2, t:: Minors in Plane GraphsThomas Böhme, Bojan Mohar. JCT, 84(2):291-300, 2002. [doi]

2001

Menger's TheoremThomas Böhme, Frank Göring, Jochen Harant. jgt, 37(1):35-36, 2001. [doi]

1999

On certain Hamiltonian cycles in planar graphsThomas Böhme, Jochen Harant, Michal Tkác. jgt, 32(1):81-96, 1999. [doi]

More than one tough chordal planar graphs are HamiltonianThomas Böhme, Jochen Harant, Michal Tkác. jgt, 32(4):405-410, 1999. [doi]

Dirac's map-color theorem for choosabilityThomas Böhme, Bojan Mohar, Michael Stiebitz. jgt, 32(4):327-339, 1999. [doi]

1998

A planarity criterion for cubic bipartite graphsThomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer. DM, 191(1-3):31-43, 1998. [doi]

On Hamiltonian cycles in 4- and 5-connected plane triangulationsThomas Böhme, Jochen Harant. DM, 191(1-3):25-30, 1998. [doi]

1997

Spanning trees with pairwise nonadjacent endverticesThomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz. DM, 170(1-3):219-222, 1997. [doi]

1996

Toughness and longest cycles in 2-connected planar graphsThomas Böhme, H. J. Broersma, Henk Jan Veldman. jgt, 23(3):257-263, 1996. [doi]

1993

Aspects of the Automatic Generation of Parallel ProgramsThomas Böhme, Herwig Unger. parco 1994: 573-576

Sign in or sign up to see more results.

runs on WebDSL