default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGottfried Tinhofer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j26]Oliver Bastert, Daniel N. Rockmore, Peter F. Stadler
, Gottfried Tinhofer:
Landscapes on spaces of trees. Appl. Math. Comput. 131(2-3): 439-459 (2002)- 2001
- [j25]Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electron. J. Comb. 8(1) (2001) - 2000
- [j24]Sergei Evdokimov, Ilia N. Ponomarenko, Gottfried Tinhofer:
Forestal algebras and algebraic forests (on a new class of weakly compact graphs). Discret. Math. 225(1-3): 149-172 (2000)
1990 – 1999
- 1998
- [j23]Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electron. J. Comb. 5 (1998) - 1996
- [j22]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
- [j21]Winfried Hochstättler, Gottfried Tinhofer:
Hamiltonicity in Graphs with Few P4's. Computing 54(3): 213-226 (1995) - [j20]Gottfried Tinhofer:
Bin-packing and Matchings in Threshold Graphs. Discret. Appl. Math. 62(1-3): 279-289 (1995) - [e2]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. Lecture Notes in Computer Science 903, Springer 1995, ISBN 3-540-59071-4 [contents] - 1994
- [j19]Luitpold Babel, Gottfried Tinhofer:
Hard-to-color Graphs for Connected Sequential Colorings. Discret. Appl. Math. 51(1-2): 3-25 (1994) - [j18]Gottfried Tinhofer, N. Katoh, W. Wenzel:
Book review. Math. Methods Oper. Res. 40(3): 334-338 (1994) - [c3]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406 - 1991
- [j17]Gottfried Tinhofer:
A note on compact graphs. Discret. Appl. Math. 30(2-3): 253-264 (1991) - 1990
- [j16]Luitpold Babel, Gottfried Tinhofer:
A branch and bound algorithm for the maximum clique problem. ZOR Methods Model. Oper. Res. 34(3): 207-217 (1990)
1980 – 1989
- 1989
- [j15]Gottfried Tinhofer:
Strong tree-cographs are birkhoff graphs. Discret. Appl. Math. 22(3): 275-288 (1989) - 1988
- [j14]M. Nermuth, Gottfried Tinhofer, Richard W. Cottle:
Book reviews. ZOR Methods Model. Oper. Res. 32(2): 107-110 (1988) - 1987
- [e1]Gottfried Tinhofer, Gunther Schmidt:
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 [contents] - 1986
- [j13]Gottfried Tinhofer:
Graph isomorphism and theorems of Birkhoff type. Computing 36(4): 285-300 (1986) - [j12]Gottfried Tinhofer, Helmut Schreck:
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). Inf. Process. Lett. 23(1): 11-17 (1986) - 1985
- [j11]Gottfried Tinhofer, Helmut Schreck:
Computing the characteristic polynomial of a tree. Computing 35(2): 113-125 (1985) - 1984
- [j10]Gottfried Tinhofer:
A probabilistic analysis of some greedy cardinality matching algorithms. Ann. Oper. Res. 1(3): 239-254 (1984) - [j9]Gottfried Tinhofer, Helmut Schreck:
Linear time tree codes. Computing 33(3-4): 211-225 (1984) - [j8]Jörg R. Mühlbacher, Frank X. Steinparz, Gottfried Tinhofer:
On certain classes of fractional matchings. Discret. Appl. Math. 9(3): 235-244 (1984) - [j7]Gottfried Tinhofer:
Rational solutions of the graphsack problem. Math. Program. 28(3): 337-348 (1984) - 1981
- [c2]Gottfried Tinhofer:
A Travelling Salesman Problem with Additional Constraints. WG 1981: 75-86 - 1980
- [c1]Gottfried Tinhofer:
On the Use of Some Almost Sure Graph Properties. WG 1980: 113-126
1970 – 1979
- 1977
- [j6]Josef Hinteregger, Gottfried Tinhofer:
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie. Computing 18(4): 351-359 (1977) - 1975
- [j5]Gottfried Tinhofer:
Zur Bestimmung der Automorphismen eines endlichen Graphen. Computing 15(2): 147-156 (1975) - 1973
- [j4]Gottfried Tinhofer:
Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke. Computing 11(1): 45-50 (1973) - 1972
- [j3]Gottfried Tinhofer:
Über die Bestimmung von Kernen in endlichen Graphen. Computing 9(2): 139-147 (1972) - 1971
- [j2]Gottfried Tinhofer:
Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. Computing 8(1-2): 113-120 (1971) - [j1]Gottfried Tinhofer:
Flüsse in antisymmetrischen Netzwerken. Computing 8(1-2): 191-199 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
