Gottfried Tinhofer

According to our database1, Gottfried Tinhofer authored at least 29 papers between 1971 and 2002.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Landscapes on spaces of trees.
Appl. Math. Comput., 2002

2001
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes.
Electron. J. Comb., 2001

2000
Forestal algebras and algebraic forests (on a new class of weakly compact graphs).
Discret. Math., 2000

1998
Recognizing Circulant Graphs of Prime Order in Polynomial Time.
Electron. J. Comb., 1998

1996
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs.
J. Algorithms, 1996

1995
Bin-packing and Matchings in Threshold Graphs.
Discret. Appl. Math., 1995

Hamiltonicity in Graphs with Few P4's.
Computing, 1995

1994
Book review.
Math. Methods Oper. Res., 1994

Hard-to-color Graphs for Connected Sequential Colorings.
Discret. Appl. Math., 1994

Direct Path Graph Isomorphism (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1991
A note on compact graphs.
Discret. Appl. Math., 1991

1990
A branch and bound algorithm for the maximum clique problem.
ZOR Methods Model. Oper. Res., 1990

1989
Strong tree-cographs are birkhoff graphs.
Discret. Appl. Math., 1989

1988
Book reviews.
ZOR Methods Model. Oper. Res., 1988

1986
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n).
Inf. Process. Lett., 1986

Graph isomorphism and theorems of Birkhoff type.
Computing, 1986

1985
Computing the characteristic polynomial of a tree.
Computing, 1985

1984
Rational solutions of the graphsack problem.
Math. Program., 1984

On certain classes of fractional matchings.
Discret. Appl. Math., 1984

Linear time tree codes.
Computing, 1984

A probabilistic analysis of some greedy cardinality matching algorithms.
Ann. Oper. Res., 1984

1981
A Travelling Salesman Problem with Additional Constraints.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

1980
On the Use of Some Almost Sure Graph Properties.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1977
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie.
Computing, 1977

1975
Zur Bestimmung der Automorphismen eines endlichen Graphen.
Computing, 1975

1973
Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke.
Computing, 1973

1972
Über die Bestimmung von Kernen in endlichen Graphen.
Computing, 1972

1971
Flüsse in antisymmetrischen Netzwerken.
Computing, 1971

Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen.
Computing, 1971


  Loading...