| Publication | Date of Publication | Type |
|---|
Verification of a certificate for weakly chordal graphs
Discrete Applied Mathematics | 2025-09-16 | Paper |
Intersection of chordal graphs and some related partition problems
Discrete Applied Mathematics | 2025-01-06 | Paper |
On some classes of quasi-triangulated graphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
Discrete Applied Mathematics | 2022-06-21 | Paper |
Completing colored graphs to meet a target property
Discrete Applied Mathematics | 2021-06-07 | Paper |
Some completion problems for graphs without chordless cycles of prescribed lengths
Discrete Applied Mathematics | 2019-09-19 | Paper |
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the contour of bipartite graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
| Perfect graphs | 2018-04-23 | Paper |
| New results on chordal-(k, l) and strongly chordal-(k, l) sandwich problems | 2018-02-23 | Paper |
Graph modification problem for some classes of graphs
Journal of Discrete Algorithms | 2016-12-09 | Paper |
| Geodeticity of the contour of chordal bipartite graphs | 2016-10-17 | Paper |
Improved algorithms for weakly chordal graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| The list partition problem for graphs | 2015-08-03 | Paper |
Hamiltonian spider intersection graphs are cycle extendable
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Completing colored graphs to meet a target property
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Finding and listing induced paths and cycles
Discrete Applied Mathematics | 2013-03-12 | Paper |
Finding a sun in building-free graphs
Graphs and Combinatorics | 2012-12-27 | Paper |
Maximum induced matching problem on hhd-free graphs
Discrete Applied Mathematics | 2012-03-19 | Paper |
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
On graphs without a \(C_{4}\) or a diamond
Discrete Applied Mathematics | 2011-04-19 | Paper |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Discrete Mathematics | 2011-02-18 | Paper |
New min-max theorems for weakly chordal and dually chordal graphs
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
A min-max property of chordal bipartite graphs with applications
Graphs and Combinatorics | 2010-10-07 | Paper |
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Leaf Powers and Their Properties: Using the Trees
Algorithms and Computation | 2009-01-29 | Paper |
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
A new characterization of HH-free graphs
Discrete Mathematics | 2008-09-04 | Paper |
Chordal bipartite completion of colored graphs
Discrete Mathematics | 2008-05-13 | Paper |
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs
Graphs and Combinatorics | 2007-07-19 | Paper |
| scientific article; zbMATH DE number 5130726 (Why is no real title available?) | 2007-03-05 | Paper |
A note on the recognition of bisplit graphs
Discrete Mathematics | 2006-09-14 | Paper |
Disjoint clique cutsets in graphs without long holes
Journal of Graph Theory | 2005-05-04 | Paper |
Planar domination graphs
Discrete Mathematics | 2003-07-29 | Paper |
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics | 2003-06-10 | Paper |
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics | 2003-06-09 | Paper |
Dirac-type characterizations of graphs without long chordless cycles
Discrete Mathematics | 2002-12-02 | Paper |
Finding houses and holes in graphs
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1445284 (Why is no real title available?) | 2000-05-10 | Paper |
Weakly Triangulated Comparability Graphs
SIAM Journal on Computing | 1999-10-28 | Paper |
| A linear time algorithm to recognize circular permutation graphs | 1996-12-09 | Paper |
A characterization of some graph classes with no long holes
Journal of Combinatorial Theory. Series B | 1996-07-28 | Paper |
Algorithms for weakly triangulated graphs
Discrete Applied Mathematics | 1995-06-06 | Paper |
