
Search the dblp DataBase
Gottfried Tinhofer:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
Direct Path Graph Isomorphism (Extended Abstract). [Citation Graph (0, 0)][DBLP] WG, 1994, pp:395406 [Conf]
 Gottfried Tinhofer
On the Use of Some Almost Sure Graph Properties. [Citation Graph (0, 0)][DBLP] WG, 1980, pp:113126 [Conf]
 Mikhail E. Muzychuk, Gottfried Tinhofer
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp: [Journal]
 Mikhail E. Muzychuk, Gottfried Tinhofer
Recognizing Circulant Graphs of Prime Order in Polynomial Time. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1998, v:5, n:, pp: [Journal]
 Winfried Hochstättler, Gottfried Tinhofer
Hamiltonicity in Graphs with Few P4's. [Citation Graph (0, 0)][DBLP] Computing, 1995, v:54, n:3, pp:213226 [Journal]
 Luitpold Babel, Gottfried Tinhofer
Hardtocolor Graphs for Connected Sequential Colorings. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:51, n:12, pp:325 [Journal]
 Gottfried Tinhofer
Binpacking and Matchings in Threshold Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:62, n:13, pp:279289 [Journal]
 Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer
Forestal algebras and algebraic forests (on a new class of weakly compact graphs). [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:225, n:13, pp:149172 [Journal]
 Gottfried Tinhofer, H. Schreck
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:23, n:1, pp:1117 [Journal]
 Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:21, n:3, pp:542564 [Journal]
Zur Bestimmung der Automorphismen eines endlichen Graphen. [Citation Graph (, )][DBLP]
A note on compact graphs. [Citation Graph (, )][DBLP]
Strong treecographs are birkhoff graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
