Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2001 | ||
---|---|---|

15 | Mikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electr. J. Comb. 8(1): (2001) | |

2000 | ||

14 | 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) | |

1998 | ||

13 | Mikhail E. Muzychuk, Gottfried Tinhofer: Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electr. J. Comb. 5: (1998) | |

1996 | ||

12 | 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 | ||

11 | Ernst 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 | |

10 | Winfried Hochstättler, Gottfried Tinhofer: Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995) | |

9 | Gottfried Tinhofer: Bin-packing and Matchings in Threshold Graphs. Discrete Applied Mathematics 62(1-3): 279-289 (1995) | |

1994 | ||

8 | Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer: Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406 | |

7 | Luitpold Babel, Gottfried Tinhofer: Hard-to-color Graphs for Connected Sequential Colorings. Discrete Applied Mathematics 51(1-2): 3-25 (1994) | |

1991 | ||

6 | Gottfried Tinhofer: A note on compact graphs. Discrete Applied Mathematics 30(2-3): 253-264 (1991) | |

1989 | ||

5 | Gottfried Tinhofer: Strong tree-cographs are birkhoff graphs. Discrete Applied Mathematics 22(3): 275-288 (1989) | |

1987 | ||

4 | Gottfried Tinhofer, Gunther Schmidt: Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings Springer 1987 | |

1986 | ||

3 | 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 | ||

2 | Gottfried Tinhofer: On the Use of Some Almost Sure Graph Properties. WG 1980: 113-126 | |

1975 | ||

1 | Gottfried Tinhofer: Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15(2): 147-156 (1975) |

1 | Luitpold Babel | [7] [8] [12] |

2 | Sergei Evdokimov | [14] |

3 | Winfried Hochstättler | [10] |

4 | Ernst W. Mayr | [11] |

5 | Mikhail E. Muzychuk | [13] [15] |

6 | Ilia N. Ponomarenko | [8] [12] [14] |

7 | Gunther Schmidt | [4] [11] |

8 | H. Schreck | [3] |