| 2008 |
|---|
| 27 | EE | Thomas Andreae:
On self-immersions of infinite graphs.
Journal of Graph Theory 58(4): 275-285 (2008) |
| 2005 |
|---|
| 26 | EE | Thomas Andreae:
Reconstructing the number of blocks of an infinite graph.
Discrete Mathematics 297(1-3): 144-151 (2005) |
| 2003 |
|---|
| 25 | EE | Thomas Andreae:
On immersions of uncountable graphs.
J. Comb. Theory, Ser. B 87(1): 130-137 (2003) |
| 2001 |
|---|
| 24 | EE | Thomas Andreae:
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality.
Networks 38(2): 59-67 (2001) |
| 1999 |
|---|
| 23 | EE | 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): 305-323 (1999) |
| 1998 |
|---|
| 22 | EE | Thomas Andreae:
On the clique-transversal number of chordal graphs.
Discrete Mathematics 191(1-3): 3-11 (1998) |
| 21 | | Thomas Andreae,
Martin Hintz:
On Hypercubes in de Bruijn Graphs.
Parallel Processing Letters 8(2): 259-268 (1998) |
| 1997 |
|---|
| 20 | EE | 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.
Discrete Applied Mathematics 79(1-3): 3-34 (1997) |
| 19 | | Thomas Andreae,
Michael Nölle,
Gerald Schreiber:
Embedding Cartesian Products of Graphs into de Bruijn Graphs.
J. Parallel Distrib. Comput. 46(2): 194-200 (1997) |
| 1996 |
|---|
| 18 | EE | Thomas Andreae:
On independent cycles and edges in graphs.
Discrete Mathematics 149(1-3): 291-297 (1996) |
| 17 | EE | Thomas Andreae,
Carsten Flotow:
On covering all cliques of a chordal graph.
Discrete Mathematics 149(1-3): 299-302 (1996) |
| 1995 |
|---|
| 16 | | 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: 316-327 |
| 15 | EE | Thomas Andreae,
Hans-Jürgen Bandelt:
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities.
SIAM J. Discrete Math. 8(1): 1-16 (1995) |
| 1994 |
|---|
| 14 | | Thomas Andreae,
Michael Nölle,
Gerald Schreiber:
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).
WG 1994: 140-150 |
| 13 | EE | Thomas Andreae:
On Reconstructing Rooted Trees.
J. Comb. Theory, Ser. B 62(2): 183-198 (1994) |
| 1993 |
|---|
| 12 | EE | Thomas Andreae,
Ulf Hennig,
Andreas Parra:
On a Problem Concerning Tolerance Graphs.
Discrete Applied Mathematics 46(1): 73-78 (1993) |
| 1992 |
|---|
| 11 | | Thomas Andreae:
Some Results on Visibility Graphs.
Discrete Applied Mathematics 40(1): 5-17 (1992) |
| 1991 |
|---|
| 10 | EE | Thomas Andreae,
Martin Schughart,
Zsolt Tuza:
Clique-transversal sets of line graphs and complements of line graphs.
Discrete Mathematics 88(1): 11-20 (1991) |
| 9 | EE | Thomas Andreae:
A search problem on graphs which generalizes some group testing problems with two defectives.
Discrete Mathematics 88(2-3): 121-127 (1991) |
| 1989 |
|---|
| 8 | EE | Thomas Andreae:
A ternary search problem on graphs.
Discrete Applied Mathematics 23(1): 1-10 (1989) |
| 7 | EE | Thomas Andreae,
Martin Aigner:
The total interval number of a graph.
J. Comb. Theory, Ser. B 46(1): 7-21 (1989) |
| 1988 |
|---|
| 6 | EE | Thomas Andreae:
On the unit interval number of a graph.
Discrete Applied Mathematics 22(1): 1-7 (1988) |
| 1986 |
|---|
| 5 | | Thomas Andreae:
On well-quasi-ordering finite graphs by immersion.
Combinatorica 6(4): 287-298 (1986) |
| 4 | EE | Thomas Andreae:
On a pursuit game played on graphs for which a minor is excluded.
J. Comb. Theory, Ser. B 41(1): 37-47 (1986) |
| 1982 |
|---|
| 3 | EE | Thomas Andreae:
Reconstructing the degree sequence and the number of components of an infinite graph.
Discrete Mathematics 39(1): 1-7 (1982) |
| 2 | EE | Thomas Andreae:
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.
J. Comb. Theory, Ser. B 32(3): 258-263 (1982) |
| 1979 |
|---|
| 1 | EE | Thomas Andreae:
Über eine eigenschaft lokalfiniter, unendlicher bäume.
J. Comb. Theory, Ser. B 27(2): 202-215 (1979) |
