Gottfried Tinhofer

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