Gottfried Tinhofer

发表

Zur Bestimmung der Automorphismen eines endlichen Graphen

Gottfried Tinhofer, 2005, Computing.

Über die Bestimmung von Kernen in endlichen Graphen

Gottfried Tinhofer, 2005, Computing.

Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie

Gottfried Tinhofer, Josef Hinteregger, 2005, Computing.

A Travelling Salesman Problem with Additional Constraints

Gottfried Tinhofer, 1981, WG.

Hamiltonicity in graphs with fewP4's

Gottfried Tinhofer, Winfried Hochstättler, 2005, Computing.

Flüsse in antisymmetrischen Netzwerken

Gottfried Tinhofer, G. Tinhofer, 1971, Computing.

Bin-packing and Matchings in Threshold Graphs

Gottfried Tinhofer, 1995, Discret. Appl. Math..

Book review

Gottfried Tinhofer, N. Katoh, W. Wenzel, 1994, Math. Methods Oper. Res..

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

Gottfried Tinhofer, Ilia N. Ponomarenko, Luitpold Babel, 1996, J. Algorithms.

Landscapes on spaces of trees

Peter F. Stadler, Daniel N. Rockmore, Gottfried Tinhofer, 2002, Appl. Math. Comput..

Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen

Gottfried Tinhofer, G. Tinhofer, 1971, Computing.

Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings

Gunther Schmidt, Gottfried Tinhofer, 1987, WG.

Linear time tree codes

Gottfried Tinhofer, Helmut Schreck, G. Tinhofer, 1984, Computing.

Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke

Gottfried Tinhofer, G. Tinhofer, 1973, Computing.

A note on compact graphs

Gottfried Tinhofer, G. Tinhofer, 1991, Discret. Appl. Math..

Graph isomorphism and theorems of Birkhoff type

Gottfried Tinhofer, G. Tinhofer, 1986, Computing.

On certain classes of fractional matchings

Gottfried Tinhofer, Jörg R. Mühlbacher, Frank X. Steinparz, 1984, Discret. Appl. Math..

Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes

Mikhail E. Muzychuk, Gottfried Tinhofer, M. Muzychuk, 2001, Electron. J. Comb..

Forestal algebras and algebraic forests (on a new class of weakly compact graphs)

Gottfried Tinhofer, Sergei Evdokimov, Ilia N. Ponomarenko, 2000, Discret. Math..

A branch and bound algorithm for the maximum clique problem

Gottfried Tinhofer, Luitpold Babel, Luitpold Babel, 1990, ZOR Methods Model. Oper. Res..

Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science

Gunther Schmidt, Gottfried Tinhofer, 1986 .

Direct Path Graph Isomorphism (Extended Abstract)

Gottfried Tinhofer, Ilia N. Ponomarenko, Luitpold Babel, 1994, WG.

The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n)

Gottfried Tinhofer, Helmut Schreck, 1986, Inf. Process. Lett..

Hard-to-color Graphs for Connected Sequential Colorings

Gottfried Tinhofer, Luitpold Babel, Luitpold Babel, 1994, Discret. Appl. Math..

Directed path graph isomorphism

Gottfried Tinhofer, Ilia Ponomarenko, Luitpold Babel, 1994 .

Graph-theoretic concepts in computer science : international workshop WG '86, Bernried, Federal Republic of Germany, June 17-19, 1986 : proceedings

Gunther Schmidt, Gottfried Tinhofer, 1987 .

A probabilistic analysis of some greedy cardinality matching algorithms

Gottfried Tinhofer, 1984, Ann. Oper. Res..

Graph-theoretic concepts in computer science : 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994 : proceedings

Gunther Schmidt, Ernst W. Mayr, Gottfried Tinhofer, 1995 .

Recognizing Circulant Graphs of Prime Order in Polynomial Time

Mikhail E. Muzychuk, Gottfried Tinhofer, M. Muzychuk, 1998, Electron. J. Comb..

On the Use of Some Almost Sure Graph Properties

Gottfried Tinhofer, 1980, WG.

International Workshop WG '86 on Graph-theoretic concepts in computer science

Gunther Schmidt, Gottfried Tinhofer, 1987 .

Rational solutions of the graphsack problem

Gottfried Tinhofer, 1984, Math. Program..

Book reviews

Gottfried Tinhofer, R. W. Cottle, M. Nermuth, 1988, ZOR Methods Model. Oper. Res..

Strong tree-cographs are birkhoff graphs

Gottfried Tinhofer, G. Tinhofer, 1989, Discret. Appl. Math..

Computing the characteristic polynomial of a tree

Gottfried Tinhofer, Helmut Schreck, G. Tinhofer, 1985, Computing.

Investigation of Hydrogen Bond Patterns∶ A Review of Mathematical Tools For the Graph Set Approach

Gottfried Tinhofer, Joel Bernstein, J. Bernstein, 2002 .

Generating graphs uniformly at random

Gottfried Tinhofer, Gottfried Tinhofer, 1990 .