Thomas Andreae Reconstructing the number of blocks of an infinite graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:297, n:1-3, pp:144-151 [Journal]
Thomas Andreae Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:32, n:3, pp:258-263 [Journal]
Thomas Andreae On a pursuit game played on graphs for which a minor is excluded. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:37-47 [Journal]
Thomas Andreae On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. [Citation Graph (0, 0)][DBLP] Networks, 2001, v:38, n:2, pp:59-67 [Journal]
Thomas Andreae Reconstructing the degree sequence and the number of components of an infinite graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:1-7 [Journal]
Thomas Andreae On the clique-transversal number of chordal graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:191, n:1-3, pp:3-11 [Journal]
Thomas Andreae A search problem on graphs which generalizes some group testing problems with two defectives. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:88, n:2-3, pp:121-127 [Journal]