| Publication | Date of Publication | Type |
|---|
Directed path graph isomorphism
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
| scientific article; zbMATH DE number 1890109 (Why is no real title available?) | 2003-04-01 | Paper |
| scientific article; zbMATH DE number 1890111 (Why is no real title available?) | 2003-04-01 | Paper |
Landscapes on spaces of trees
Applied Mathematics and Computation | 2003-01-28 | Paper |
Recognizing circulant graphs in polynomial time: An application of association schemes
The Electronic Journal of Combinatorics | 2001-08-13 | Paper |
Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
Discrete Mathematics | 2001-06-04 | Paper |
Recognizing circulant graphs of prime order in polynomial time
The Electronic Journal of Combinatorics | 1998-05-13 | Paper |
Recognizing circulant graphs of prime order in polynomial time
The Electronic Journal of Combinatorics | 1998-05-13 | Paper |
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
Journal of Algorithms | 1996-12-08 | Paper |
| scientific article; zbMATH DE number 907054 (Why is no real title available?) | 1996-07-18 | Paper |
Bin-packing and matchings in threshold graphs
Discrete Applied Mathematics | 1996-05-30 | Paper |
| scientific article; zbMATH DE number 432995 (Why is no real title available?) | 1996-02-18 | Paper |
Hamiltonicity in graphs with few \(P_ 4\)'s
Computing | 1995-08-15 | Paper |
Hard-to-color graphs for connected sequential colorings
Discrete Applied Mathematics | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 459046 (Why is no real title available?) | 1993-12-14 | Paper |
A note on compact graphs
Discrete Applied Mathematics | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 15335 (Why is no real title available?) | 1992-06-25 | Paper |
A branch and bound algorithm for the maximum clique problem
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research | 1990-01-01 | Paper |
Strong tree-cographs are Birkhoff graphs
Discrete Applied Mathematics | 1989-01-01 | Paper |
A note on certain subpolytopes of the assignment polytope associated with circulant graphs
Linear Algebra and its Applications | 1988-01-01 | Paper |
Graph isomorphism and theorems of Birkhoff type
Computing | 1986-01-01 | Paper |
The bounded subset sum problem is almost everywhere randomly decidable in O(n)
Information Processing Letters | 1986-01-01 | Paper |
Computing the characteristic polynomial of a tree
Computing | 1985-01-01 | Paper |
An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure
European Journal of Operational Research | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4099072 (Why is no real title available?) | 1984-01-01 | Paper |
On certain classes of fractional matchings
Discrete Applied Mathematics | 1984-01-01 | Paper |
Linear time tree codes
Computing | 1984-01-01 | Paper |
Rational solutions of the graphsack problem
Mathematical Programming | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3939098 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3847222 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3848953 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3726411 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3675956 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3756239 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3654183 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3605919 (Why is no real title available?) | 1978-01-01 | Paper |
Zerlegung der Knotenmengen von Graphen zum Nachweis der Isomorphie
Computing | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3559475 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3528255 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3570486 (Why is no real title available?) | 1976-01-01 | Paper |
Zur Bestimmung der Automorphismen eines endlichen Graphen
Computing | 1975-01-01 | Paper |
Der Konvergenzbereich einer Reihendarstellung für Polynomwurzeln
Mathematische Nachrichten | 1975-01-01 | Paper |
Über eine Anwendung der L<scp>AGRANGES</scp>chen Reihe
Mathematische Nachrichten | 1973-01-01 | Paper |
Der Out-of-Kilter-Algorithmus für antisymmetrische Netzwerke
Computing | 1973-01-01 | Paper |
Eine strenge Begründung dynamischer Programme und die Bestimmung ausgezeichneter Knoten- oder Kantenmengen in endlichen Graphen
Monatshefte für Mathematik | 1973-01-01 | Paper |
Über die Bestimmung von Kernen in endlichen Graphen
Computing | 1972-01-01 | Paper |
Flüsse in antisymmetrischen Netzwerken. (Flows in anti-symmetric networks.)
Computing | 1971-01-01 | Paper |
Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. (Multi-dimensional assignment problems and network flows with given sets of values.)
Computing | 1971-01-01 | Paper |
