[Uni Hamburg] [Fachbereich Mathematik] [Diskrete Mathematik] [Math. Seminar]


(Prof. Dr. Thomas Andreae)

!!! For reprints of published papers please contact the author by e-mail !!!

  1. T. Andreae, Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen, Abh. Math. Sem. Hamburg 46 (1978) 91-95.
  2. T. Andreae, On a problem of R. Halin concerning infinite graphs, Discrete Math. 23 (1978) 1-15.
  3. T. Andreae, Matroidal families of finite connected nonhomeomorphic graphs exist, J. Graph Theory 2 (1978) 149-153.
  4. T. Andreae, Untersuchungen über Systeme von paarweise disjunkten Exemplaren eines unendlichen Graphen, Doctoral Dissertation, University of Hamburg (1978).
  5. T. Andreae, Über eine Eigenschaft lokalfiniter, unendlicher Bäume, J. Combinatorial Theory, Ser. B27 (1979) 202-215.
  6. T. Andreae, On a problem of R. Halin concerning infinite graphs II, Discrete Math. 29, (1980) 219-227.
  7. T. Andreae, On the reconstruction of locally finite trees, J. Graph Theory 5 (1981) 123-135.
  8. T. Andreae, Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen, Math. Nachr. 101 (1981) 219-228.
  9. T. Andreae, Reconstructing the degree sequence and the number of components of an infinite graph, Discrete Math. 39, (1982) 1-7.
  10. T. Andreae, Note on the reconstruction of infinite graphs with a fixed finite number of components, J. Graph Theory 6 (1982) 81-83.
  11. T. Andreae, Simpler counterexemples to the edge-reconstruction conjecture for infinite graphs, J. Combinatorial Theory, Series B 32 (1982) 258-263.
  12. T. Andreae, An edge-deletion problem for locally finite graphs, J. Combinatorial Theory, Series B 33 (1982) 178-186.
  13. T. Andreae, On the reconstruction of locally finite, infinite graphs, J. Combinatorics, Information and System Science 7 (1982) 65-74.
  14. T. Andreae and R. Schmidt, On the reconstruction of rayless infinite forests, J. Graph Theory 8 (1984) 405-422.
  15. T. Andreae, Note on a pursuit game played on graphs, Discrete Appl. Math. 9 (1984) 111-115.
  16. T. Andreae, On the edge reconstruction of locally finite disconnected graphs with a finite number of components, Abh. Math. Sem. Hamburg 55 (1985) 229-238.
  17. T. Andreae, On the degrees of vertices in locally finite graphs with possess a certain edge deletion property, Archiv Math. 45 (1985) 574-576.
  18. T. Andreae, On superperfect noncomparability graphs, J. Graph Theory 9 (1985) 523-532.
  19. T. Andreae, On an extremal problem concerning the interval number of a graph, Discrete Appl. Math. 14 (1986) 1-9.
  20. T. Andreae, On a pursuit game played on graphs for which a minor is excluded, J. Combinatorial Theory, Series B 41 (1986) 37-47.
  21. T. Andreae, On well-quasi-ordering finite graphs by immersion, Combinatorica 6 (1986) 287-298.
  22. T. Andreae, On the interval number of a triangulated graph, J. Graph Theory 11 (1987) 273-280.
  23. T. Andreae, A remark on perfect gaussian elimination of symmetric matrices, European J. Cominatorics 9 (1988), 547-549.
  24. T. Andreae, A ternary search problem on graphs, Discrete Appl. Math. 29 (1988) 1-10.
  25. T. Andreae, On the unit inverval number of a graph, Discrete Appl. Math. 22 (1988/89) 1-7.
  26. T. Andreae and M. Aigner, The total interval number of a graph, J. Combinatorial Theory, Series B 46 (1989) 7-21.
  27. T. Andreae, Extremal graphs for the unit interval number, in: Contempory methods in graph theory (R. Bodendiek, ed.), Festschrift in honour of Prof. Dr. Klaus Wagner, BI-Verlag, Mannheim, pp. 73-82 (1990).
  28. T. Andreae, M. Schughart, and Z. Tuza, Clique Transversal Sets of Line Graphs and Complements of Line Graphs, Discrete Math. 88 (1991) 11-20.
  29. T. Andreae, A search problem on graphs which generalizes some group testing problems with two defectives, Discrete Math. 88 (1991) 121-127.
  30. T. Andreae, Some results on visibility graphs. In: Special issue of Discrete Applied Mathematics on Combinatorial Methods in VLSI (Guest editors: T. Lengauer and R.H. Möhring). Discrete Applied Mathematics 40 (1992) 5-17
  31. T. Andreae, U. Hennig, and A. Parra, On a problem concerning tolerance graphs. Discrete Applied Mathematics 46 (1993) 73-78.
  32. T. Andreae, On reconstructing rooted trees. J. Combinatorial Theory, Ser. B, 62 (1994) 183-198.
  33. T. Andreae and H.-J. Bandelt, Performance guarantees for approximation algorithms depending on parametrized triangle inequalities, SIAM Journal of Discrete Mathematics 8 (1995) 1-16.
  34. T. Andreae and H.-J. Bandelt, Minimum transversals of maximum matchings as approximate solutions to the bisection problem, Abh. Math. Sem. Univ. Hamburg 65 (1995) 199-203.
  35. T. Andreae, M. Nölle, and G. Schreiber, Cartesian products of graphs as spanning subgraphs of de Bruijn graphs, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (June 16-18, 1994, Herrsching near Munich, Germany), Lecture Notes in Computer Science 903, Springer Verlag, pp 140-151 (1995).
  36. T. Andreae, On independent cycles and edges in graphs, Discrete Mathematics 149 (1996) 291-297.
  37. T. Andreae and C. Flotow, On covering all cliques of a chordal graph, Discrete Mathematics 149 (1996) 299-302.
  38. T. Andreae, M. Nölle, C. Rempel and G. Schreiber, On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one, Combinatorics and Computer Science M. Deza, R. Euler, I. Manoussakis (eds.), Lecture Notes in Computer Science 1120, Springer Verlag, pp 316-327 (1996).
  39. T. Andreae, M. Nölle and G. Schreiber, Embedding Caretesian Products of Graphs into de Bruijn Graphs, J. Parallel and Distributed Computing 46 (1997) 194-200.
  40. T. Andreae, M Hintz, M. Nölle, G. Schreiber, G. W. Schuster, and H. Seng, Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three, Discrete Applied Mathematics 79 (1997) 3-34.
  41. T. Andreae, On the clique-transversal number of chordal graphs, Discrete Mathematics 191 (1998) 3-11.
  42. T. Andreae and M. Hintz, On Hypercubes in de Bruijn Graphs, Parallel Processing Letters 8 (1998) 259-268.
  43. T. Andreae, F. Hartenstein and A. Wolter, A Two-Person Game on Graphs where each Player tries to Encircle his Opponent's Men (1998), Theoretical Computer Science 215( 1998) 305-323.
  44. T. Andreae, On the Traveling Salesman Problem Restricted to Inputs Satisfying a Relaxed Triangle Inequality, Networks 38 (2001) 59-67.
  45. T. Andreae, On disjoint configurations in infinite graphs, J. Graph Theory 39 (2002) 222-229.
  46. T. Andreae, On the immersion relation and an embedding problem for infinite graphs, Result.Math.41(2002) 18-25.
  47. T. Andreae, On immersions of uncountable graphs J. Combinatorial Theory, Ser B., 87(2003) 130-137.
  48. T. Andreae, Reconstructing the number of blocks of an infinite graph, Discrete Mathematics 297 (2005) 144-151.
  49. T. Andreae, On self-immersions of infinite graphs, J Graph Theory 58 (2008) 275-285.
  50. T. Andreae, Classes of Locally Finite Ubiquitous Graphs, J. Combinatorial Theory, Series B 103 (2013) 274-290.

Last modified: 20.01.2014 (wwwmath [MJ])