| Publication | Date of Publication | Type |
|---|
Structural parameterization of cluster deletion
Algorithmica | 2025-05-23 | Paper |
| Faster computation of 3-edge-connected components in digraphs | 2024-05-14 | Paper |
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Algorithmica | 2024-03-25 | Paper |
Computing and listing avoidable vertices and paths
Algorithmica | 2024-01-09 | Paper |
Structural parameterization of cluster deletion
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Computing and listing avoidable vertices and paths
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Graph square roots of small distance from degree one graphs
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
(available as arXiv preprint) | 2022-08-30 | Paper |
Graph square roots of small distance from degree one graphs
Theory of Computing Systems | 2022-07-26 | Paper |
| Cluster deletion on interval graphs and split related graphs | 2022-07-21 | Paper |
Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
Algorithmica | 2022-05-03 | Paper |
Subset feedback vertex set on graphs of bounded independent set size
(available as arXiv preprint) | 2021-08-04 | Paper |
Cluster deletion on interval graphs and split related graphs
Algorithmica | 2021-06-30 | Paper |
Cluster deletion on interval graphs and split related graphs
Algorithmica | 2021-06-30 | Paper |
| Maximizing the strong triadic closure in split graphs and proper interval graphs | 2020-11-25 | Paper |
Graph Square Roots of Small Distance from Degree One Graphs
(available as arXiv preprint) | 2020-10-12 | Paper |
Maximizing the strong triadic closure in split graphs and proper interval graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
Maximizing the strong triadic closure in split graphs and proper interval graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
| Parameterized aspects of strong subgraph closure | 2020-08-25 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Parameterized aspects of strong subgraph closure
Algorithmica | 2020-05-21 | Paper |
Subset feedback vertex set on graphs of bounded independent set size
Theoretical Computer Science | 2020-03-12 | Paper |
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
Discrete Applied Mathematics | 2019-03-22 | Paper |
Strong triadic closure in cographs and graphs of low maximum degree
Theoretical Computer Science | 2018-06-08 | Paper |
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
Lecture Notes in Computer Science | 2017-11-22 | Paper |
Sparse certificates for 2-connectivity in directed graphs
Theoretical Computer Science | 2017-11-06 | Paper |
Strong triadic closure in cographs and graphs of low maximum degree
Lecture Notes in Computer Science | 2017-10-23 | Paper |
On the performance of the first-fit coloring algorithm on permutation graphs
Information Processing Letters | 2016-06-16 | Paper |
Clique-width of path powers
Discrete Applied Mathematics | 2016-04-07 | Paper |
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics | 2015-06-10 | Paper |
Enumerating minimal subset feedback vertex sets
Algorithmica | 2014-11-19 | Paper |
Counting spanning trees using modular decomposition
Theoretical Computer Science | 2014-03-13 | Paper |
A new representation of proper interval graphs with an application to clique-width
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics | 2012-08-14 | Paper |
A fully dynamic algorithm for the recognition of P₄-sparse graphs
Theoretical Computer Science | 2012-08-08 | Paper |
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Cutwidth of split graphs and threshold graphs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
A simple linear-time recognition algorithm for weakly quasi-threshold graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Graphs of linear clique-width at most 3
Theoretical Computer Science | 2011-10-10 | Paper |
Enumerating minimal subset feedback vertex sets
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Counting spanning trees in graphs using modular decomposition
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
| Counting spanning trees in cographs: an algorithmic approach | 2011-02-11 | Paper |
Characterizing and computing minimal cograph completions
Discrete Applied Mathematics | 2010-05-25 | Paper |
Clustering with partial information
Theoretical Computer Science | 2010-03-09 | Paper |
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
Discrete Mathematics | 2009-06-23 | Paper |
A Complete Characterisation of the Linear Clique-Width of Path Powers
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
Theoretical Computer Science | 2009-02-19 | Paper |
Clustering with Partial Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Drawing graphs using modular decomposition
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Characterizing and Computing Minimal Cograph Completions
Frontiers in Algorithmics | 2008-06-19 | Paper |
| On the number of spanning trees of \(K^m_n \pm G\) graphs | 2008-05-27 | Paper |
Graphs of Linear Clique-Width at Most 3
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
Algorithms and Computation | 2008-04-24 | Paper |
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics | 2008-03-18 | Paper |
An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
Journal of Parallel and Distributed Computing | 2007-02-19 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| scientific article; zbMATH DE number 2230252 (Why is no real title available?) | 2005-11-18 | Paper |
The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
Graphs and Combinatorics | 2005-01-20 | Paper |
| scientific article; zbMATH DE number 2127724 (Why is no real title available?) | 2005-01-14 | Paper |
