Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gottfried Tinhofer
2000 – 2009
- 2001
[j12]Mikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electr. J. Comb. 8(1) (2001)- 2000
- [j11]Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer: Forestal algebras and algebraic forests (on a new class of weakly compact graphs). Discrete Mathematics 225(1-3): 149-172 (2000)
1990 – 1999
- 1998
- [j10]Mikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electr. J. Comb. 5 (1998)
- 1996
- [j9]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21(3): 542-564 (1996)
- 1995
- [j8]Winfried Hochstättler, Gottfried Tinhofer: Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995)
- [j7]Gottfried Tinhofer: Bin-packing and Matchings in Threshold Graphs. Discrete Applied Mathematics 62(1-3): 279-289 (1995)
- [e2]Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (Eds.): Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings. Lecture Notes in Computer Science 903, Springer 1995, ISBN 3-540-59071-4
- 1994
- [j6]Luitpold Babel, Gottfried Tinhofer: Hard-to-color Graphs for Connected Sequential Colorings. Discrete Applied Mathematics 51(1-2): 3-25 (1994)
- [j5]
- [c2]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406
- 1991
- [j4]
1980 – 1989
- 1989
- [j3]Gottfried Tinhofer: Strong tree-cographs are birkhoff graphs. Discrete Applied Mathematics 22(3): 275-288 (1989)
- 1987
- [e1]Gottfried Tinhofer, Gunther Schmidt (Eds.): Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings. Lecture Notes in Computer Science 246, Springer 1987, ISBN 3-540-17218-1
- 1986
- [j2]Gottfried Tinhofer, H. Schreck: The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). Inf. Process. Lett. 23(1): 11-17 (1986)
- 1980
- [c1]
1970 – 1979
- 1975
- [j1]Gottfried Tinhofer: Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15(2): 147-156 (1975)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:25 CET by the dblp team