default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Böhme 0001
Person information
- affiliation: TU Ilmenau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Thomas Böhme, Jochen Harant, Matthias Kriesell
, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024)- [c8]T. G. Harrison, Thomas Böhme, Mario Kubek, Herwig Unger:
GraphLearner: An Approach to Sequence Recognition and Generation. BigComp 2024: 445-451
2010 – 2019
- 2017
- [j23]Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). Discret. Math. 340(11): 2615 (2017) - [c7]Mario M. Kubek, Thomas Böhme, Herwig Unger:
Spreading activation: a fast calculation method for text centroids. ICCIP 2017: 24-27 - 2014
- [c6]Panchalee Sukjit, Mario Kubek, Thomas Böhme, Herwig Unger:
PDSearch: Using Pictures as Queries. IC2IT 2014: 255-262 - 2013
- [c5]Franz Girlich, Michael Rossberg, Guenter Schaefer, Thomas Böhme, Jens Schreyer:
Bounds for the Security of the Vivaldi Network Coordinate System. NetSys 2013: 66-75 - 2012
- [p1]Thomas Böhme, Jens Schreyer, Erika Skrabul'áková:
A Note on Semi-steady States in Stochastic Cellular Automata. Autonomous Systems: Developments and Trends 2012: 313-323 - 2011
- [j22]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Minors in Graphs with High Chromatic Number. Comb. Probab. Comput. 20(4): 513-518 (2011) - [c4]Thomas Böhme, Jens Schreyer:
Local Computation of Vertex Colorings. CTW 2011: 76-79 - 2010
- [j21]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Hadwiger numbers and over-dominating colourings. Discret. Math. 310(20): 2662-2665 (2010)
2000 – 2009
- 2009
- [j20]Thomas Böhme, Alexandr V. Kostochka:
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. Discret. Math. 309(4): 997-1000 (2009) - [j19]Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger:
Learning of winning strategies for terminal games with linear-size memory. Int. J. Game Theory 38(2): 155-168 (2009) - [j18]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. J. Comb. Theory B 99(2): 323 (2009) - [j17]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors. J. Comb. Theory B 99(3): 557-582 (2009) - [c3]Thomas Böhme, Jens Schreyer:
A Game Theoretic Approach to Graph Probleras. IICS 2009: 149-156 - 2008
- [j16]Thomas Böhme, Tobias Gerlach, Michael Stiebitz:
Ordered and linked chordal graphs. Discuss. Math. Graph Theory 28(2): 367-373 (2008) - 2006
- [j15]Thomas Böhme, Martin Knor, Ludovít Niepel:
Linkability in iterated line graphs. Discret. Math. 306(7): 666-669 (2006) - [e5]Thomas Böhme, Victor M. Larios-Rosillo, Helena Unger, Herwig Unger:
Innovative Internet Community Systems, 4th InternationalWorkshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004, Revised Papers. Lecture Notes in Computer Science 3473, Springer 2006, ISBN 3-540-28880-5 [contents] - [e4]Alain Bui, Marc Bui, Thomas Böhme, Herwig Unger:
Innovative Internet Community Systems, 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005, Revised Papers. Lecture Notes in Computer Science 3908, Springer 2006, ISBN 3-540-33973-6 [contents] - 2005
- [j14]Thomas Böhme, Alexandr V. Kostochka:
Disjoint Kr-minors in large graphs with given average degree. Eur. J. Comb. 26(3-4): 289-292 (2005) - [c2]Hans Friedrich Witschel, Thomas Böhme:
Evaluating profiling and query expansion methods for P2P information retrieval. P2PIR@CIKM 2005: 1-8 - 2004
- [j13]Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz:
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. J. Graph Theory 45(4): 270-274 (2004) - 2003
- [j12]Thomas Böhme, Bojan Mohar:
Domination, Packing and Excluded Minors. Electron. J. Comb. 10 (2003) - [e3]Thomas Böhme, Gerhard Heyer, Herwig Unger:
Innovative Internet Community Systems, Third International Workshop, IICS 2003, Leipzig, Germany, June 19-21, 2003, Revised Papers. Lecture Notes in Computer Science 2877, Springer 2003, ISBN 3-540-20436-9 [contents] - 2002
- [j11]Thomas Böhme, Bojan Mohar:
Labeled K2, t Minors in Plane Graphs. J. Comb. Theory B 84(2): 291-300 (2002) - [j10]Thomas Böhme, Bojan Mohar, Carsten Thomassen:
Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory B 85(2): 338-347 (2002) - [j9]Thomas Böhme, John Maharry, Bojan Mohar:
Ka, k Minors in Graphs of Bounded Tree-Width. J. Comb. Theory B 86(1): 133-147 (2002) - [e2]Herwig Unger, Thomas Böhme, Armin R. Mikler:
Innovative Internet Computing Systems, Second International Workshop, IICS 2002, Kühlungsborn, Germany, June 20-22, 2002, Proceedings. Lecture Notes in Computer Science 2346, Springer 2002, ISBN 3-540-43790-8 [contents] - 2001
- [j8]Thomas Böhme, Frank Göring, Jochen Harant:
Menger's Theorem. J. Graph Theory 37(1): 35-36 (2001) - [e1]Thomas Böhme, Herwig Unger:
Innovative Internet Computing Systems, International Workshop IICS 2001, Ilmenau, Germany, June 21-22, 2001, Proceedings. Lecture Notes in Computer Science 2060, Springer 2001, ISBN 3-540-42275-7 [contents]
1990 – 1999
- 1999
- [j7]Thomas Böhme, Jochen Harant, Michal Tkác:
On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32(1): 81-96 (1999) - [j6]Thomas Böhme, Bojan Mohar, Michael Stiebitz:
Dirac's map-color theorem for choosability. J. Graph Theory 32(4): 327-339 (1999) - [j5]Thomas Böhme, Jochen Harant, Michal Tkác:
More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32(4): 405-410 (1999) - 1998
- [j4]Thomas Böhme, Jochen Harant:
On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discret. Math. 191(1-3): 25-30 (1998) - [j3]Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:
A planarity criterion for cubic bipartite graphs. Discret. Math. 191(1-3): 31-43 (1998) - 1997
- [j2]Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170(1-3): 219-222 (1997) - 1996
- [j1]Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman:
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23(3): 257-263 (1996) - 1993
- [c1]Thomas Böhme, Herwig Unger:
Aspects of the Automatic Generation of Parallel Programs. PARCO 1993: 573-576
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
