Gottfried Tinhofer Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2001
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electr. J. Comb. 8(1): (2001)
2000
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergei 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)
1998
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electr. J. Comb. 5: (1998)
1996
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuitpold 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
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErnst W. Mayr, Gunther Schmidt, Gottfried Tinhofer: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings Springer 1995
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWinfried Hochstättler, Gottfried Tinhofer: Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer: Bin-packing and Matchings in Threshold Graphs. Discrete Applied Mathematics 62(1-3): 279-289 (1995)
1994
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuitpold Babel, Gottfried Tinhofer: Hard-to-color Graphs for Connected Sequential Colorings. Discrete Applied Mathematics 51(1-2): 3-25 (1994)
1991
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer: A note on compact graphs. Discrete Applied Mathematics 30(2-3): 253-264 (1991)
1989
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer: Strong tree-cographs are birkhoff graphs. Discrete Applied Mathematics 22(3): 275-288 (1989)
1987
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer, Gunther Schmidt: Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings Springer 1987
1986
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer: On the Use of Some Almost Sure Graph Properties. WG 1980: 113-126
1975
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGottfried Tinhofer: Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15(2): 147-156 (1975)

Coauthor Index

1Luitpold Babel [7] [8] [12]
2Sergei Evdokimov [14]
3Winfried Hochstättler [10]
4Ernst W. Mayr [11]
5Mikhail E. Muzychuk [13] [15]
6Ilia N. Ponomarenko [8] [12] [14]
7Gunther Schmidt [4] [11]
8H. Schreck [3]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)