Christophe Crespelle

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 23

Top Venues

CoRR

Discret. Appl. Math.

Theor. Comput. Sci.

Montpellier 2 University, France (PHD)

Education History

Montpellier 2 University, France

PHD

Publications

Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard
Dividing Permutations in the Semiring of Functional Digraphs. AUTOMATA (2024)
Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. 357 (2024)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48 (2023)
Christophe Crespelle, Petr A. Golovach
Cyclability in graph classes. Discret. Appl. Math. 313 (2022)
Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé
A quasi-quadratic vertex Kernel for Cograph edge editing. CoRR (2022)
Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan
On the Termination of Some Biclique Operators on Multipartite Graphs. CoRR (2021)
Jean R. S. Blair, Christophe Crespelle
On the effectiveness of the incremental approach to minimal chordal edge modification. Theor. Comput. Sci. 888 (2021)
Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen
Termination of Multipartite Graph Series Arising from Complex Network Modelling. CoRR (2021)
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. 288 (2021)
Christophe Crespelle
Linear-Time Minimal Cograph Editing. FCT (2021)
Christophe Crespelle, Benjamin Gras, Anthony Perez
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. WG (2021)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. CoRR (2020)
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
Faster and Enhanced Inclusion-Minimal Cograph Completion. CoRR (2020)
Christophe Crespelle, Anthony Perez, Ioan Todinca
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254 (2019)
Christophe Crespelle, Carl Feghali, Petr A. Golovach
Cyclability in Graph Classes. ISAAC (2019)
Christophe Crespelle
Fully dynamic representations of interval graphs. Theor. Comput. Sci. 759 (2019)
Yannick Léo, Christophe Crespelle, Eric Fleury
Non-altering time scales for aggregation of dynamic networks into series of graphs. Comput. Networks 148 (2019)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR (2018)
Lucie Martinet, Christophe Crespelle, Eric Fleury, Pierre-Yves Boëlle, Didier Guillemot
The Link Stream of Contacts in a Whole Hospital. CoRR (2018)
Yannick Léo, Christophe Crespelle, Eric Fleury
Non-Altering Time Scales for Aggregation of Dynamic Networks into Series of Graphs. CoRR (2018)
Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry
Faster and Enhanced Inclusion-Minimal Cograph Completion. COCOA (1) (2017)
Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan
Rigorous Measurement of the Internet Degree Distribution. Complex Syst. 26 (1) (2017)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339 (8) (2016)
Christophe Crespelle, Eric Thierry
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time. Discret. Math. 338 (12) (2015)
Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan
On the termination of some biclique operators on multipartite graphs. Discret. Appl. Math. 195 (2015)
Christophe Crespelle, Anthony Perez, Ioan Todinca
(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG (2015)
Yannick Léo, Christophe Crespelle, Eric Fleury
Non-altering time scales for aggregation of dynamic networks into series of graphs. CoNEXT (2015)
Christophe Crespelle, Thi Ha Duong Phan, The Hung Tran
Termination of the iterated strong-factor operator on multipartite graphs. Theor. Comput. Sci. 571 (2015)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS (2015)
Elie Rotenberg, Christophe Crespelle, Matthieu Latapy
Measuring routing tables in the internet. INFOCOM Workshops (2014)
Christophe Crespelle, Philippe Gambette
(Nearly-)tight bounds on the contiguity and linearity of cographs. Theor. Comput. Sci. 522 (2014)
Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan
Measuring the degree distribution of routers in the core internet. Networking (2014)
Lucie Martinet, Christophe Crespelle, Eric Fleury
Dynamic Contact Network Analysis in Hospital Wards. CompleNet (2014)
Fabien Tarissan, Elie Rotenberg, Matthieu Latapy, Christophe Crespelle
UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology. MASCOTS (2014)
Christophe Crespelle, Ioan Todinca
)O(n2)-time algorithm for the minimal interval completion problem. Theor. Comput. Sci. 494 (2013)
Christophe Crespelle, Philippe Gambette
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. WALCOM (2013)
Christophe Crespelle, Eric Thierry, Thomas Lambert
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product. COCOON (2013)
Vincent Neiger, Christophe Crespelle, Eric Fleury
On the Structure of Changes in Dynamic Contact Networks. SITIS (2012)
Christophe Crespelle, Fabien Tarissan
Evaluation of a new method for measuring the internet degree distribution: Simulation results. Comput. Commun. 34 (5) (2011)
Christophe Crespelle, Christophe Paul
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica 58 (2) (2010)
Christophe Crespelle, Ioan Todinca
){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. TAMC (2010)
Christophe Crespelle, Philippe Gambette
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. Inf. Process. Lett. 110 (12-13) (2010)
Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen
Termination of Multipartite Graph Series Arising from Complex Network Modelling. COCOA (1) (2010)
Christophe Crespelle, Philippe Gambette
) Breadth-First Search. IWOCA (2009)
Christophe Crespelle
Fully Dynamic Representations of Interval Graphs. WG (2009)
Christophe Crespelle, Christophe Paul
Fully dynamic recognition algorithm and certificate for directed cographs. Discret. Appl. Math. 154 (12) (2006)
Christophe Crespelle, Christophe Paul
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. WG (2005)
Christophe Crespelle, Christophe Paul
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG (2004)

Christophe Crespelle.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christophe Crespelle