Thomas Andreae

39 papers B 1Journal 37Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
Classes of locally finite ubiquitous graphs.
J. Comb. Theory B
Thomas Andreae
2008 J jnl
On self-immersions of infinite graphs.
J. Graph Theory
Thomas Andreae
2005 J jnl
Reconstructing the number of blocks of an infinite graph.
Discret. Math.
Thomas Andreae
2003 J jnl
On immersions of uncountable graphs.
J. Comb. Theory B
Thomas Andreae
2002 J jnl
On disjoint configurations in infinite graphs.
J. Graph Theory
Thomas Andreae
2001 J jnl
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality.
Networks
Thomas Andreae
1999 J jnl
A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men.
Theor. Comput. Sci.
Thomas Andreae, Felix Hartenstein, Andrea Wolter
1998 J jnl
On Hypercubes in de Bruijn Graphs.
Parallel Process. Lett.
Thomas Andreae, Martin Hintz
1998 J jnl
On the clique-transversal number of chordal graphs.
Discret. Math.
Thomas Andreae
1997 J jnl
Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three.
Discret. Appl. Math.
Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng
1997 J jnl
Embedding Cartesian Products of Graphs into de Bruijn Graphs.
J. Parallel Distributed Comput.
Thomas Andreae, Michael Nölle, Gerald Schreiber
1996 J jnl
On covering all cliques of a chordal graph.
Discret. Math.
Thomas Andreae, Carsten Flotow
1996 J jnl
On independent cycles and edges in graphs.
Discret. Math.
Thomas Andreae
1995 — conf
On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One.
Combinatorics and Computer Science
Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber
1995 J jnl
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.
SIAM J. Discret. Math.
Thomas Andreae, Hans-Jürgen Bandelt
1994 B conf
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).
WG
Thomas Andreae, Michael Nölle, Gerald Schreiber
1994 J jnl
On Reconstructing Rooted Trees.
J. Comb. Theory B
Thomas Andreae
1993 J jnl
On a Problem Concerning Tolerance Graphs.
Discret. Appl. Math.
Thomas Andreae, Ulf Hennig, Andreas Parra
1992 J jnl
Some Results on Visibility Graphs.
Discret. Appl. Math.
Thomas Andreae
1991 J jnl
A search problem on graphs which generalizes some group testing problems with two defectives.
Discret. Math.
Thomas Andreae
1991 J jnl
Clique-transversal sets of line graphs and complements of line graphs.
Discret. Math.
Thomas Andreae, Martin Schughart, Zsolt Tuza
1989 J jnl
A ternary search problem on graphs.
Discret. Appl. Math.
Thomas Andreae
1989 J jnl
The total interval number of a graph.
J. Comb. Theory B
Thomas Andreae, Martin Aigner
1988 J jnl
A Remark on Perfect Gaussian Elimination of Symmetric Matrices.
Eur. J. Comb.
Thomas Andreae
1988 J jnl
On the unit interval number of a graph.
Discret. Appl. Math.
Thomas Andreae
1987 J jnl
On the Interval Number of a Triangulated Graph.
J. Graph Theory
Thomas Andreae
1986 J jnl
On a pursuit game played on graphs for which a minor is excluded.
J. Comb. Theory B
Thomas Andreae
1986 J jnl
On an extremal problem concerning the interval number of a graph.
Discret. Appl. Math.
Thomas Andreae
1986 J jnl
On well-quasi-ordering finite graphs by immersion.
Comb.
Thomas Andreae
1985 J jnl
On superperfect noncomparability graphs.
J. Graph Theory
Thomas Andreae
1984 J jnl
Note on a pursuit game played on graphs.
Discret. Appl. Math.
Thomas Andreae
1984 J jnl
On the reconstruction of rayless infinite forests.
J. Graph Theory
Thomas Andreae, Rüdiger Schmidt
1982 J jnl
Note on the reconstruction of infinite graphs with a fixed finite number of components.
J. Graph Theory
Thomas Andreae
1982 J jnl
Reconstructing the degree sequence and the number of components of an infinite graph.
Discret. Math.
Thomas Andreae
1982 J jnl
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.
J. Comb. Theory B
Thomas Andreae
1981 J jnl
On the reconstruction of locally finite trees.
J. Graph Theory
Thomas Andreae
1980 J jnl
On a problem of R. Halin concerning infinite graphs II.
Discret. Math.
Thomas Andreae
1979 J jnl
Über eine eigenschaft lokalfiniter, unendlicher bäume.
J. Comb. Theory B
Thomas Andreae
1978 J jnl
Matroidal families of finite connected nonhomeomorphic graphs exist.
J. Graph Theory
Thomas Andreae