The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Böhme: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Böhme, Herwig Unger
    Aspects of the Automatic Generation of Parallel Programs. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:573-576 [Conf]
  2. Thomas Böhme, Bojan Mohar
    Domination, Packing and Excluded Minors. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  3. Thomas Böhme, Martin Knor, Ludovít Niepel
    Linkability in iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:666-669 [Journal]
  4. Thomas Böhme, Alexandr V. Kostochka
    Disjoint Kr-minors in large graphs with given average degree. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:289-292 [Journal]
  5. Thomas Böhme, Bojan Mohar
    Labeled K2, t Minors in Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:291-300 [Journal]
  6. Thomas Böhme, John Maharry, Bojan Mohar
    Ka, k Minors in Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:133-147 [Journal]
  7. Thomas Böhme, Bojan Mohar, Carsten Thomassen
    Long Cycles in Graphs on a Fixed Surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:338-347 [Journal]
  8. Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
    Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:4, pp:270-274 [Journal]
  9. Thomas Böhme, Jochen Harant
    On Hamiltonian cycles in 4- and 5-connected plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:25-30 [Journal]
  10. Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
    A planarity criterion for cubic bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:31-43 [Journal]
  11. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]

  12. A Game Theoretic Approach to Graph Probleras. [Citation Graph (, )][DBLP]


  13. Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. [Citation Graph (, )][DBLP]


  14. Hadwiger numbers and over-dominating colourings. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002