Gottfried Tinhofer

Publication Activity (10 Years)

Years Active: 1971-2002
Publications (10 Years): 0

Publications

Oliver Bastert, Daniel N. Rockmore, Peter F. Stadler, Gottfried Tinhofer
Landscapes on spaces of trees. Appl. Math. Comput. 131 (2-3) (2002)
Mikhail E. Muzychuk, Gottfried Tinhofer
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electron. J. Comb. 8 (1) (2001)
Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer
Forestal algebras and algebraic forests (on a new class of weakly compact graphs). Discret. Math. 225 (1-3) (2000)
Mikhail E. Muzychuk, Gottfried Tinhofer
Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electron. J. Comb. 5 (1998)
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21 (3) (1996)
Gottfried Tinhofer
Bin-packing and Matchings in Threshold Graphs. Discret. Appl. Math. 62 (1-3) (1995)
Winfried Hochstättler, Gottfried Tinhofer
Hamiltonicity in Graphs with Few P4's. Computing 54 (3) (1995)
Gottfried Tinhofer, N. Katoh, W. Wenzel
Book review. Math. Methods Oper. Res. 40 (3) (1994)
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
Direct Path Graph Isomorphism (Extended Abstract). WG (1994)
Luitpold Babel, Gottfried Tinhofer
Hard-to-color Graphs for Connected Sequential Colorings. Discret. Appl. Math. 51 (1-2) (1994)
Gottfried Tinhofer
A note on compact graphs. Discret. Appl. Math. 30 (2-3) (1991)
Luitpold Babel, Gottfried Tinhofer
A branch and bound algorithm for the maximum clique problem. ZOR Methods Model. Oper. Res. 34 (3) (1990)
Gottfried Tinhofer
Strong tree-cographs are birkhoff graphs. Discret. Appl. Math. 22 (3) (1989)
M. Nermuth, Gottfried Tinhofer, Richard W. Cottle
Book reviews. ZOR Methods Model. Oper. Res. 32 (2) (1988)
Gottfried Tinhofer, Helmut Schreck
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). Inf. Process. Lett. 23 (1) (1986)
Gottfried Tinhofer
Graph isomorphism and theorems of Birkhoff type. Computing 36 (4) (1986)
Gottfried Tinhofer, Helmut Schreck
Computing the characteristic polynomial of a tree. Computing 35 (2) (1985)
Gottfried Tinhofer
Rational solutions of the graphsack problem. Math. Program. 28 (3) (1984)
Gottfried Tinhofer, Helmut Schreck
Linear time tree codes. Computing 33 (3-4) (1984)
Jörg R. Mühlbacher, Frank X. Steinparz, Gottfried Tinhofer
On certain classes of fractional matchings. Discret. Appl. Math. 9 (3) (1984)
Gottfried Tinhofer
A probabilistic analysis of some greedy cardinality matching algorithms. Ann. Oper. Res. 1 (3) (1984)
Gottfried Tinhofer
A Travelling Salesman Problem with Additional Constraints. WG (1981)
Gottfried Tinhofer
On the Use of Some Almost Sure Graph Properties. WG (1980)
Josef Hinteregger, Gottfried Tinhofer
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie. Computing 18 (4) (1977)
Gottfried Tinhofer
Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15 (2) (1975)
Gottfried Tinhofer
Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke. Computing 11 (1) (1973)
Gottfried Tinhofer
Über die Bestimmung von Kernen in endlichen Graphen. Computing 9 (2) (1972)
Gottfried Tinhofer
Flüsse in antisymmetrischen Netzwerken. Computing 8 (1-2) (1971)
Gottfried Tinhofer
Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. Computing 8 (1-2) (1971)