Gottfried Tinhofer

Available identifiers

zbMath Open tinhofer.gottfriedMaRDI QIDQ196797

List of research outcomes

Publication	Date of Publication	Type
Directed path graph isomorphism	2024-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4800081	2003-04-01	Paper
https://portal.mardi4nfdi.de/entity/Q4800083	2003-04-01	Paper
Landscapes on spaces of trees	2003-01-28	Paper
Recognizing circulant graphs in polynomial time: An application of association schemes	2001-08-13	Paper
Forestal algebras and algebraic forests (on a new class of weakly compact graphs)	2001-06-04	Paper
Recognizing circulant graphs of prime order in polynomial time	1998-05-13	Paper
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs	1996-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4886695	1996-07-18	Paper
Bin-packing and matchings in threshold graphs	1996-05-30	Paper
https://portal.mardi4nfdi.de/entity/Q3139140	1996-02-18	Paper
Hamiltonicity in graphs with few \(P_ 4\)'s	1995-08-15	Paper
Hard-to-color graphs for connected sequential colorings	1995-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q3143076	1993-12-14	Paper
A note on compact graphs	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3971979	1992-06-25	Paper
A branch and bound algorithm for the maximum clique problem	1990-01-01	Paper
Strong tree-cographs are Birkhoff graphs	1989-01-01	Paper
A note on certain subpolytopes of the assignment polytope associated with circulant graphs	1988-01-01	Paper
Graph isomorphism and theorems of Birkhoff type	1986-01-01	Paper
The bounded subset sum problem is almost everywhere randomly decidable in O(n)	1986-01-01	Paper
Computing the characteristic polynomial of a tree	1985-01-01	Paper
An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure	1985-01-01	Paper
On certain classes of fractional matchings	1984-01-01	Paper
Linear time tree codes	1984-01-01	Paper
Rational solutions of the graphsack problem	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3712127	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3824126	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3316964	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3318518	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3915029	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3872513	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3939594	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3853680	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4171563	1978-01-01	Paper
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4132446	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4105691	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4141837	1976-01-01	Paper
Zur Bestimmung der Automorphismen eines endlichen Graphen	1975-01-01	Paper
Der Konvergenzbereich einer Reihendarstellung für Polynomwurzeln	1975-01-01	Paper
Der Out-of-Kilter-Algorithmus für antisymmetrische Netzwerke	1973-01-01	Paper
Eine strenge Begründung dynamischer Programme und die Bestimmung ausgezeichneter Knoten- oder Kantenmengen in endlichen Graphen	1973-01-01	Paper
Über eine Anwendung der L<scp>AGRANGES</scp>chen Reihe	1973-01-01	Paper
Über die Bestimmung von Kernen in endlichen Graphen	1972-01-01	Paper
Flüsse in antisymmetrischen Netzwerken. (Flows in anti-symmetric networks.)	1971-01-01	Paper
Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. (Multi-dimensional assignment problems and network flows with given sets of values.)	1971-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gottfried Tinhofer