Christophe Crespelle

53 papers A 1B 11C 2Misc 1Journal 30Unranked 6

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