| Publication | Date of Publication | Type |
|---|
Dividing permutations in the semiring of functional digraphs
| 2024-11-13 | Paper |
A quasi-quadratic vertex-kernel for cograph edge editing
Discrete Applied Mathematics | 2024-09-26 | Paper |
A survey of parameterized algorithms and the complexity of edge modification
Computer Science Review | 2023-06-20 | Paper |
scientific article; zbMATH DE number 7650249 (Why is no real title available?)
| 2023-02-03 | Paper |
Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
| 2022-06-08 | Paper |
Linear-time minimal cograph editing
| 2022-05-20 | Paper |
Cyclability in graph classes
Discrete Applied Mathematics | 2022-03-28 | Paper |
On the effectiveness of the incremental approach to minimal chordal edge modification
Theoretical Computer Science | 2021-09-27 | Paper |
Faster and enhanced inclusion-minimal cograph completion
Discrete Applied Mathematics | 2020-11-02 | Paper |
An \(O(n^2)\) time algorithm for the minimal permutation completion problem
Discrete Applied Mathematics | 2019-02-08 | Paper |
Fully dynamic representations of interval graphs
Theoretical Computer Science | 2019-01-18 | Paper |
Faster and enhanced inclusion-minimal cograph completion
Lecture Notes in Computer Science | 2018-02-26 | Paper |
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Linearity is strictly more powerful than contiguity for encoding graphs
Discrete Mathematics | 2016-05-18 | Paper |
Linearity is strictly more powerful than contiguity for encoding graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On the termination of some biclique operators on multipartite graphs
Discrete Applied Mathematics | 2015-09-21 | Paper |
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
Discrete Mathematics | 2015-08-05 | Paper |
Termination of the iterated strong-factor operator on multipartite graphs
Theoretical Computer Science | 2015-01-30 | Paper |
(Nearly-)tight bounds on the contiguity and linearity of cographs
Theoretical Computer Science | 2014-01-24 | Paper |
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
Theoretical Computer Science | 2014-01-10 | Paper |
A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time
Information Processing Letters | 2012-03-12 | Paper |
Termination of multipartite graph series arising from complex network modelling
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
Algorithmica | 2010-09-16 | Paper |
An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Fully dynamic representations of interval graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Efficient neighborhood encoding for interval graphs and permutation graphs and \(O(n)\) breadth-first search
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Fully dynamic recognition algorithm and certificate for directed cographs
Discrete Applied Mathematics | 2006-08-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
