Thomas Andreae

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Classes of locally finite ubiquitous graphs.
J. Comb. Theory B, 2013

2008
On self-immersions of infinite graphs.
J. Graph Theory, 2008

2005
Reconstructing the number of blocks of an infinite graph.
Discret. Math., 2005

2003
On immersions of uncountable graphs.
J. Comb. Theory B, 2003

2002
On disjoint configurations in infinite graphs.
J. Graph Theory, 2002

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

1999
A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men.
Theor. Comput. Sci., 1999

1998
On Hypercubes in de Bruijn Graphs.
Parallel Process. Lett., 1998

On the clique-transversal number of chordal graphs.
Discret. Math., 1998

1997
Embedding Cartesian Products of Graphs into de Bruijn Graphs.
J. Parallel Distributed Comput., 1997

Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three.
Discret. Appl. Math., 1997

1996
On covering all cliques of a chordal graph.
Discret. Math., 1996

On independent cycles and edges in graphs.
Discret. Math., 1996

1995
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.
SIAM J. Discret. Math., 1995

On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion One.
Proceedings of the Combinatorics and Computer Science, 1995

1994
On Reconstructing Rooted Trees.
J. Comb. Theory B, 1994

Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993
On a Problem Concerning Tolerance Graphs.
Discret. Appl. Math., 1993

1992
Some Results on Visibility Graphs.
Discret. Appl. Math., 1992

1991
Clique-transversal sets of line graphs and complements of line graphs.
Discret. Math., 1991

A search problem on graphs which generalizes some group testing problems with two defectives.
Discret. Math., 1991

1989
The total interval number of a graph.
J. Comb. Theory B, 1989

A ternary search problem on graphs.
Discret. Appl. Math., 1989

1988
A Remark on Perfect Gaussian Elimination of Symmetric Matrices.
Eur. J. Comb., 1988

On the unit interval number of a graph.
Discret. Appl. Math., 1988

1987
On the Interval Number of a Triangulated Graph.
J. Graph Theory, 1987

1986
On a pursuit game played on graphs for which a minor is excluded.
J. Comb. Theory B, 1986

On an extremal problem concerning the interval number of a graph.
Discret. Appl. Math., 1986

On well-quasi-ordering finite graphs by immersion.
Comb., 1986

1985
On superperfect noncomparability graphs.
J. Graph Theory, 1985

1984
On the reconstruction of rayless infinite forests.
J. Graph Theory, 1984

Note on a pursuit game played on graphs.
Discret. Appl. Math., 1984

1982
Note on the reconstruction of infinite graphs with a fixed finite number of components.
J. Graph Theory, 1982

Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.
J. Comb. Theory B, 1982

Reconstructing the degree sequence and the number of components of an infinite graph.
Discret. Math., 1982

1981
On the reconstruction of locally finite trees.
J. Graph Theory, 1981

1980
On a problem of R. Halin concerning infinite graphs II.
Discret. Math., 1980

1979
Über eine eigenschaft lokalfiniter, unendlicher bäume.
J. Comb. Theory B, 1979

1978
Matroidal families of finite connected nonhomeomorphic graphs exist.
J. Graph Theory, 1978


  Loading...