The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gottfried Tinhofer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
    Direct Path Graph Isomorphism (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:395-406 [Conf]
  2. Gottfried Tinhofer
    On the Use of Some Almost Sure Graph Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:113-126 [Conf]
  3. 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]
  4. 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]
  5. Winfried Hochstättler, Gottfried Tinhofer
    Hamiltonicity in Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    Computing, 1995, v:54, n:3, pp:213-226 [Journal]
  6. Luitpold Babel, Gottfried Tinhofer
    Hard-to-color Graphs for Connected Sequential Colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:3-25 [Journal]
  7. Gottfried Tinhofer
    Bin-packing and Matchings in Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:279-289 [Journal]
  8. 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:1-3, pp:149-172 [Journal]
  9. 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:11-17 [Journal]
  10. 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:542-564 [Journal]

  11. Zur Bestimmung der Automorphismen eines endlichen Graphen. [Citation Graph (, )][DBLP]


  12. A note on compact graphs. [Citation Graph (, )][DBLP]


  13. Strong tree-cographs are birkhoff graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002