Thomas Andreae

According to our database, Thomas Andreae authored at least 39 papers between 1978 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2013

Classes of locally finite ubiquitous graphs.

Thomas Andreae

J. Comb. Theory B, 2013

2008

On self-immersions of infinite graphs.

Thomas Andreae

J. Graph Theory, 2008

2005

Reconstructing the number of blocks of an infinite graph.

Thomas Andreae

Discret. Math., 2005

2003

On immersions of uncountable graphs.

Thomas Andreae

J. Comb. Theory B, 2003

2002

On disjoint configurations in infinite graphs.

Thomas Andreae

J. Graph Theory, 2002

2001

On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality.

Thomas Andreae

Networks, 2001

1999

A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men.

Thomas Andreae, Felix Hartenstein, Andrea Wolter

Theor. Comput. Sci., 1999

1998

On Hypercubes in de Bruijn Graphs.

Thomas Andreae, Martin Hintz

Parallel Process. Lett., 1998

On the clique-transversal number of chordal graphs.

Thomas Andreae

Discret. Math., 1998

1997

Embedding Cartesian Products of Graphs into de Bruijn Graphs.

Thomas Andreae, Michael Nölle, Gerald Schreiber

J. Parallel Distributed Comput., 1997

Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three.

Thomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng

Discret. Appl. Math., 1997

1996

On covering all cliques of a chordal graph.

Thomas Andreae, Carsten Flotow

Discret. Math., 1996

On independent cycles and edges in graphs.

Thomas Andreae

Discret. Math., 1996

1995

Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.

Thomas Andreae, Hans-Jürgen Bandelt

SIAM J. Discret. Math., 1995

On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One.

Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber

Proceedings of the Combinatorics and Computer Science, 1995

1994

On Reconstructing Rooted Trees.

Thomas Andreae

J. Comb. Theory B, 1994

Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).

Thomas Andreae, Michael Nölle, Gerald Schreiber

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

On a Problem Concerning Tolerance Graphs.

Thomas Andreae, Ulf Hennig, Andreas Parra

Discret. Appl. Math., 1993

1992

Some Results on Visibility Graphs.

Thomas Andreae

Discret. Appl. Math., 1992

1991

Clique-transversal sets of line graphs and complements of line graphs.

Thomas Andreae, Martin Schughart, Zsolt Tuza

Discret. Math., 1991

A search problem on graphs which generalizes some group testing problems with two defectives.

Thomas Andreae

Discret. Math., 1991

1989

The total interval number of a graph.

Thomas Andreae, Martin Aigner

J. Comb. Theory B, 1989

A ternary search problem on graphs.

Thomas Andreae

Discret. Appl. Math., 1989

1988

A Remark on Perfect Gaussian Elimination of Symmetric Matrices.

Thomas Andreae

Eur. J. Comb., 1988

On the unit interval number of a graph.

Thomas Andreae

Discret. Appl. Math., 1988

1987

On the Interval Number of a Triangulated Graph.

Thomas Andreae

J. Graph Theory, 1987

1986

On a pursuit game played on graphs for which a minor is excluded.

Thomas Andreae

J. Comb. Theory B, 1986

On an extremal problem concerning the interval number of a graph.

Thomas Andreae

Discret. Appl. Math., 1986

On well-quasi-ordering finite graphs by immersion.

Thomas Andreae

Comb., 1986

1985

On superperfect noncomparability graphs.

Thomas Andreae

J. Graph Theory, 1985

1984

On the reconstruction of rayless infinite forests.

Thomas Andreae, Rüdiger Schmidt

J. Graph Theory, 1984

Note on a pursuit game played on graphs.

Thomas Andreae

Discret. Appl. Math., 1984

1982

Note on the reconstruction of infinite graphs with a fixed finite number of components.

Thomas Andreae

J. Graph Theory, 1982

Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.

Thomas Andreae

J. Comb. Theory B, 1982

Reconstructing the degree sequence and the number of components of an infinite graph.

Thomas Andreae

Discret. Math., 1982

1981

On the reconstruction of locally finite trees.

Thomas Andreae

J. Graph Theory, 1981

1980

On a problem of R. Halin concerning infinite graphs II.

Thomas Andreae

Discret. Math., 1980

1979

Über eine eigenschaft lokalfiniter, unendlicher bäume.

Thomas Andreae

J. Comb. Theory B, 1979

1978

Matroidal families of finite connected nonhomeomorphic graphs exist.

Thomas Andreae

J. Graph Theory, 1978