Christophe Crespelle

Available identifiers

zbMath Open crespelle.christopheMaRDI QIDQ243612

List of research outcomes

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	2024-09-26	Paper
A survey of parameterized algorithms and the complexity of edge modification	2023-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q5875577	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	2022-03-28	Paper
On the effectiveness of the incremental approach to minimal chordal edge modification	2021-09-27	Paper
Faster and enhanced inclusion-minimal cograph completion	2020-11-02	Paper
An \(O(n^2)\) time algorithm for the minimal permutation completion problem	2019-02-08	Paper
Fully dynamic representations of interval graphs	2019-01-18	Paper
Faster and enhanced inclusion-minimal cograph completion	2018-02-26	Paper
An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem	2016-10-21	Paper
Linearity is strictly more powerful than contiguity for encoding graphs	2016-05-18	Paper
Linearity is strictly more powerful than contiguity for encoding graphs	2015-10-30	Paper
On the termination of some biclique operators on multipartite graphs	2015-09-21	Paper
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time	2015-08-05	Paper
Termination of the iterated strong-factor operator on multipartite graphs	2015-01-30	Paper
(Nearly-)tight bounds on the contiguity and linearity of cographs	2014-01-24	Paper
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem	2014-01-10	Paper
A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product	2013-06-11	Paper
Linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs	2013-04-12	Paper
Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time	2012-03-12	Paper
Termination of multipartite graph series arising from complex network modelling	2011-01-08	Paper
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs	2010-09-16	Paper
An \({\mathcal{O}}(n^2)\)-time algorithm for the minimal interval completion problem	2010-06-17	Paper
Fully dynamic representations of interval graphs	2010-01-21	Paper
Efficient neighborhood encoding for interval graphs and permutation graphs and \(O(n)\) breadth-first search	2009-12-11	Paper
Graph-Theoretic Concepts in Computer Science	2006-11-01	Paper
Fully dynamic recognition algorithm and certificate for directed cographs	2006-08-14	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper

Research outcomes over time

This page was built for person: Christophe Crespelle