Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. - Gottfried Tinhofer (Computing, 1971)

Flüsse in antisymmetrischen Netzwerken. - Gottfried Tinhofer (Computing, 1971)

Über die Bestimmung von Kernen in endlichen Graphen. - Gottfried Tinhofer (Computing, 1972)

Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke. - Gottfried Tinhofer (Computing, 1973)

Zur Bestimmung der Automorphismen eines endlichen Graphen. - Gottfried Tinhofer (Computing, 1975)

Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie. - Josef Hinteregger; Gottfried Tinhofer (Computing, 1977)

On the Use of Some Almost Sure Graph Properties. - Gottfried Tinhofer (WG, 1980)

A Travelling Salesman Problem with Additional Constraints. - Gottfried Tinhofer (WG, 1981)

A probabilistic analysis of some greedy cardinality matching algorithms. - Gottfried Tinhofer (Ann. Oper. Res., 1984)

Linear time tree codes. - Gottfried Tinhofer; Helmut Schreck (Computing, 1984)

On certain classes of fractional matchings. - Jörg R. Mühlbacher; Frank X. Steinparz; Gottfried Tinhofer (Discret. Appl. Math., 1984)

Rational solutions of the graphsack problem. - Gottfried Tinhofer (Math. Program., 1984)

Computing the characteristic polynomial of a tree. - Gottfried Tinhofer; Helmut Schreck (Computing, 1985)

Graph isomorphism and theorems of Birkhoff type. - Gottfried Tinhofer (Computing, 1986)

The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). - Gottfried Tinhofer; Helmut Schreck (Inf. Process. Lett., 1986)

Book reviews. - M. Nermuth; Gottfried Tinhofer; Richard W. Cottle (ZOR Methods Model. Oper. Res., 1988)

Strong tree-cographs are birkhoff graphs. - Gottfried Tinhofer (Discret. Appl. Math., 1989)

A branch and bound algorithm for the maximum clique problem. - Luitpold Babel; Gottfried Tinhofer (ZOR Methods Model. Oper. Res., 1990)

A note on compact graphs. - Gottfried Tinhofer (Discret. Appl. Math., 1991)

Direct Path Graph Isomorphism (Extended Abstract). - Luitpold Babel; Ilia N. Ponomarenko; Gottfried Tinhofer (WG, 1994)

Hard-to-color Graphs for Connected Sequential Colorings. - Luitpold Babel; Gottfried Tinhofer (Discret. Appl. Math., 1994)

Book review. - Gottfried Tinhofer; N. Katoh; W. Wenzel (Math. Methods Oper. Res., 1994)

Hamiltonicity in Graphs with Few P4's. - Winfried Hochstättler; Gottfried Tinhofer (Computing, 1995)

Bin-packing and Matchings in Threshold Graphs. - Gottfried Tinhofer (Discret. Appl. Math., 1995)

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. - Luitpold Babel; Ilia N. Ponomarenko; Gottfried Tinhofer (J. Algorithms, 1996)

Recognizing Circulant Graphs of Prime Order in Polynomial Time. - Mikhail E. Muzychuk; Gottfried Tinhofer (Electron. J. Comb., 1998)

Forestal algebras and algebraic forests (on a new class of weakly compact graphs). - Sergei Evdokimov 001; Ilia N. Ponomarenko; Gottfried Tinhofer (Discret. Math., 2000)

Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. - Mikhail E. Muzychuk; Gottfried Tinhofer (Electron. J. Comb., 2001)

Landscapes on spaces of trees. - Oliver Bastert; Daniel N. Rockmore; Peter F. Stadler; Gottfried Tinhofer (Appl. Math. Comput., 2002)