| Publication | Date of Publication | Type |
|---|
| A generalized approach for train marshalling | 2024-09-17 | Paper |
Efficient parallel modular decomposition (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Examples of clique closure systems
Formal Concept Analysis | 2024-01-11 | Paper |
On domination elimination orderings and domination graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
The parallel complexity of elimination ordering procedures
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
| The parallel complexity of approximating the High Degree Subgraph problem | 2023-03-21 | Paper |
Minimal elimination of planar graphs
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
Lecture Notes in Computer Science | 2022-11-09 | Paper |
New parallel algorithms for convex hull and triangulation in 3-dimensional space
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Maximum \(h\)-colourable subgraph problem in balanced graphs
Information Processing Letters | 2016-06-09 | Paper |
| scientific article; zbMATH DE number 6472575 (Why is no real title available?) | 2015-08-14 | Paper |
A linear-time algorithm to compute a MAD tree of an interval graph
Information Processing Letters | 2009-07-09 | Paper |
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
Theoretical Computer Science | 2009-01-08 | Paper |
| scientific article; zbMATH DE number 2230915 (Why is no real title available?) | 2005-11-21 | Paper |
| scientific article; zbMATH DE number 2077119 (Why is no real title available?) | 2004-07-01 | Paper |
MAD trees and distance-hereditary graphs
Discrete Applied Mathematics | 2003-09-25 | Paper |
Minimal elimination ordering for graphs of bounded degree
Discrete Applied Mathematics | 2002-11-24 | Paper |
| scientific article; zbMATH DE number 1753166 (Why is no real title available?) | 2002-09-26 | Paper |
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms | 2002-07-08 | Paper |
The train marshalling problem
Discrete Applied Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1554939 (Why is no real title available?) | 2001-01-21 | Paper |
A characterization of strongly chordal graphs
Discrete Mathematics | 2000-11-02 | Paper |
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
Journal of Algorithms | 2000-08-27 | Paper |
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Discrete Applied Mathematics | 2000-07-19 | Paper |
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Theoretical Computer Science | 2000-06-15 | Paper |
| scientific article; zbMATH DE number 1262810 (Why is no real title available?) | 2000-05-18 | Paper |
| scientific article; zbMATH DE number 1354176 (Why is no real title available?) | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1189242 (Why is no real title available?) | 1999-01-14 | Paper |
The parallel complexity of approximating the high degree subgraph problem
Theoretical Computer Science | 1999-01-12 | Paper |
Matching and multidimensional matching in chordal and strongly chordal graphs
Discrete Applied Mathematics | 1998-07-28 | Paper |
| scientific article; zbMATH DE number 1107726 (Why is no real title available?) | 1998-06-23 | Paper |
| scientific article; zbMATH DE number 1107728 (Why is no real title available?) | 1998-04-08 | Paper |
Transversal partitioning in balanced hypergraphs
Discrete Applied Mathematics | 1997-11-18 | Paper |
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Discrete Applied Mathematics | 1995-10-09 | Paper |
The Complexity of Multiterminal Cuts
SIAM Journal on Computing | 1994-10-17 | Paper |
The parallel solution of domination problems on chordal and strongly chordal graphs
Discrete Applied Mathematics | 1994-09-27 | Paper |
Fast Parallel Recognition of Ultrametrics and Tree Metrics
SIAM Journal on Discrete Mathematics | 1994-08-14 | Paper |
A parallel algorithm for computing Steiner trees in strongly chordal graphs
Discrete Applied Mathematics | 1994-07-31 | Paper |
| scientific article; zbMATH DE number 512919 (Why is no real title available?) | 1994-06-20 | Paper |
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
Journal of Algorithms | 1994-03-13 | Paper |
| scientific article; zbMATH DE number 432771 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 408789 (Why is no real title available?) | 1993-09-06 | Paper |
Query languages for hierarchic databases
Information and Computation | 1993-01-17 | Paper |
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
Information Processing Letters | 1993-01-16 | Paper |
Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
Journal of Computer and System Sciences | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4193660 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4072403 (Why is no real title available?) | 1988-01-01 | Paper |
Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
Theoretical Computer Science | 1988-01-01 | Paper |
On the existence of polynomial time algorithms for interpolation problems in propositional logic
Notre Dame Journal of Formal Logic | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4108154 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4090786 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4035805 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4077265 (Why is no real title available?) | 1987-01-01 | Paper |
Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3958759 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3942990 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3976395 (Why is no real title available?) | 1986-01-01 | Paper |
Concerning two-adjacent context-free languages
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3889514 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3817692 (Why is no real title available?) | 1982-01-01 | Paper |
