Thomas Andreae - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2013

Classes of locally finite ubiquitous graphsThomas Andreae. JCT, 103(2):274-290, 2013. [doi]

2008

On self-immersions of infinite graphsThomas Andreae. jgt, 58(4):275-285, 2008. [doi]

2005

Reconstructing the number of blocks of an infinite graphThomas Andreae. DM, 297(1-3):144-151, 2005. [doi]

2003

On immersions of uncountable graphsThomas Andreae. JCT, 87(1):130-137, 2003. [doi]

2002

On disjoint configurations in infinite graphsThomas Andreae. jgt, 39(4):222-229, 2002. [doi]

2001

On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequalityThomas Andreae. networks, 38(2):59-67, 2001. [doi]

1999

A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent s MenThomas Andreae, Felix Hartenstein, Andrea Wolter. TCS, 215(1-2):305-323, 1999. [doi]

1998

On the clique-transversal number of chordal graphsThomas Andreae. DM, 191(1-3):3-11, 1998. [doi]

On Hypercubes in de Bruijn GraphsThomas Andreae, Martin Hintz. ppl, 8(2):259-268, 1998.

1997

Embedding Cartesian Products of Graphs into de Bruijn GraphsThomas Andreae, Michael Nölle, Gerald Schreiber. jpdc, 46(2):194-200, 1997.

Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least ThreeThomas Andreae, Martin Hintz, Michael Nölle, Gerald Schreiber, Gerald W. Schuster, Hajo Seng. DAM, 79(1-3):3-34, 1997. [doi]

1996

On covering all cliques of a chordal graphThomas Andreae, Carsten Flotow. DM, 149(1-3):299-302, 1996. [doi]

On independent cycles and edges in graphsThomas Andreae. DM, 149(1-3):291-297, 1996. [doi]

1995

On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion OneThomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber. cococ 1996: 316-327

Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle InequalitiesThomas Andreae, Hans-Jürgen Bandelt. siamdm, 8(1):1-16, 1995. [doi]

1994

On Reconstructing Rooted TreesThomas Andreae. JCT, 62(2):183-198, 1994. [doi]

Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract)Thomas Andreae, Michael Nölle, Gerald Schreiber. criwg 1995: 140-150

1993

On a Problem Concerning Tolerance GraphsThomas Andreae, Ulf Hennig, Andreas Parra. DAM, 46(1):73-78, 1993. [doi]

1992

Some Results on Visibility GraphsThomas Andreae. DAM, 40(1):5-17, 1992.

1991

A search problem on graphs which generalizes some group testing problems with two defectivesThomas Andreae. DM, 88(2-3):121-127, 1991. [doi]

Clique-transversal sets of line graphs and complements of line graphsThomas Andreae, Martin Schughart, Zsolt Tuza. DM, 88(1):11-20, 1991. [doi]

1989

The total interval number of a graphThomas Andreae, Martin Aigner. JCT, 46(1):7-21, 1989. [doi]

A ternary search problem on graphsThomas Andreae. DAM, 23(1):1-10, 1989. [doi]

1988

On the unit interval number of a graphThomas Andreae. DAM, 22(1):1-7, 1988. [doi]

A Remark on Perfect Gaussian Elimination of Symmetric MatricesThomas Andreae. ejc, 9(6):547-549, 1988. [doi]

1987

On the Interval Number of a Triangulated GraphThomas Andreae. jgt, 11(3):273-280, 1987. [doi]

1986

On a pursuit game played on graphs for which a minor is excludedThomas Andreae. JCT, 41(1):37-47, 1986. [doi]

On well-quasi-ordering finite graphs by immersionThomas Andreae. combinatorica, 6(4):287-298, 1986.

On an extremal problem concerning the interval number of a graphThomas Andreae. DAM, 14(1):1-9, 1986. [doi]

1985

On superperfect noncomparability graphsThomas Andreae. jgt, 9(4):523-532, 1985. [doi]

1984

On the reconstruction of rayless infinite forestsThomas Andreae, Rüdiger Schmidt. jgt, 8(3):405-422, 1984. [doi]

Note on a pursuit game played on graphsThomas Andreae. DAM, 9(2):111-115, 1984. [doi]

1982

Reconstructing the degree sequence and the number of components of an infinite graphThomas Andreae. DM, 39(1):1-7, 1982. [doi]

Simpler counterexamples to the edge-reconstruction conjecture for infinite graphsThomas Andreae. JCT, 32(3):258-263, 1982. [doi]

Note on the reconstruction of infinite graphs with a fixed finite number of componentsThomas Andreae. jgt, 6(1):81-83, 1982. [doi]

1981

On the reconstruction of locally finite treesThomas Andreae. jgt, 5(2):123-135, 1981. [doi]

1980

On a problem of R. Halin concerning infinite graphs IIThomas Andreae. DM, 29(3):219-227, 1980. [doi]

1979

Über eine eigenschaft lokalfiniter, unendlicher bäumeThomas Andreae. JCT, 27(2):202-215, 1979. [doi]

1978

Matroidal families of finite connected nonhomeomorphic graphs existThomas Andreae. jgt, 2(2):149-153, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL