| Publication | Date of Publication | Type |
|---|
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 |
| Complexity of the cluster vertex deletion problem on \(H\)-free graphs | 2024-08-06 | 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 |
| Constrained representations of map graphs and half-squares | 2022-07-21 | Paper |
Matching cut in graphs with large minimum degree
Algorithmica | 2021-04-19 | 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 |
| 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 |
Tree spanners for bipartite graphs and probe interval graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters | 2009-03-23 | Paper |
Tree spanners for bipartite graphs and probe interval graphs
Algorithmica | 2007-03-05 | Paper |
Clique-width for 4-vertex forbidden subgraphs
Theory of Computing Systems | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
New graph classes of bounded clique-width
Theory of Computing Systems | 2006-02-08 | Paper |
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics | 2005-02-22 | Paper |
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science | 2004-10-27 | Paper |
Additive Tree Spanners
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 |
| scientific article; zbMATH DE number 1979496 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1953082 (Why is no real title available?) | 2003-07-25 | 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 |
| Optimal tree 3-spanners in directed path graphs | 2001-05-02 | Paper |
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
(available as arXiv preprint) | N/A | Paper |
