Chordal Graphs and Their Clique Graphs. - Philippe Galinier; Michel Habib; Christophe Paul (WG, 1995)

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. - Michel Habib; Christophe Paul; Laurent Viennot (STACS, 1998)

Diameter Determination on Restricted Graph Faminlies. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (WG, 1998)

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. - Michel Habib; Christophe Paul; Laurent Viennot (Int. J. Found. Comput. Sci., 1999)

Approximate Distance Labeling Schemes. - Cyril Gavoille; Christophe Paul (Electron. Notes Discret. Math., 2000)

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. - Michel Habib; Ross M. McConnell; Christophe Paul; Laurent Viennot (Theor. Comput. Sci., 2000)

Approximate Distance Labeling Schemes. - Cyril Gavoille; Michal Katz; Nir A. Katz; Christophe Paul; David Peleg (ESA, 2001)

Diameter determination on restricted graph families. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (Discret. Appl. Math., 2001)

Linear time recognition of P4-indifference graphs. - Michel Habib; Christophe Paul; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2001)

Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. - Cyril Gavoille; Christophe Paul (Electron. Notes Discret. Math., 2001)

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. - Guillaume Damiand; Michel Habib; Christophe Paul (Theor. Comput. Sci., 2001)

Optimal Distance Labeling for Interval and Circular-Arc Graphs. - Cyril Gavoille; Christophe Paul (ESA, 2003)

Approximate Multicommodity Flow for WDM Networks Design. - Mohamed Bouklit; David Coudert; Jean-François Lalande; Christophe Paul; Hervé Rivano (SIROCCO, 2003)

Distance labeling scheme and split decomposition. - Cyril Gavoille; Christophe Paul (Discret. Math., 2003)

A note on finding all homogeneous set sandwiches. - Michel Habib; Emmanuelle Lebhar; Christophe Paul (Inf. Process. Lett., 2003)

Maximal Common Connected Sets of Interval Graphs. - Michel Habib; Christophe Paul; Mathieu Raffinot (CPM, 2004)

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. - Michel Habib; Fabien de Montgolfier; Christophe Paul (SWAT, 2004)

On the Approximation of Computing Evolutionary Trees. - Vincent Berry; Sylvain Guillemot; François Nicolas; Christophe Paul (COCOON, 2005)

New Tools and Simpler Algorithms for Branchwidth. - Christophe Paul; Jan Arne Telle (ESA, 2005)

Revisiting T. Uno and M. Yagiura's Algorithm . - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (ISAAC, 2005)

A simple linear time algorithm for cograph recognition. - Michel Habib; Christophe Paul (Discret. Appl. Math., 2005)

Edge-maximal graphs of branchwidth k. - Christophe Paul; Jan Arne Telle (Electron. Notes Discret. Math., 2005)

Aspects algorithmiques de la décomposition modulaire. (Algorithmic aspects of modular decomposition). - Christophe Paul (2006)

Generation of Graphs with Bounded Branchwidth. - Christophe Paul; Andrzej Proskurowski; Jan Arne Telle (WG, 2006)

Fully dynamic recognition algorithm and certificate for directed cographs. - Christophe Crespelle; Christophe Paul (Discret. Appl. Math., 2006)

Eclecticism shrinks even small worlds. - Pierre Fraigniaud; Cyril Gavoille; Christophe Paul (Distributed Comput., 2006)

Dynamic Distance Hereditary Graphs Using Split Decomposition. - Emeric Gioan; Christophe Paul (ISAAC, 2007)

Interval completion with few edges. - Pinar Heggernes; Christophe Paul; Jan Arne Telle; Yngve Villanger (STOC, 2007)

Simple, linear-time modular decomposition - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (CoRR, 2007)

Can transitive orientation make sandwich problems easier? - Michel Habib; David Kelly; Emmanuelle Lebhar; Christophe Paul (Discret. Math., 2007)

Perfect Sorting by Reversals Is Not Always Difficult. - Sèverine Bérard; Anne Bergeron; Cédric Chauve; Christophe Paul (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

A note on alpha-drawable k-trees. - Svetlana Stolpner; Jonathan Lenchner; Giuseppe Liotta; David Bremner; Christophe Paul; Marc Pouget; Stephen K. Wismath (CCCG, 2008)

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (ICALP (1), 2008)

Perfect DCJ Rearrangement. - Sèverine Bérard; Annie Chateau; Cédric Chauve; Christophe Paul; Eric Tannier (RECOMB-CG, 2008)

A more efficient algorithm for perfect sorting by reversals. - Sèverine Bérard; Cédric Chauve; Christophe Paul (Inf. Process. Lett., 2008)

A Simple Linear Time LexBFS Cograph Recognition Algorithm. - Anna Bretscher; Derek G. Corneil; Michel Habib; Christophe Paul (SIAM J. Discret. Math., 2008)

Optimal Distance Labeling for Interval Graphs and Related Graph Families. - Cyril Gavoille; Christophe Paul (SIAM J. Discret. Math., 2008)

Competitive graph searches. - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (Theor. Comput. Sci., 2008)

The Structure of Level-k Phylogenetic Networks. - Philippe Gambette; Vincent Berry; Christophe Paul (CPM, 2009)

Computing galled networks from real data. - Daniel H. Huson; Regula Rupp; Vincent Berry; Philippe Gambette; Christophe Paul (Bioinform., 2009)

Abstract Milling with Turn Costs - Michael R. Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (CoRR, 2009)

Kinetic maintenance of mobile k-centres on trees. - Stephane Durocher; Christophe Paul (Discret. Appl. Math., 2009)

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. - Sylvain Guillemot; François Nicolas; Vincent Berry; Christophe Paul (Discret. Appl. Math., 2009)

Branchwidth of chordal graphs. - Christophe Paul; Jan Arne Telle (Discret. Appl. Math., 2009)

Edge-maximal graphs of branchwidth k: The k-branches. - Christophe Paul; Jan Arne Telle (Discret. Math., 2009)

Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. - Sèverine Bérard; Annie Chateau; Cédric Chauve; Christophe Paul; Eric Tannier (J. Comput. Biol., 2009)

Interval Completion Is Fixed Parameter Tractable. - Yngve Villanger; Pinar Heggernes; Christophe Paul; Jan Arne Telle (SIAM J. Comput., 2009)

Linear time 3-approximation for the MAST problem. - Vincent Berry; Christophe Paul; Sylvain Guillemot; François Nicolas (ACM Trans. Algorithms, 2009)

On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (IPEC, 2010)

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. - Mike Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (WG, 2010)

Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. - Pinar Heggernes; Daniel Lokshtanov; Jesper Nederlof; Christophe Paul; Jan Arne Telle (WG, 2010)

Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. - Christophe Crespelle; Christophe Paul (Algorithmica, 2010)

On the (non-)existence of polynomial kernels for Pl-free edge modification problems - Sylvain Guillemot; Christophe Paul; Anthony Perez 001 (CoRR, 2010)

A survey of the algorithmic aspects of modular decomposition. - Michel Habib; Christophe Paul (Comput. Sci. Rev., 2010)

Polynomial kernels for 3-leaf power graph modification problems. - Stéphane Bessy; Christophe Paul; Anthony Perez 001 (Discret. Appl. Math., 2010)

Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (MFCS, 2011)

Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (CoRR, 2011)

Circle Graph Recognition in Time O(n+m) α(n+m) - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (CoRR, 2011)

Kernels for feedback arc set in tournaments. - Stéphane Bessy; Fedor V. Fomin; Serge Gaspers; Christophe Paul; Anthony Perez 001; Saket Saurabh 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2011)

A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (SWAT, 2012)

A single-exponential FPT algorithm for the $K_4$-minor cover problem - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (CoRR, 2012)

Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. - Emeric Gioan; Christophe Paul (Discret. Appl. Math., 2012)

Quartets and Unrooted phylogenetic Networks. - Philippe Gambette; Vincent Berry; Christophe Paul (J. Bioinform. Comput. Biol., 2012)

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. - Sylvain Guillemot; Frédéric Havet; Christophe Paul; Anthony Perez 001 (Algorithmica, 2013)

Obtaining a Bipartite Graph by Contracting Few Edges. - Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov; Christophe Paul (SIAM J. Discret. Math., 2013)

Practical and Efficient Circle Graph Recognition. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Practical and Efficient Split Decomposition via Graph-Labelled Trees. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Contracting Graphs to Paths and Trees. - Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque; Daniel Lokshtanov; Christophe Paul (Algorithmica, 2014)

Contracting chordal graphs and bipartite graphs to paths and trees. - Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque; Christophe Paul (Discret. Appl. Math., 2014)

Parameterized Domination in Circle Graphs. - Nicolas Bousquet 001; Daniel Gonçalves 001; George B. Mertzios; Christophe Paul; Ignasi Sau; Stéphan Thomassé (Theory Comput. Syst., 2014)

Hitting and Harvesting Pumpkins. - Gwenaël Joret; Christophe Paul; Ignasi Sau; Saket Saurabh 001; Stéphan Thomassé (SIAM J. Discret. Math., 2014)

On Independent Set on B1-EPG Graphs. - Marin Bougeret; Stéphane Bessy; Daniel Gonçalves 001; Christophe Paul (WAOA, 2015)

FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Christophe Paul (CoRR, 2015)

A single-exponential FPT algorithm for the K4-minor cover problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (J. Comput. Syst. Sci., 2015)

Explicit Linear Kernels via Dynamic Programming. - Valentin Garnero; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2015)

Hadwiger Number of Graphs with Small Chordality. - Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Christophe Paul (SIAM J. Discret. Math., 2015)

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. - Julien Baste; Christophe Paul; Ignasi Sau; Céline Scornavacca (AAIM, 2016)

On the consistency of orthology relationships. - Mark Jones; Christophe Paul; Céline Scornavacca (BMC Bioinform., 2016)

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. - Christophe Paul; Anthony Perez 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2016)

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ACM Trans. Algorithms, 2016)

Split Decomposition via Graph-Labelled Trees. - Christophe Paul (Encyclopedia of Algorithms, 2016)

Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (ICALP, 2017)

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Christophe Paul (Algorithmica, 2017)

Strong immersion is a well-quasi-ordering for semi-complete digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (CoRR, 2017)

A polynomial-time algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (J. Comput. Syst. Sci., 2017)

Parameterized algorithms for min-max multiway cut and list digraph homomorphism. - Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2017)

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. - Didem Gözüpek; Sibel Özkan; Christophe Paul; Ignasi Sau; Mordechai Shalom (Theor. Comput. Sci., 2017)

An FPT 2-Approximation for Tree-Cut Decomposition. - Eun Jung Kim 002; Sang-il Oum; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2018)

Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. - Derek G. Corneil; Sang-il Oum; Christophe Paul (Discret. Appl. Math., 2018)

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (ACM Trans. Algorithms, 2018)

Explicit Linear Kernels for Packing Problems. - Valentin Garnero; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2019)

Strong immersion is a well-quasi-ordering for semicomplete digraphs. - Florian Barbero; Christophe Paul; Michal Pilipczuk (J. Graph Theory, 2019)

Hierarchical Clusterings of Unweighted Graphs. - Svein Høgemo; Christophe Paul; Jan Arne Telle (MFCS, 2020)

Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. - Christophe Paul; Michal Pilipczuk (Algorithmica, 2020)

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. - Christophe Paul; Guillaume Mescoff; Dimitrios M. Thilikos (CoRR, 2020)

On independent set in B1-EPG graphs. - Stéphane Bessy; Marin Bougeret; Steven Chaplick; Daniel Gonçalves 001; Christophe Paul (Discret. Appl. Math., 2020)

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. - Julien Baste; Didem Gözüpek; Christophe Paul; Ignasi Sau; Mordechai Shalom; Dimitrios M. Thilikos (Networks, 2020)

Edge degeneracy: Algorithmic and structural results. - Stratis Limnios; Christophe Paul; Joanny Perret; Dimitrios M. Thilikos (Theor. Comput. Sci., 2020)

On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. - Svein Høgemo; Benjamin Bergougnoux; Ulrik Brandes; Christophe Paul; Jan Arne Telle (FCT, 2021)

Edge-trewidth: Algorithmic and combinatorial properties. - Loïc Magne; Christophe Paul; Abhijat Sharma; Dimitrios M. Thilikos (CoRR, 2021)

Connected search for a lazy robber. - Isolde Adler; Christophe Paul; Dimitrios M. Thilikos (J. Graph Theory, 2021)

Preface of STACS 2019 Special Issue. - Rolf Niedermeier; Christophe Paul (Theory Comput. Syst., 2021)

A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. - Guillaume Mescoff; Christophe Paul; Dimitrios M. Thilikos (Discret. Appl. Math., 2022)

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. - Mamadou Moustapha Kanté; Christophe Paul; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2022)

Graph Parameters, Universal Obstructions, and WQO. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos (CoRR, 2023)

Universal Obstructions of Graph Parameters. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos (CoRR, 2023)

Preface of STACS 2020 Special Issue. - Christophe Paul; Markus Bläser (Theory Comput. Syst., 2023)

The mixed search game against an agile and visible fugitive is monotone. - Guillaume Mescoff; Christophe Paul; Dimitrios M. Thilikos (Discret. Math., 2023)

Edge-treewidth: Algorithmic and combinatorial properties. - Loïc Magne; Christophe Paul; Abhijat Sharma; Dimitrios M. Thilikos (Discret. Appl. Math., 2023)

Obstructions to Erdös-Pósa Dualities for Minors. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (FOCS, 2024)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (ICALP, 2024)

Tree-Layout Based Graph Classes: Proper Chordal Graphs. - Christophe Paul; Evangelos Protopapas (STACS, 2024)

Twin-Width One. - Jungho Ahn; Hugo Jacob 001; Noleen Köhler; Christophe Paul; Amadeus Reinald; Sebastian Wiederrecht (STACS, 2025)

On a tree-based variant of bandwidth and forbidding simple topological minors. - Hugo Jacob 001; William Lochet; Christophe Paul (CoRR, 2025)

The Local Structure Theorem for Graph Minors with Finite Index. - Christophe Paul; Evangelos Protopapas; Dimitrios M. Thilikos; Sebastian Wiederrecht (CoRR, 2025)