Fully dynamic recognition algorithm and certificate for directed cographs. - Christophe Crespelle; Christophe Paul (Discret. Appl. Math., 2006)

Représentations dynamiques de graphes. (Dynamic Graph Representations). - Christophe Crespelle (2007)

Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search. - Christophe Crespelle; Philippe Gambette (IWOCA, 2009)

Termination of Multipartite Graph Series Arising from Complex Network Modelling. - Matthieu Latapy; Thi Ha Duong Phan; Christophe Crespelle; Thanh Qui Nguyen (COCOA (1), 2010)

An O(n2){ mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. - Christophe Crespelle; Ioan Todinca (TAMC, 2010)

Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. - Christophe Crespelle; Christophe Paul (Algorithmica, 2010)

Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. - Christophe Crespelle; Philippe Gambette (Inf. Process. Lett., 2010)

Evaluation of a new method for measuring the internet degree distribution: Simulation results. - Christophe Crespelle; Fabien Tarissan (Comput. Commun., 2011)

On the Structure of Changes in Dynamic Contact Networks. - Vincent Neiger; Christophe Crespelle; Eric Fleury (SITIS, 2012)

A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product. - Christophe Crespelle; Eric Thierry; Thomas Lambert (COCOON, 2013)

Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. - Christophe Crespelle; Philippe Gambette (WALCOM, 2013)

An O(n2)O(n2)-time algorithm for the minimal interval completion problem. - Christophe Crespelle; Ioan Todinca (Theor. Comput. Sci., 2013)

Dynamic Contact Network Analysis in Hospital Wards. - Lucie Martinet; Christophe Crespelle; Eric Fleury (CompleNet, 2014)

Measuring routing tables in the internet. - Elie Rotenberg; Christophe Crespelle; Matthieu Latapy (INFOCOM Workshops, 2014)

UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology. - Fabien Tarissan; Elie Rotenberg; Matthieu Latapy; Christophe Crespelle (MASCOTS, 2014)

Measuring the degree distribution of routers in the core internet. - Matthieu Latapy; Elie Rotenberg; Christophe Crespelle; Fabien Tarissan (Networking, 2014)

(Nearly-)tight bounds on the contiguity and linearity of cographs. - Christophe Crespelle; Philippe Gambette (Theor. Comput. Sci., 2014)

An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (WG, 2015)

On the termination of some biclique operators on multipartite graphs. - Christophe Crespelle; Matthieu Latapy; Thi Ha Duong Phan (Discret. Appl. Math., 2015)

Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time. - Christophe Crespelle; Eric Thierry (Discret. Math., 2015)

Termination of the iterated strong-factor operator on multipartite graphs. - Christophe Crespelle; Thi Ha Duong Phan; The Hung Tran (Theor. Comput. Sci., 2015)

Linearity is strictly more powerful than contiguity for encoding graphs. - Christophe Crespelle; Tien-Nam Le; Kévin Perrot; Thi Ha Duong Phan (Discret. Math., 2016)

Structures of Complex Networks and of their Dynamics. - Christophe Crespelle (2017)

Rigorous Measurement of the Internet Degree Distribution. - Matthieu Latapy; Elie Rotenberg; Christophe Crespelle; Fabien Tarissan (Complex Syst., 2017)

The Link Stream of Contacts in a Whole Hospital. - Lucie Martinet; Christophe Crespelle; Eric Fleury; Pierre-Yves Boëlle; Didier Guillemot (CoRR, 2018)

Cyclability in Graph Classes. - Christophe Crespelle; Carl Feghali; Petr A. Golovach (ISAAC, 2019)

Non-altering time scales for aggregation of dynamic networks into series of graphs. - Yannick Léo; Christophe Crespelle; Eric Fleury (Comput. Networks, 2019)

An O(n2) time algorithm for the minimal permutation completion problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (Discret. Appl. Math., 2019)

Fully dynamic representations of interval graphs. - Christophe Crespelle (Theor. Comput. Sci., 2019)

Linear-Time Minimal Cograph Editing. - Christophe Crespelle (FCT, 2021)

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. - Christophe Crespelle; Benjamin Gras 002; Anthony Perez 001 (WG, 2021)

Faster and enhanced inclusion-minimal cograph completion. - Christophe Crespelle; Daniel Lokshtanov; Thi Ha Duong Phan; Eric Thierry (Discret. Appl. Math., 2021)

On the effectiveness of the incremental approach to minimal chordal edge modification. - Jean R. S. Blair; Christophe Crespelle (Theor. Comput. Sci., 2021)

Cyclability in graph classes. - Christophe Crespelle; Petr A. Golovach (Discret. Appl. Math., 2022)

A survey of parameterized algorithms and the complexity of edge modification. - Christophe Crespelle; Pål Grønås Drange; Fedor V. Fomin; Petr A. Golovach (Comput. Sci. Rev., 2023)

Dividing Permutations in the Semiring of Functional Digraphs. - Florian Bridoux; Christophe Crespelle; Thi Ha Duong Phan; Adrien Richard (AUTOMATA, 2024)

A quasi-quadratic vertex-kernel for Cograph Edge Editing. - Christophe Crespelle; Rémi Pellerin; Stéphan Thomassé (Discret. Appl. Math., 2024)

Dividing sums of cycles in the semiring of functional digraphs. - Florian Bridoux; Christophe Crespelle; Thi Ha Duong Phan; Adrien Richard (CoRR, 2025)