Christophe Paul

Cited by

	All	Since 2018
Citations	3608	1250
h-index	29	20
i10-index	64	36

260

130

195

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202316 10 13 12 43 84 109 139 125 145 155 171 165 182 174 161 171 199 212 198 208 234 205 243 161

Public access

View all

16 articles

1 article

available

not available

Based on funding mandates

Co-authors

Michel HabibComputer Science, Université Paris CitéVerified email at irif.fr
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
Ignasi SauCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Cyril GavoilleProfesseur d'informatique, Université de BordeauxVerified email at labri.fr
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified email at thilikos.info
Laurent ViennotInriaVerified email at inria.fr
Eun Jung KimLAMSADEVerified email at dauphine.fr
Vincent BerryLIRMM, Université Montpellier - CNRSVerified email at lirmm.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
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
Yngve VillangerUniversity of BergenVerified email at uib.no
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Ross M. McConnellAssociate Professor of Computer Science, Colorado State UniversityVerified email at cs.colostate.edu
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

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 and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing M Habib, R McConnell, C Paul, L Viennot Theoretical Computer Science 234 (1-2), 59-84, 2000	374	2000
A survey of the algorithmic aspects of modular decomposition M Habib, C Paul Computer Science Review 4 (1), 41-59, 2010	207	2010
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	191	2008
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	134*	2008
Chordal graphs and their clique graphs P Galinier, M Habib, C Paul International Workshop on Graph-Theoretic Concepts in Computer Science, 358-371, 1995	132	1995
A simple linear time algorithm for cograph recognition M Habib, C Paul Discrete Applied Mathematics 145 (2), 183-197, 2005	131	2005
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	122	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	119	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	117	1999
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
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	85	2004
Fully dynamic recognition algorithm and certificate for directed cographs C Crespelle, C Paul Discrete Applied Mathematics 154 (12), 1722-1741, 2006	83	2006
Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul Discrete Applied Mathematics 113 (2-3), 143-166, 2001	81	2001
Computing galled networks from real data DH Huson, R Rupp, V Berry, P Gambette, C Paul Bioinformatics 25 (12), i85-i93, 2009	80	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	79	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	76	2013
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	70	2011
Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009	63	2009
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	63	2007
Obtaining a bipartite graph by contracting few edges P Heggernes, PVT Hof, D Lokshtanov, C Paul SIAM Journal on Discrete Mathematics 27 (4), 2143-2156, 2013	60	2013

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