| Publication | Date of Publication | Type |
|---|
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2026-04-21 | Paper |
On polynomial kernelization for stable cutset
Discrete Applied Mathematics | 2026-02-24 | Paper |
The parameterized complexity of strong conflict-free vertex-connection colorability
Discrete Applied Mathematics | 2026-02-24 | Paper |
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
Journal of Computer and System Sciences | 2025-12-11 | Paper |
| The complexity of strong conflict-free vertex-connection k-colorability | 2025-06-17 | Paper |
| On polynomial kernelization for stable cutset | 2025-05-02 | Paper |
Computing optimal leaf roots of chordal cographs in linear time
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths | 2024-05-03 | Paper |
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Theory of Computing Systems | 2024-04-21 | Paper |
On the \(d\)-claw vertex deletion problem
Algorithmica | 2024-01-25 | Paper |
| Maximizing Matching Cuts | 2023-12-20 | Paper |
| Computing Optimal Leaf Roots of Chordal Cographs in Linear Time | 2023-08-21 | Paper |
On the d-claw vertex deletion problem
(available as arXiv preprint) | 2023-03-30 | Paper |
| Leaf powers | 2022-12-21 | Paper |
The perfect matching cut problem revisited
Theoretical Computer Science | 2022-09-01 | Paper |
The perfect matching cut problem revisited
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Journal of Computer and System Sciences | 2021-10-28 | Paper |
Matching cut in graphs with large minimum degree
Algorithmica | 2021-04-19 | Paper |
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
Discrete Applied Mathematics | 2020-06-29 | Paper |
Color-line and proper color-line graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Matching cut in graphs with large minimum degree
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Hardness and structural results for half-squares of restricted tree convex bipartite graphs
Algorithmica | 2019-10-17 | Paper |
Map graphs having witnesses of large girth
Theoretical Computer Science | 2019-05-17 | Paper |
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
Theoretical Computer Science | 2019-05-02 | Paper |
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the complete width and edge clique cover problems
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
| On the complexity of matching cut in graphs of fixed diameter | 2018-04-19 | Paper |
Hardness and structural results for half-squares of restricted tree convex bipartite graphs
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Good characterizations and linear time recognition for 2-probe block graphs
Discrete Applied Mathematics | 2017-09-12 | Paper |
Characterization and recognition of some opposition and coalition graph classes
Discrete Applied Mathematics | 2016-11-24 | Paper |
A unified approach to recognize squares of split graphs
Theoretical Computer Science | 2016-09-12 | Paper |
Algorithms solving the matching cut problem
Theoretical Computer Science | 2015-12-08 | Paper |
On the complete width and edge clique cover problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Theoretical Computer Science | 2015-09-25 | Paper |
Algorithms Solving the Matching Cut Problem
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Characterizing and recognizing probe block graphs
Theoretical Computer Science | 2015-01-28 | Paper |
Forests and trees among Gallai graphs
Discrete Mathematics | 2014-11-20 | Paper |
A note on efficient domination in a superclass of \(P_5\)-free graphs
Information Processing Letters | 2014-04-17 | Paper |
On opposition graphs, coalition graphs, and bipartite permutation graphs
Discrete Applied Mathematics | 2014-04-02 | Paper |
Complexity and algorithms for recognizing polar and monopolar graphs
Theoretical Computer Science | 2014-03-13 | Paper |
Complexity results for rainbow matchings
Theoretical Computer Science | 2014-02-11 | Paper |
Extremal graphs having no stable cutset
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Integral mixed unit interval graphs
Discrete Applied Mathematics | 2013-04-25 | Paper |
A good characterization of squares of strongly chordal split graphs
Information Processing Letters | 2013-04-04 | Paper |
Mixed unit interval graphs
Discrete Mathematics | 2012-10-26 | Paper |
Integral mixed unit interval graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Complexity of finding graph roots with girth conditions
Algorithmica | 2012-04-26 | Paper |
| scientific article; zbMATH DE number 6027233 (Why is no real title available?) | 2012-04-24 | Paper |
Path-bicolorable graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
Recognizing polar planar graphs using new results for monopolarity
Algorithms and Computation | 2011-12-16 | Paper |
Two characterizations of chain partitioned probe graphs
Annals of Operations Research | 2011-11-17 | Paper |
Exact leaf powers
Theoretical Computer Science | 2010-07-07 | Paper |
The square of a block graph
Discrete Mathematics | 2010-04-27 | Paper |
Hardness Results and Efficient Algorithms for Graph Powers
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Structure and linear time recognition of 3-leaf powers
Information Processing Letters | 2010-01-18 | Paper |
Tree spanners for bipartite graphs and probe interval graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Path-bicolorable graphs. (Extended abstract)
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
Discrete Mathematics | 2009-12-09 | Paper |
Simplicial powers of graphs
Theoretical Computer Science | 2009-11-25 | Paper |
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science | 2009-11-06 | Paper |
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters | 2009-07-09 | Paper |
Simplicial Powers of Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On stable cutsets in claw-free graphs and planar graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Probe Ptolemaic Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Characterisations and Linear-Time Recognition of Probe Cographs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
| Probe split graphs | 2008-05-27 | Paper |
| The subchromatic index of graphs | 2008-02-28 | Paper |
On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science | 2008-01-07 | Paper |
On probe classes of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph classes related to chordal graphs and chordal bipartite graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Distance-Hereditary 5-Leaf Powers
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Tree spanners for bipartite graphs and probe interval graphs
Algorithmica | 2007-03-05 | Paper |
New applications of clique separator decomposition for the maximum weight stable set problem
Theoretical Computer Science | 2007-02-26 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Bisplit graphs
Discrete Mathematics | 2005-10-10 | Paper |
Split-Perfect Graphs: Characterizations and Algorithmic Use
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science | 2004-10-27 | Paper |
Consequences of an algorithm for bridged graphs
Discrete Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2044944 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044932 (Why is no real title available?) | 2004-02-18 | Paper |
Graph Subcolorings: Complexity and Algorithms
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Splitting a graph into disjoint induced paths or cycles.
Discrete Applied Mathematics | 2003-09-25 | Paper |
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1979496 (Why is no real title available?) | 2003-09-14 | Paper |
On stable cutsets in line graphs
Theoretical Computer Science | 2003-07-30 | Paper |
Bipartite-perfect graphs
Discrete Applied Mathematics | 2003-06-10 | Paper |
| scientific article; zbMATH DE number 1753165 (Why is no real title available?) | 2002-09-26 | Paper |
| scientific article; zbMATH DE number 1696523 (Why is no real title available?) | 2002-07-14 | Paper |
The NP-completeness of (1,r)-subcolorability of cubic graphs
Information Processing Letters | 2002-07-14 | Paper |
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
Information Processing Letters | 2002-07-14 | Paper |
| Bipartite-perfect graphs | 2001-09-23 | Paper |
P₄-colorings and P₄-bipartite graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2001-06-18 | Paper |
P₄-colorings and P₄-bipartite graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2001-06-18 | Paper |
On stable cutsets in graphs
Discrete Applied Mathematics | 2001-06-13 | Paper |
Some conjectures on perfect graphs
Discussiones Mathematicae Graph Theory | 2001-06-04 | Paper |
| Optimal tree 3-spanners in directed path graphs | 2001-05-02 | Paper |
On P₄-transversals of perfect graphs
Discrete Mathematics | 2001-02-13 | Paper |
Recognizing the \(P_4\)-structure of block graphs
Discrete Applied Mathematics | 2000-07-16 | Paper |
Recognizing Perfect 2-Split Graphs
SIAM Journal on Discrete Mathematics | 2000-03-19 | Paper |
Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles
Graphs and Combinatorics | 2000-01-01 | Paper |
| A good characterization of cograph contractions | 1999-10-17 | Paper |
Tree- and forest-perfect graphs
Discrete Applied Mathematics | 1999-09-22 | Paper |
Recognizing the \(P_4\)-structure of bipartite graphs
Discrete Applied Mathematics | 1999-08-02 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
The complexity of some problems related to GRAPH 3-COLORABILITY
Discrete Applied Mathematics | 1999-03-22 | Paper |
Duchet-type theorems for powers of HHD-free graphs
Discrete Mathematics | 1998-04-28 | Paper |
| Cycle-perfect graphs are perfect | 1997-06-22 | Paper |
Gallai graphs and anti-Gallai graphs
Discrete Mathematics | 1997-06-22 | Paper |
| Wing-triangulated graphs are perfect | 1997-06-09 | Paper |
| scientific article; zbMATH DE number 904966 (Why is no real title available?) | 1996-07-16 | Paper |
Mortality of iterated Gallai graphs
Periodica Mathematica Hungarica | 1994-10-10 | Paper |
Iterated k-line graphs
Graphs and Combinatorics | 1994-09-26 | Paper |
Perfect <i>k</i>‐line graphs and <i>k</i>‐total graphs
Journal of Graph Theory | 1993-12-13 | Paper |
On inverse problems for the cycle graph operator
Graphs and Combinatorics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 3891189 (Why is no real title available?) | 1982-01-01 | Paper |
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
(available as arXiv preprint) | N/A | Paper |
