Thomas Andreae

Publication Activity (10 Years)

Years Active: 1978-2013
Publications (10 Years): 0

Top Topics

Bipartite Graph

Relational Databases

Algebraic Structures

Top Venues

J. Comb. Theory, Ser. B

Publications

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