default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Crespelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. 357: 282-296 (2024)- [c21]Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan, Adrien Richard:
Dividing Permutations in the Semiring of Functional Digraphs. AUTOMATA 2024: 95-107 - 2023
- [j18]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: 100556 (2023) - 2022
- [j17]Christophe Crespelle, Petr A. Golovach:
Cyclability in graph classes. Discret. Appl. Math. 313: 147-178 (2022) - [i8]Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
A quasi-quadratic vertex Kernel for Cograph edge editing. CoRR abs/2212.14814 (2022) - 2021
- [j16]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and enhanced inclusion-minimal cograph completion. Discret. Appl. Math. 288: 138-151 (2021) - [j15]Jean R. S. Blair, Christophe Crespelle:
On the effectiveness of the incremental approach to minimal chordal edge modification. Theor. Comput. Sci. 888: 1-12 (2021) - [c20]Christophe Crespelle:
Linear-Time Minimal Cograph Editing. FCT 2021: 176-189 - [c19]Christophe Crespelle, Benjamin Gras, Anthony Perez:
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. WG 2021: 156-168 - [i7]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. CoRR abs/2103.04447 (2021) - [i6]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the Termination of Some Biclique Operators on Multipartite Graphs. CoRR abs/2103.04451 (2021) - 2020
- [i5]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 abs/2001.06867 (2020) - [i4]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. CoRR abs/2001.07765 (2020)
2010 – 2019
- 2019
- [j14]Yannick Léo, Christophe Crespelle, Eric Fleury:
Non-altering time scales for aggregation of dynamic networks into series of graphs. Comput. Networks 148: 108-119 (2019) - [j13]Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254: 80-95 (2019) - [j12]Christophe Crespelle:
Fully dynamic representations of interval graphs. Theor. Comput. Sci. 759: 14-49 (2019) - [c18]Christophe Crespelle, Carl Feghali, Petr A. Golovach:
Cyclability in Graph Classes. ISAAC 2019: 16:1-16:13 - 2018
- [i3]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR abs/1803.05414 (2018) - [i2]Lucie Martinet, Christophe Crespelle, Eric Fleury, Pierre-Yves Boëlle, Didier Guillemot:
The Link Stream of Contacts in a Whole Hospital. CoRR abs/1805.05752 (2018) - [i1]Yannick Léo, Christophe Crespelle, Eric Fleury:
Non-Altering Time Scales for Aggregation of Dynamic Networks into Series of Graphs. CoRR abs/1805.06188 (2018) - 2017
- [b2]Christophe Crespelle:
Structures of Complex Networks and of their Dynamics. Claude Bernard University Lyon 1, France, 2017 - [j11]Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan:
Rigorous Measurement of the Internet Degree Distribution. Complex Syst. 26(1) (2017) - [c17]Christophe Crespelle, Daniel Lokshtanov, Thi Ha Duong Phan, Eric Thierry:
Faster and Enhanced Inclusion-Minimal Cograph Completion. COCOA (1) 2017: 210-224 - 2016
- [j10]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): 2168-2177 (2016) - 2015
- [j9]Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan:
On the termination of some biclique operators on multipartite graphs. Discret. Appl. Math. 195: 59-73 (2015) - [j8]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): 2393-2407 (2015) - [j7]Christophe Crespelle, Thi Ha Duong Phan, The Hung Tran:
Termination of the iterated strong-factor operator on multipartite graphs. Theor. Comput. Sci. 571: 67-77 (2015) - [c16]Yannick Léo, Christophe Crespelle, Eric Fleury:
Non-altering time scales for aggregation of dynamic networks into series of graphs. CoNEXT 2015: 29:1-29:7 - [c15]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS 2015: 212-223 - [c14]Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG 2015: 103-115 - 2014
- [j6]Christophe Crespelle, Philippe Gambette:
(Nearly-)tight bounds on the contiguity and linearity of cographs. Theor. Comput. Sci. 522: 1-12 (2014) - [c13]Lucie Martinet, Christophe Crespelle, Eric Fleury:
Dynamic Contact Network Analysis in Hospital Wards. CompleNet 2014: 241-249 - [c12]Elie Rotenberg, Christophe Crespelle, Matthieu Latapy:
Measuring routing tables in the internet. INFOCOM Workshops 2014: 795-800 - [c11]Fabien Tarissan, Elie Rotenberg, Matthieu Latapy, Christophe Crespelle:
UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology. MASCOTS 2014: 506-509 - [c10]Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan:
Measuring the degree distribution of routers in the core internet. Networking 2014: 1-9 - 2013
- [j5]Christophe Crespelle, Ioan Todinca:
An O(n2)O(n2)-time algorithm for the minimal interval completion problem. Theor. Comput. Sci. 494: 75-85 (2013) - [c9]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: 469-480 - [c8]Christophe Crespelle, Philippe Gambette:
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs. WALCOM 2013: 126-136 - 2012
- [c7]Vincent Neiger, Christophe Crespelle, Eric Fleury:
On the Structure of Changes in Dynamic Contact Networks. SITIS 2012: 731-738 - 2011
- [j4]Christophe Crespelle, Fabien Tarissan:
Evaluation of a new method for measuring the internet degree distribution: Simulation results. Comput. Commun. 34(5): 635-648 (2011) - 2010
- [j3]Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica 58(2): 405-432 (2010) - [j2]Christophe Crespelle, Philippe Gambette:
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. Inf. Process. Lett. 110(12-13): 497-502 (2010) - [c6]Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling. COCOA (1) 2010: 1-10 - [c5]Christophe Crespelle, Ioan Todinca:
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. TAMC 2010: 175-186
2000 – 2009
- 2009
- [c4]Christophe Crespelle, Philippe Gambette:
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search. IWOCA 2009: 146-157 - [c3]Christophe Crespelle:
Fully Dynamic Representations of Interval Graphs. WG 2009: 77-87 - 2007
- [b1]Christophe Crespelle:
Représentations dynamiques de graphes. (Dynamic Graph Representations). Montpellier 2 University, France, 2007 - 2006
- [j1]Christophe Crespelle, Christophe Paul:
Fully dynamic recognition algorithm and certificate for directed cographs. Discret. Appl. Math. 154(12): 1722-1741 (2006) - 2005
- [c2]Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. WG 2005: 38-48 - 2004
- [c1]Christophe Crespelle, Christophe Paul:
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG 2004: 93-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
