| Publication | Date of Publication | Type |
|---|
Verification of a certificate for weakly chordal graphs
Discrete Applied Mathematics | 2025-09-16 | Paper |
Interval-permutation segment graphs
Congressus Numerantium | 2025-01-02 | Paper |
scientific article; zbMATH DE number 7378386 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| Interval-Permutation Segment Graphs | 2019-08-27 | Paper |
On recognition of threshold tolerance graphs and their complements
Discrete Applied Mathematics | 2016-11-24 | Paper |
| Solving problems on special classes of graphs | 2016-07-01 | Paper |
Recognizing threshold tolerance graphs in O(n^2) time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6472574 (Why is no real title available?) | 2015-08-14 | Paper |
Isomorphism of graph classes related to the circular-ones property
(available as arXiv preprint) | 2014-02-14 | Paper |
| Isomorphism of graph classes related to the circular-ones property | 2014-02-14 | Paper |
Finding a sun in building-free graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
On graphs without a \(C_{4}\) or a diamond
Discrete Applied Mathematics | 2011-04-19 | Paper |
Linear-time recognition of Helly circular-arc models and graphs
Algorithmica | 2011-03-02 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
A new characterization of HH-free graphs
Discrete Mathematics | 2008-09-04 | Paper |
Finding Triangles in Restricted Classes of Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing | 2007-05-03 | Paper |
Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)
SIAM Journal on Computing | 2007-05-03 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Algorithms for the homogeneous set sandwich problem
Algorithmica | 2006-11-06 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Polynomial time recognition of unit circular-arc graphs
Journal of Algorithms | 2006-04-28 | Paper |
Minimal fill in O(\(n^{2.69}\)) time
Discrete Mathematics | 2006-03-29 | Paper |
On algorithms for (P₅, gem)-free graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Recognition algorithms for orders of small width and graphs of small Dilworth number
Order | 2005-04-07 | Paper |
| scientific article; zbMATH DE number 2119749 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079335 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079402 (Why is no real title available?) | 2004-07-28 | Paper |
Recognizing quasi-triangulated graphs.
Discrete Applied Mathematics | 2004-03-29 | Paper |
Robust algorithms for restricted domains
Journal of Algorithms | 2004-03-14 | Paper |
A note on computing graph closures
Discrete Mathematics | 2004-02-14 | Paper |
Scalar aggregation in inconsistent databases.
Theoretical Computer Science | 2003-08-17 | Paper |
Efficient graph representations
Fields Institute Monographs | 2003-07-15 | Paper |
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics | 2003-06-10 | Paper |
| A polynomial time recognition algorithm for probe interval graphs | 2002-07-22 | Paper |
Forbidden subgraph decomposition
Discrete Mathematics | 2002-05-28 | Paper |
Domination graphs: Examples and counterexamples
Discrete Applied Mathematics | 2002-04-08 | Paper |
| Robust algorithms for restricted domains | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1508917 (Why is no real title available?) | 2000-09-18 | Paper |
| scientific article; zbMATH DE number 1508917 (Why is no real title available?) | 2000-09-18 | Paper |
| scientific article; zbMATH DE number 1445284 (Why is no real title available?) | 2000-05-10 | Paper |
Modular decomposition and transitive orientation
Discrete Mathematics | 2000-04-04 | Paper |
Construction of a simple elimination scheme for a chordal comparability graph in linear time
Discrete Applied Mathematics | 1999-11-07 | Paper |
Weakly Triangulated Comparability Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
On treewidth and minimum fill-in of asteroidal triple-free graphs
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1003286 (Why is no real title available?) | 1997-08-03 | Paper |
Visibility graphs of towers
Computational Geometry | 1997-03-18 | Paper |
Nonredundant 1’s in \Gamma -Free Matrices
SIAM Journal on Discrete Mathematics | 1995-07-03 | Paper |
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics | 1995-06-06 | Paper |
On the 2-Chain Subgraph Cover and Related Problems
Journal of Algorithms | 1994-11-06 | Paper |
| scientific article; zbMATH DE number 432772 (Why is no real title available?) | 1994-09-19 | Paper |
An O(n2) Algorithm for Undirected Split Decomposition
Journal of Algorithms | 1994-05-24 | Paper |
Recognition of Circle Graphs
Journal of Algorithms | 1994-03-22 | Paper |
| scientific article; zbMATH DE number 437537 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 432839 (Why is no real title available?) | 1993-10-20 | Paper |
Doubly lexical ordering of dense 0--1 matrices
Information Processing Letters | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 139779 (Why is no real title available?) | 1993-03-28 | Paper |
\(P_ 4\)-trees and substitution decomposition
Discrete Applied Mathematics | 1993-01-17 | Paper |
Transitive closure for restricted classes of partial orders
Order | 1992-06-27 | Paper |
Finding large holes
Information Processing Letters | 1992-06-27 | Paper |
Cycle-free partial orders and chordal comparability graphs
Order | 1992-06-27 | Paper |
Note on recognition of matroid systems
Operations Research Letters | 1992-06-27 | Paper |
Incremental modular decomposition
Journal of the ACM | 1989-01-01 | Paper |
Prime Testing for the Split Decomposition of a Graph
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Edge subdivision and dimension
Order | 1988-01-01 | Paper |
Circular-arc graphs with clique cover number two
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4063153 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4068899 (Why is no real title available?) | 1987-01-01 | Paper |
Bipartite permutation graphs
Discrete Applied Mathematics | 1987-01-01 | Paper |
An improved edge bound on the interval number of a graph
Journal of Graph Theory | 1987-01-01 | Paper |
The minimum dummy task problem
Networks | 1986-01-01 | Paper |
On Comparability and Permutation Graphs
SIAM Journal on Computing | 1985-01-01 | Paper |
Worst case analysis of a graph coloring algorithm
Discrete Applied Mathematics | 1985-01-01 | Paper |
Worst-case analysis of a scheduling algorithm
Operations Research Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3825206 (Why is no real title available?) | 1983-01-01 | Paper |
