| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5744543 | 2016-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3446271 | 2007-06-14 | Paper |
| On Posets of Page Number 2 | 2007-05-29 | Paper |
| On Page Number of N-free Posets | 2007-05-29 | Paper |
| Bandwidth and density for block graphs | 2000-11-02 | Paper |
| Hamiltonicity of amalgams | 2000-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4237086 | 1999-03-29 | Paper |
| Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees | 1996-12-01 | Paper |
| The jump number problem on interval orders: A 3/2 approximation algorithm | 1996-05-13 | Paper |
| On some new types of greedy chains and greedy linear extensions of partially ordered sets | 1995-12-13 | Paper |
| Maximal outerplanar graphs with perfect face-independent vertex covers | 1995-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304574 | 1994-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694751 | 1993-06-29 | Paper |
| Some properties of graph centroids | 1992-06-27 | Paper |
| Dominating cycles in Halin graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972023 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972104 | 1992-06-25 | Paper |
| In-trees and plane embeddings of outerplanar graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3198869 | 1990-01-01 | Paper |
| Sequential coloring versus Welsh-Powell bound | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731222 | 1989-01-01 | Paper |
| Some applications of graph theory to the study of polymer configuration | 1988-01-01 | Paper |
| An algorithm for solving the jump number problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3803152 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804190 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750888 | 1987-01-01 | Paper |
| Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758847 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783094 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800059 | 1987-01-01 | Paper |
| Efficient Vertex- and Edge-Coloring of Outerplanar Graphs | 1986-01-01 | Paper |
| An algorithmic characterization of total digraphs | 1986-01-01 | Paper |
| Interior graphs of maximal outerplane graphs | 1985-01-01 | Paper |
| Triangulated edge intersection graphs of paths in a tree | 1985-01-01 | Paper |
| The theorem on planar graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342593 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676161 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710545 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718741 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773904 | 1985-01-01 | Paper |
| An algorithm to recognize a middle graph | 1984-01-01 | Paper |
| Optimal constructions of reversible digraphs | 1984-01-01 | Paper |
| Minimizing the jump number for partially ordered sets: A graph-theoretic approach | 1984-01-01 | Paper |
| Series - parallel graphs and depth-first search trees | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325749 | 1984-01-01 | Paper |
| On the computational complexity of the minimum-dummy-activities problem in a pert network | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340898 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3039069 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3310645 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322145 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325753 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331236 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343454 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344027 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686741 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693257 | 1983-01-01 | Paper |
| The subgraph isomorphism problem for outerplanar graphs | 1982-01-01 | Paper |
| A labeling algorithm to recognize a line digraph and output its root graph | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041213 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3333072 | 1982-01-01 | Paper |
| On the fundamental cycle set graph | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665147 | 1982-01-01 | Paper |
| The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars | 1982-01-01 | Paper |
| The helly-type property of non-trivial intervals on a tree | 1981-01-01 | Paper |
| Optimal constructions of event-node networks | 1981-01-01 | Paper |
| An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3926607 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3927277 | 1981-01-01 | Paper |
| Minimum dominating cycles in outerplanar graphs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934412 | 1981-01-01 | Paper |
| The Bandwidth of Caterpillars with Hairs of Length 1 and 2 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3914785 | 1980-01-01 | Paper |
| Characterizations of outerplanar graphs | 1979-01-01 | Paper |
| On Hallian digraphs, permanents and transversals | 1979-01-01 | Paper |
| On cycle bases of a graph | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3856804 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866155 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869379 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886876 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200255 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3854536 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4179030 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200254 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3918147 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156165 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182537 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4108356 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124862 | 1976-01-01 | Paper |
| Computational experiences with some transitive closure algorithms | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4088851 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4094641 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109191 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4048488 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4049111 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4404442 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181720 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675146 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5682333 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401968 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181397 | 1973-01-01 | Paper |
| A new solvable case of the traveling salesman problem | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5666580 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5609865 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5634798 | 1970-01-01 | Paper |
