| Publication | Date of Publication | Type |
|---|
| Efficient parallel modular decomposition (extended abstract) | 2024-02-28 | Paper |
| Examples of clique closure systems | 2024-01-11 | Paper |
| The parallel complexity of elimination ordering procedures | 2024-01-05 | Paper |
| On domination elimination orderings and domination graphs | 2024-01-05 | Paper |
| Minimal elimination of planar graphs | 2022-12-09 | Paper |
| Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs | 2022-11-09 | Paper |
| New parallel algorithms for convex hull and triangulation in 3-dimensional space | 2022-08-18 | Paper |
| Maximum \(h\)-colourable subgraph problem in balanced graphs | 2016-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501779 | 2015-08-14 | Paper |
| A linear-time algorithm to compute a MAD tree of an interval graph | 2009-07-09 | Paper |
| Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree | 2009-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708982 | 2005-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470503 | 2004-07-01 | Paper |
| MAD trees and distance-hereditary graphs | 2003-09-25 | Paper |
| Minimal elimination ordering for graphs of bounded degree | 2002-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533374 | 2002-09-26 | Paper |
| Efficient and Practical Algorithms for Sequential Modular Decomposition | 2002-07-08 | Paper |
| The train marshalling problem | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525268 | 2001-01-21 | Paper |
| A characterization of strongly chordal graphs | 2000-11-02 | Paper |
| Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition | 2000-08-27 | Paper |
| A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs | 2000-07-19 | Paper |
| An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph | 2000-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232801 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268491 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839007 | 1999-01-14 | Paper |
| The parallel complexity of approximating the high degree subgraph problem | 1999-01-12 | Paper |
| Matching and multidimensional matching in chordal and strongly chordal graphs | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373674 | 1998-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373676 | 1998-04-08 | Paper |
| Transversal partitioning in balanced hypergraphs | 1997-11-18 | Paper |
| Efficient parallel recognition algorithms of cographs and distance hereditary graphs | 1995-10-09 | Paper |
| The Complexity of Multiterminal Cuts | 1994-10-17 | Paper |
| The parallel solution of domination problems on chordal and strongly chordal graphs | 1994-09-27 | Paper |
| Fast Parallel Recognition of Ultrametrics and Tree Metrics | 1994-08-14 | Paper |
| A parallel algorithm for computing Steiner trees in strongly chordal graphs | 1994-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281631 | 1994-06-20 | Paper |
| On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs | 1994-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138901 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202933 | 1993-09-06 | Paper |
| Query languages for hierarchic databases | 1993-01-17 | Paper |
| An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 | 1993-01-16 | Paper |
| Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202180 | 1989-01-01 | Paper |
| Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs | 1988-01-01 | Paper |
| On the existence of polynomial time algorithms for interpolation problems in propositional logic | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804207 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817599 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832048 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775538 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808118 | 1987-01-01 | Paper |
| Membership for growing context-sensitive grammars is polynomial | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3713561 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727407 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741099 | 1986-01-01 | Paper |
| Concerning two-adjacent context-free languages | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221973 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665094 | 1982-01-01 | Paper |
