Christophe Paul

Cited by

	All	Since 2020
Citations	4026	1131
h-index	31	18
i10-index	67	35

240

120

180

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202515 8 12 10 37 92 118 149 139 147 159 173 184 177 185 176 185 202 212 201 226 234 206 220 221 201 48

Public access

View all

18 articles

1 article

available

not available

Based on funding mandates

Co-authors

Michel HabibComputer Science, Université Paris CitéVerified email at irif.fr
Dimitrios M. ThilikosNational and Kapodistrian University of AthensVerified email at thilikos.info
Ignasi SauCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
Cyril GavoilleProfesseur d'informatique, Université de BordeauxVerified email at labri.fr
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Eun Jung KimKAIST, CNRSVerified email at kaist.ac.kr
Vincent BerryLIRMM, Université Montpellier - CNRSVerified email at lirmm.fr
Laurent ViennotInriaVerified email at inria.fr
Cedric ChauveProfessor of Mathematics, Simon Fraser UniversityVerified email at sfu.ca
Pim van 't HofUniversity of TwenteVerified email at utwente.nl
Philippe GambetteAssociate Professor of Computer Science, Université Gustave EiffelVerified email at u-pem.fr
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Yngve VillangerUniversity of BergenVerified email at uib.no
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
Anne BergeronComputer Science, Université du Québec à MontréalVerified email at uqam.ca
Feodor F. DraganKent State UniversityVerified email at CS.KENT.EDU
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au

Christophe Paul

CNRS LIRMM

Verified email at lirmm.fr - Homepage

algorithms graph theory parameterized complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing M Habib, R Mac Connell, C Paul, L Viennot Theoretical Computer Science 234, 2000	402	2000
Simpler linear-time modular decomposition via recursive factorizing permutations M Tedder, D Corneil, M Habib, C Paul Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008	238	2008
A survey of the algorithmic aspects of modular decomposition M Habib, C Paul Computer Science Review 4 (1), 41-59, 2010	237	2010
A simple linear time LexBFS cograph recognition algorithm A Bretscher, D Corneil, M Habib, C Paul SIAM Journal on Discrete Mathematics 22 (4), 1277-1296, 2008	143*	2008
A simple linear time algorithm for cograph recognition M Habib, C Paul Discrete Applied Mathematics 145 (2), 183-197, 2005	143	2005
Chordal graphs and their clique graphs P Galinier, M Habib, C Paul International Workshop on Graph-Theoretic Concepts in Computer Science, 358-371, 1995	136	1995
Linear kernels and single-exponential algorithms via protrusion decompositions EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015	125	2015
Approximate distance labeling schemes C Gavoille, M Katz, NA Katz, C Paul, D Peleg Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 2001	123	2001
Partition refinement techniques: An interesting algorithmic tool kit M Habib, C Paul, L Viennot International Journal of Foundations of Computer Science 10 (02), 147-170, 1999	123	1999
Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009	109*	2009
Eclecticism shrinks even small worlds P Fraigniaud, C Gavoille, C Paul Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004	96	2004
Fully dynamic recognition algorithm and certificate for directed cographs C Crespelle, C Paul Discrete Applied Mathematics 154 (12), 1722-1741, 2006	91	2006
A simple linear-time modular decomposition algorithm for graphs, using order extension M Habib, F De Montgolfier, C Paul Scandinavian Workshop on Algorithm Theory, 187-198, 2004	90	2004
Perfect sorting by reversals is not always difficult S Bérard, A Bergeron, C Chauve, C Paul IEEE/ACM transactions on computational biology and bioinformatics 4 (1), 4-16, 2007	86	2007
Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul Discrete Applied Mathematics 113 (2-3), 143-166, 2001	86	2001
Computing galled networks from real data DH Huson, R Rupp, V Berry, P Gambette, C Paul Bioinformatics 25 (12), i85-i93, 2009	85	2009
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs G Damiand, M Habib, C Paul Theoretical Computer Science 263 (1-2), 99-111, 2001	84	2001
On the (Non-)Existence of Polynomial Kernels for P _l-Free Edge Modification Problems S Guillemot, F Havet, C Paul, A Perez Algorithmica 65, 900-926, 2013	83	2013
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs E Gioan, C Paul Discrete Applied Mathematics 160 (6), 708-733, 2012	80*	2012
Kernels for feedback arc set in tournaments S Bessy, FV Fomin, S Gaspers, C Paul, A Perez, S Saurabh, S Thomassé Journal of Computer and System Sciences 77 (6), 1071-1078, 2011	80	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors