Gottfried Tinhofer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2002

Landscapes on spaces of treesOliver Bastert, Daniel N. Rockmore, Peter F. Stadler, Gottfried Tinhofer. amc, 131(2-3):439-459, 2002. [doi]

2001

Recognizing Circulant Graphs in Polynomial Time: An Application of Association SchemesMikhail E. Muzychuk, Gottfried Tinhofer. combinatorics, 8(1), 2001. [doi]

2000

Forestal algebras and algebraic forests (on a new class of weakly compact graphs)Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer. DM, 225(1-3):149-172, 2000. [doi]

1998

Recognizing Circulant Graphs of Prime Order in Polynomial TimeMikhail E. Muzychuk, Gottfried Tinhofer. combinatorics, 5, 1998. [doi]

1996

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path GraphsLuitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. jal, 21(3):542-564, 1996.

1995

Hamiltonicity in Graphs with Few P4 sWinfried Hochstättler, Gottfried Tinhofer. computing, 54(3):213-226, 1995. [doi]

Bin-packing and Matchings in Threshold GraphsGottfried Tinhofer. DAM, 62(1-3):279-289, 1995. [doi]

1994

Direct Path Graph Isomorphism (Extended Abstract)Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. criwg 1995: 395-406

Hard-to-color Graphs for Connected Sequential ColoringsLuitpold Babel, Gottfried Tinhofer. DAM, 51(1-2):3-25, 1994. [doi]

Book reviewGottfried Tinhofer, N. Katoh, W. Wenzel. mmor, 40(3):334-338, 1994. [doi]

1991

A note on compact graphsGottfried Tinhofer. DAM, 30(2-3):253-264, 1991. [doi]

1990

A branch and bound algorithm for the maximum clique problemLuitpold Babel, Gottfried Tinhofer. mmor, 34(3):207-217, 1990. [doi]

1989

Strong tree-cographs are birkhoff graphsGottfried Tinhofer. DAM, 22(3):275-288, 1989. [doi]

1988

Book reviewsM. Nermuth, Gottfried Tinhofer, R. W. Cottle. mmor, 32(2):107-110, 1988. [doi]

1986

The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n)Gottfried Tinhofer, H. Schreck. ipl, 23(1):11-17, 1986.

Graph isomorphism and theorems of Birkhoff typeGottfried Tinhofer. computing, 36(4):285-300, 1986. [doi]

1985

Computing the characteristic polynomial of a treeGottfried Tinhofer, Helmut Schreck. computing, 35(2):113-125, 1985. [doi]

1984

On certain classes of fractional matchingsJörg R. Mühlbacher, Frank X. Steinparz, Gottfried Tinhofer. DAM, 9(3):235-244, 1984. [doi]

Rational solutions of the graphsack problemGottfried Tinhofer. mp, 28(3):337-348, 1984. [doi]

Linear time tree codesGottfried Tinhofer, Helmut Schreck. computing, 33(3-4):211-225, 1984. [doi]

A probabilistic analysis of some greedy cardinality matching algorithmsGottfried Tinhofer. anor, 1(3):239-254, 1984. [doi]

1981

A Travelling Salesman Problem with Additional ConstraintsGottfried Tinhofer. wg 1982: 75-86

1980

On the Use of Some Almost Sure Graph PropertiesGottfried Tinhofer. criwg 1981: 113-126

1977

Zerlegung der Knotenmengen von Graphen zum Nachweis der IsomorphieJosef Hinteregger, Gottfried Tinhofer. computing, 18(4):351-359, 1977. [doi]

1975

Zur Bestimmung der Automorphismen eines endlichen GraphenGottfried Tinhofer. computing, 15(2):147-156, 1975. [doi]

1973

Der Out-Of-Kilter-Algorithmus für Antisymmetrische NetzwerkeGottfried Tinhofer. computing, 11(1):45-50, 1973. [doi]

1972

Über die Bestimmung von Kernen in endlichen GraphenGottfried Tinhofer. computing, 9(2):139-147, 1972. [doi]

1971

Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen WertemengenGottfried Tinhofer. computing, 8(1-2):113-120, 1971. [doi]

Flüsse in antisymmetrischen NetzwerkenGottfried Tinhofer. computing, 8(1-2):191-199, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL