The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Andreae: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber
    On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:316-327 [Conf]
  2. Thomas Andreae, Michael Nölle, Gerald Schreiber
    Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:140-150 [Conf]
  3. Thomas Andreae
    On well-quasi-ordering finite graphs by immersion. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:4, pp:287-298 [Journal]
  4. Thomas Andreae
    Some Results on Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:1, pp:5-17 [Journal]
  5. Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng
    Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:3-34 [Journal]
  6. Thomas Andreae, Ulf Hennig, Andreas Parra
    On a Problem Concerning Tolerance Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:1, pp:73-78 [Journal]
  7. Thomas Andreae
    Reconstructing the number of blocks of an infinite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:144-151 [Journal]
  8. Thomas Andreae
    On immersions of uncountable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:130-137 [Journal]
  9. Thomas Andreae
    Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:3, pp:258-263 [Journal]
  10. Thomas Andreae
    On a pursuit game played on graphs for which a minor is excluded. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:37-47 [Journal]
  11. Thomas Andreae
    On Reconstructing Rooted Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:183-198 [Journal]
  12. Thomas Andreae, Martin Aigner
    The total interval number of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:46, n:1, pp:7-21 [Journal]
  13. Thomas Andreae
    Über eine eigenschaft lokalfiniter, unendlicher bäume. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:27, n:2, pp:202-215 [Journal]
  14. Thomas Andreae, Michael Nölle, Gerald Schreiber
    Embedding Cartesian Products of Graphs into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:46, n:2, pp:194-200 [Journal]
  15. Thomas Andreae
    On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:2, pp:59-67 [Journal]
  16. Thomas Andreae, Martin Hintz
    On Hypercubes in de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:259-268 [Journal]
  17. Thomas Andreae, Hans-Jürgen Bandelt
    Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:1-16 [Journal]
  18. Thomas Andreae, Felix Hartenstein, Andrea Wolter
    A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:305-323 [Journal]
  19. Thomas Andreae
    Reconstructing the degree sequence and the number of components of an infinite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:1, pp:1-7 [Journal]
  20. Thomas Andreae
    On the clique-transversal number of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:3-11 [Journal]
  21. Thomas Andreae, Martin Schughart, Zsolt Tuza
    Clique-transversal sets of line graphs and complements of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:1, pp:11-20 [Journal]
  22. Thomas Andreae
    A search problem on graphs which generalizes some group testing problems with two defectives. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:121-127 [Journal]
  23. Thomas Andreae, Carsten Flotow
    On covering all cliques of a chordal graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:299-302 [Journal]
  24. Thomas Andreae
    On independent cycles and edges in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:291-297 [Journal]

  25. On the unit interval number of a graph. [Citation Graph (, )][DBLP]


  26. A ternary search problem on graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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