Christophe Crespelle

According to our database, Christophe Crespelle authored at least 37 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A quasi-quadratic vertex-kernel for Cograph Edge Editing.

Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé

Discret. Appl. Math., 2024

Dividing Permutations in the Semiring of Functional Digraphs.

Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard

Proceedings of the Cellular Automata and Discrete Complex Systems, 2024

2023

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., May, 2023

2022

Cyclability in graph classes.

Christophe Crespelle, Petr A. Golovach

Discret. Appl. Math., 2022

2021

On the effectiveness of the incremental approach to minimal chordal edge modification.

Jean R. S. Blair, Christophe Crespelle

Theor. Comput. Sci., 2021

Faster and enhanced inclusion-minimal cograph completion.

Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry

Discret. Appl. Math., 2021

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel.

Christophe Crespelle, Benjamin Gras, Anthony Perez

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Linear-Time Minimal Cograph Editing.

Christophe Crespelle

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2019

Fully dynamic representations of interval graphs.

Christophe Crespelle

Theor. Comput. Sci., 2019

An O(n2) time algorithm for the minimal permutation completion problem.

Christophe Crespelle, Anthony Perez, Ioan Todinca

Discret. Appl. Math., 2019

Non-altering time scales for aggregation of dynamic networks into series of graphs.

Yannick Léo, Christophe Crespelle, Eric Fleury

Comput. Networks, 2019

Cyclability in Graph Classes.

Christophe Crespelle, Carl Feghali, Petr A. Golovach

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

The Link Stream of Contacts in a Whole Hospital.

Lucie Martinet, Christophe Crespelle, Eric Fleury, Pierre-Yves Boëlle, Didier Guillemot

CoRR, 2018

2017

Rigorous Measurement of the Internet Degree Distribution.

Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan

Complex Syst., 2017

Structures of Complex Networks and of their Dynamics.

Christophe Crespelle

, 2017

2016

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

2015

Termination of the iterated strong-factor operator on multipartite graphs.

Christophe Crespelle, Thi Ha Duong Phan, The Hung Tran

Theor. Comput. Sci., 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

On the termination of some biclique operators on multipartite graphs.

Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan

Discret. Appl. Math., 2015

An <i>O</i>(n^2) Time Algorithm for the Minimal Permutation Completion Problem.

Christophe Crespelle, Anthony Perez, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

(Nearly-)tight bounds on the contiguity and linearity of cographs.

Christophe Crespelle, Philippe Gambette

Theor. Comput. Sci., 2014

Measuring the degree distribution of routers in the core internet.

Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan

Proceedings of the 2014 IFIP Networking Conference, Trondheim, 2014

UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology.

Fabien Tarissan, Elie Rotenberg, Matthieu Latapy, Christophe Crespelle

Proceedings of the IEEE 22nd International Symposium on Modelling, 2014

Measuring routing tables in the internet.

Elie Rotenberg, Christophe Crespelle, Matthieu Latapy

Proceedings of the 2014 Proceedings IEEE INFOCOM Workshops, Toronto, ON, Canada, April 27, 2014

Dynamic Contact Network Analysis in Hospital Wards.

Lucie Martinet, Christophe Crespelle, Eric Fleury

Proceedings of the Complex Networks V, 2014

2013

An <i>O</i>(<i>n</i>²)O(n2)-time algorithm for the minimal interval completion problem.

Christophe Crespelle, Ioan Todinca

Theor. Comput. Sci., 2013

Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs.

Christophe Crespelle, Philippe Gambette

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

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

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On the Structure of Changes in Dynamic Contact Networks.

Vincent Neiger, Christophe Crespelle, Eric Fleury

Proceedings of the Eighth International Conference on Signal Image Technology and Internet Based Systems, 2012

2011

Evaluation of a new method for measuring the internet degree distribution: Simulation results.

Christophe Crespelle, Fabien Tarissan

Comput. Commun., 2011

2010

Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time.

Christophe Crespelle, Philippe Gambette

Inf. Process. Lett., 2010

Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.

Christophe Crespelle, Christophe Paul

Algorithmica, 2010

An <i>O</i>(<i>n</i>²){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem.

Christophe Crespelle, Ioan Todinca

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Termination of Multipartite Graph Series Arising from Complex Network Modelling.

Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and <i>O</i>(<i>n</i>) Breadth-First Search.

Christophe Crespelle, Philippe Gambette

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2007

Représentations dynamiques de graphes. (Dynamic Graph Representations).

Christophe Crespelle

PhD thesis, 2007

2006

Fully dynamic recognition algorithm and certificate for directed cographs.

Christophe Crespelle, Christophe Paul

Discret. Appl. Math., 2006