| Publication | Date of Publication | Type |
|---|
| Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality | 2024-01-05 | Paper |
| Efficient parallel algorithms for some tree layout problems | 2023-12-12 | Paper |
| Deterministic broadcasting in ad hoc radio networks | 2020-12-03 | Paper |
| Problems on pairs of trees and the four colour problem of planar graphs | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084795 | 2011-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3655285 | 2010-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441058 | 2008-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441063 | 2008-02-07 | Paper |
| Rotation sequences and edge-colouring of binary tree pairs | 2005-01-11 | Paper |
| Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708556 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542810 | 2002-10-14 | Paper |
| DNA-based logic | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941888 | 2002-03-04 | Paper |
| Efficient web searching using temporal factors | 2002-03-03 | Paper |
| Leafy spanning trees in hypercubes | 2002-01-02 | Paper |
| Complexity-theoretic models of phase transitions in search problems | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952711 | 2000-05-10 | Paper |
| Hybrid Graph Theory and Network Analysis | 1999-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224899 | 1999-01-17 | Paper |
| Parallel algorithms for the minimum cut and the minimum length tree layout problems | 1998-07-22 | Paper |
| Double independence and tree pairs in graphs | 1998-06-29 | Paper |
| Guthrie's problem: new equivalences and rapid reductions | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875216 | 1996-04-28 | Paper |
| Dense edge-disjoint embedding of complete binary trees in the hypercube | 1993-06-29 | Paper |
| Superperfect pairs of trees in graphs | 1993-06-29 | Paper |
| Perfect pairs of trees associated with a prescribed tree: An algorithmic approach | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992991 | 1993-01-23 | Paper |
| Perfect pairs of trees in graphs | 1992-06-28 | Paper |
| The balanced binary tree technique on mesh-connected computers | 1991-01-01 | Paper |
| Optimally edge-colouring outerplanar graphs is in NC | 1990-01-01 | Paper |
| Optimal parallel algorithms for dynamic expression evaluation and context-free recognition | 1989-01-01 | Paper |
| A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation | 1989-01-01 | Paper |
| Parallel O(log n) time edge-colouring of trees and Halin graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783598 | 1987-01-01 | Paper |
| On the decidability of some problems about rational subsets of free partially commutative monoids | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761691 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684121 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5515818 | 1962-01-01 | Paper |
| Running Pegasus Autocode Programs on Mercury | 1961-01-01 | Paper |
| A Program for the Automatic Integration of Differential Equations using the Method of Taylor Series | 1960-01-01 | Paper |
