Thomas Andreae

发表

Note on a pursuit game played on graphs

Thomas ANDREAE, Thomas Andreae, 1984, Discret. Appl. Math..

On disjoint configurations in infinite graphs

Thomas Andreae, 2002 .

On the Immersion Relation and an Embedding Problem for Infinite Graphs

Thomas Andreae, 2002 .

On the edge reconstruction of locally finite disconnected graphs with a finite number of components

Thomas Andreae, 1985 .

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

Thomas Andreae, Thomas Andreae, 1991, Discret. Math..

Embedding Cartesian Products of Graphs into de Bruijn Graphs

Gerald Schreiber, Thomas Andreae, Michael Nölle, 1997, J. Parallel Distributed Comput..

On well-quasi-ordering-finite graphs by immersion

Thomas Andreae, Thomas Andreae, 1986, Comb..

On a problem of R. Halin concerning infinite graphs II

Thomas Andreae, Thomas Andreae, 1980, Discret. Math..

Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities

Hans-Jürgen Bandelt, Thomas Andreae, H. Bandelt, 1995, SIAM J. Discret. Math..

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

Thomas Andreae, Andrea Wolter, Felix Hartenstein, 1999, Theor. Comput. Sci..

On independent cycles and edges in graphs

Thomas Andreae, Thomas Andreae, 1996, Discret. Math..

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

Thomas Andreae, Thomas Andreae, 1986, J. Comb. Theory, Ser. B.

Minimum transversals of maximum matchings as approximate solutions to the bisection problem

Hans-Jürgen Bandelt, Thomas Andreae, Th Andreae, 1995 .

On the clique-transversal number of chordal graphs

Thomas Andreae, Thomas Andreae, 1998, Discret. Math..

On the reconstruction of locally finite trees

Thomas Andreae, Thomas Andreae, 1981, J. Graph Theory.

On covering all cliques of a chordal graph

Thomas Andreae, Carsten Flotow, Thomas Andreae, 1996, Discret. Math..

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

Zsolt Tuza, Thomas Andreae, Martin Schughart, 1991, Discret. Math..

Classes of locally finite ubiquitous graphs

Thomas Andreae, Thomas Andreae, 2013, J. Comb. Theory, Ser. B.

On disjoint configurations in infinite graphs

Thomas Andreae, Thomas Andreae, 2002, J. Graph Theory.

On immersions of uncountable graphs

Thomas Andreae, Thomas Andreae, 2003, J. Comb. Theory, Ser. B.

Hamburger Beitr Age Zur Mathematik on Immersions of Uncountable Graphs on Immersions of Uncountable Graphs

Thomas Andreae, 2001 .

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

Thomas Andreae, Thomas Andreae, 2001, Networks.

An edge-deletion problem for locally finite graphs

Thomas Andreae, 1982 .

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

Gerald Schreiber, Thomas Andreae, Michael Nölle, 1995, Discret. Appl. Math..

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

Gerald Schreiber, Thomas Andreae, Michael Nölle, 1994, WG.

Matroidal families of finite connected nonhomeomorphic graphs exist

Thomas Andreae, Thomas Andreae, 1978, J. Graph Theory.