C. Paul

发表

Chordal Graphs and Their Clique Graphs

Michel Habib, Christophe Paul, Philippe Galinier, 1995, WG.

A survey of the algorithmic aspects of modular decomposition

Michel Habib, Christophe Paul, M. Habib, 2009, Comput. Sci. Rev..

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Michel Habib, Christophe Paul, Guillaume Damiand, 2001, Theor. Comput. Sci..

A simple linear time algorithm for cograph recognition

Michel Habib, Christophe Paul, M. Habib, 2005, Discret. Appl. Math..

A more efficient algorithm for perfect sorting by reversals

Christophe Paul, Cédric Chauve, Sèverine Bérard, 2008, Inf. Process. Lett..

Split Decomposition via Graph-Labelled Trees

C. Paul, 2016 .

Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$

D. Corneil, C. Paul, E. Gioan, 2011 .

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Laurent Viennot, Michel Habib, Christophe Paul, 2000, Theor. Comput. Sci..

Common Connected Components of Interval Graphs

M. Habib, C. Paul, M. Raffinot, 2016 .

Partition refinement and graph decomposition

M. Habib, C. Paul, L. Viennot, 1999, SODA 1999.

Perfect Sorting by Reversals Is Not Always Difficult

C. Paul, C. Chauve, S. Bérard, 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Deposited in DRO : 16 September 2014 Version of attached le : Peer-review status of attached le : Peer-reviewed Citation for published item

C. Paul, D. Gonçalves, N. Bousquet, 2014 .

Treewidth reduction for the parameterized Multicut problem ∗

C. Paul, Stéphan Thomassé, J. Daligault, 2010 .

On the approximation of computing of evolutionary trees Research report-LIRMM 05016

C. Paul, V. Berry, Sylvain Guillemot, 2022 .

Algorithmic generation of graphs of branchwidth 6 k Extended Abstract

C. Paul, A. Proskurowski, J. A. Telle, 2005 .

2 GALLED NETWORKS COMPARED WITH GALLED TREES , LEVEL K NETWORKS AND MORE GENERAL ROOTED PHYLOGENETIC NETWORKS

C. Paul, D. Huson, V. Berry, 2018 .

2 Standard definitions and earlier results

C. Paul, J. A. Telle, 2007 .

Approximate Distance Labeling Schemes (Extended Abstract)

Nir A. Katz, D. Peleg, C. Paul, 2001 .

The mixed search game against an agile and visible fugitive is monotone

C. Paul, D. Thilikos, Guillaume Mescoff, 2022, ArXiv.

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

Laurent Viennot, Michel Habib, Christophe Paul, 1999, Int. J. Found. Comput. Sci..

New Tools and Results for Branchwidth

C. Paul, J. A. Telle, 2005 .

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

C. Paul, Céline Scornavacca, Julien Baste, 2016, Bulletin of mathematical biology.

Simple, linear-time modular decomposition

M. Habib, D. Corneil, C. Paul, 2007, ArXiv.

D M ] 2 1 O ct 2 00 7 Simple , Linear-time Modular Decomposition ∗ ( extended abstract )

M. Habib, D. Corneil, C. Paul, 2007 .

Eclecticism shrinks the world

Pierre Fraigniaud, Cyril Gavoille, Christophe Paul, 2003, PODC 2003.

Divide and Conquer Revisited. Application to Graph Algorithms

M. Habib, C. Paul, Binh-Minh Bui-Xuan, 2020 .

A Linear-Time Algorithm for Recognition of Catval Graphs

M. Habib, C. Paul, J. A. Telle, 2003 .

Identifying Common Connected Components of Graphs

M. Habib, C. Paul, M. Raffinot, 2020 .

On Poset Sandwich Problems

M. Habib, C. Paul, David Kelly, 2003 .

Circle Graph Recognition in Time O(n+m) α(n+m) pdf

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, ArXiv.

Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015

Christophe Paul, Derek G. Corneil, Sang-il Oum, 2018, Discret. Appl. Math..

A linear fixed parameter tractable algorithm for connected pathwidth

Mamadou Moustapha Kant'e, C. Paul, D. Thilikos, 2020, ESA.

Perfect Sorting by Reversal is not Always Diﬀicult

C. Paul, Anne Bergeron, Cédric Chauve, 2022 .

Tree-layout based graph classes: proper chordal graphs

C. Paul, Evangelos Protopapas, 2022, ArXiv.

Explicit Linear Kernels for Packing Problems

C. Paul, D. Thilikos, Ignasi Sau, 2016, Algorithmica.

The mixed search game against an agile and visible fugitive is monotone

C. Paul, D. Thilikos, Guillaume Mescoff, 2022, ArXiv.

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion

Christophe Paul, Mamadou Moustapha Kanté, Eun Jung Kim, 2015, Algorithmica.

Computing galled networks from real data

Daniel H. Huson, Christophe Paul, Vincent Berry, 2009, Bioinform..

The Structure of Level-k Phylogenetic Networks

Christophe Paul, Vincent Berry, Philippe Gambette, 2009, CPM.

Fully dynamic recognition algorithm and certificate for directed cographs

Christophe Paul, Christophe Crespelle, C. Paul, 2004, Graph-Theoretic Concepts in Computer Science.

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Michel Habib, Christophe Paul, Derek G. Corneil, 2003, WG.

On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems

Christophe Paul, Sylvain Guillemot, Anthony Perez, 2010, Algorithmica.

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

Michel Habib, Christophe Paul, Derek G. Corneil, 2008, ICALP.

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

Michel Habib, Christophe Paul, Fabien de Montgolfier, 2004, SWAT.

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

M. Habib, C. Paul, L. Viennot, 1999, Int. J. Found. Comput. Sci..

Perfect Sorting by Reversals Is Not Always Difficult

Christophe Paul, Anne Bergeron, Cédric Chauve, 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Hierarchical Clusterings of Unweighted Graphs

Christophe Paul, Jan Arne Telle, Svein Høgemo, 2020, MFCS.

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems pdf

Christophe Paul, Sylvain Guillemot, François Nicolas, 2008, Discret. Appl. Math..

Eclecticism shrinks even small worlds

Pierre Fraigniaud, Cyril Gavoille, Christophe Paul, 2004, PODC '04.

Maximal Common Connected Sets of Interval Graphs

Mathieu Raffinot, Michel Habib, Christophe Paul, 2004, CPM.

Optimal Distance Labeling for Interval Graphs and Related Graph Families

Cyril Gavoille, Christophe Paul, C. Paul, 2008, SIAM J. Discret. Math..

Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs

Cyril Gavoille, Christophe Paul, C. Paul, 2001, Electron. Notes Discret. Math..

Approximate Distance Labeling Schemes

Cyril Gavoille, Christophe Paul, C. Paul, 2000, Electron. Notes Discret. Math..

Contracting chordal graphs and bipartite graphs to paths and trees

Pim van 't Hof, Pinar Heggernes, Christophe Paul, 2011, Discret. Appl. Math..

Practical and Efficient Circle Graph Recognition

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, Algorithmica.

Practical and Efficient Split Decomposition via Graph-Labelled Trees

Emeric Gioan, Christophe Paul, Derek G. Corneil, 2011, Algorithmica.

Branchwidth of chordal graphs

Christophe Paul, Jan Arne Telle, C. Paul, 2009, Discret. Appl. Math..

Interval Completion Is Fixed Parameter Tractable

Pinar Heggernes, Christophe Paul, Jan Arne Telle, 2008, SIAM J. Comput..

Interval completion with few edges

Pinar Heggernes, Christophe Paul, Jan Arne Telle, 2007, STOC '07.

Universal Obstructions of Graph Parameters

C. Paul, D. Thilikos, Evangelos Protopapas, 2023, ArXiv.

Graph Parameters, Universal Obstructions, and WQO

C. Paul, D. Thilikos, Evangelos Protopapas, 2023, ArXiv.

Sorting by Short Block-Moves

S Heath Lenwood, C. Paul, C Vergara John Paul, 1998 .

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph pdf

Christophe Paul, Guillaume Mescoff, Dimitrios Thilikos, 2020, Discret. Appl. Math..

Quartets and Unrooted phylogenetic Networks

Christophe Paul, Vincent Berry, Philippe Gambette, 2012, J. Bioinform. Comput. Biol..

Kernels for feedback arc set in tournaments

Fedor V. Fomin, Saket Saurabh, Christophe Paul, 2009, J. Comput. Syst. Sci..

Diameter determination on restricted graph families

Feodor F. Dragan, Michel Habib, Christophe Paul, 1998, Discret. Appl. Math..

Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes

Annie Chateau, Christophe Paul, Cédric Chauve, 2009, J. Comput. Biol..

Perfect DCJ Rearrangement

Annie Chateau, Christophe Paul, Cédric Chauve, 2008, RECOMB-CG.

Edge-trewidth: Algorithmic and combinatorial properties pdf

Dimitrios M. Thilikos, Christophe Paul, Loic Magne, 2021, ArXiv.

Connected search for a lazy robber

Christophe Paul, Dimitrios M. Thilikos, Isolde Adler, 2020, FSTTCS.

A single-exponential FPT algorithm for the K4-minor cover problem

Geevarghese Philip, Christophe Paul, Eun Jung Kim, 2012, J. Comput. Syst. Sci..

Edge-treewidth: Algorithmic and combinatorial properties

C. Paul, D. Thilikos, L. Magne, 2023, Discrete Applied Mathematics.

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability pdf

Didem Gözüpek, Mordechai Shalom, Christophe Paul, 2016, Theor. Comput. Sci..

An FPT 2-Approximation for Tree-Cut Decomposition

Dimitrios M. Thilikos, Christophe Paul, Eun Jung Kim, 2015, Algorithmica.

Explicit Linear Kernels for Packing Problems

Dimitrios M. Thilikos, Christophe Paul, Valentin Garnero, 2016, Algorithmica.

Explicit Linear Kernels via Dynamic Programming

Dimitrios M. Thilikos, Christophe Paul, Valentin Garnero, 2013, SIAM J. Discret. Math..

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions pdf

Christophe Paul, Eun Jung Kim, Alexander Langer, 2012, ICALP.

On Independent Set on B1-EPG Graphs pdf

Marin Bougeret, Christophe Paul, Stéphane Bessy, 2015, WAOA.

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Christophe Paul, Ignasi Sau, Julien Baste, 2016, AAIM.

Obtaining a Bipartite Graph by Contracting Few Edges pdf

Pim van 't Hof, Pinar Heggernes, Christophe Paul, 2011, SIAM J. Discret. Math..

Kinetic maintenance of mobile k-centres on trees

Stephane Durocher, Christophe Paul, C. Paul, 2007, Discret. Appl. Math..

A Simple Linear-Time Modular Decomposition Algorithm for Modular Decomposition

Michel Habib, Christophe Paul, Fabien de Montgolfier, 2003 .

FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion pdf

Christophe Paul, Mamadou Moustapha Kanté, Eun Jung Kim, 2015, ArXiv.

Contracting Graphs to Paths and Trees

Pim van 't Hof, Pinar Heggernes, Christophe Paul, 2011, Algorithmica.

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique

Christophe Paul, Stéphan Thomassé, Anthony Perez, 2016, J. Comput. Syst. Sci..

Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem

Christophe Paul, Stéphan Thomassé, Anthony Perez, 2011, MFCS.

Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances

C. Paul, Anthony Perez, St'ephan Thomass'e, 2011, 1101.4491.

Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems pdf

Christophe Paul, Stéphan Thomassé, Anthony Perez, 2011, ArXiv.

Edge-maximal graphs of branchwidth k: The k-branches

Christophe Paul, Jan Arne Telle, C. Paul, 2009, Discret. Math..

Generation of Graphs with Bounded Branchwidth

Christophe Paul, Jan Arne Telle, Andrzej Proskurowski, 2006, WG.

Edge-maximal graphs of branchwidth k

Christophe Paul, Jan Arne Telle, C. Paul, 2005, Electron. Notes Discret. Math..

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

M. Habib, C. Paul, L. Viennot, 1999, Int. J. Found. Comput. Sci..

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata

Laurent Viennot, Michel Habib, Christophe Paul, 1998, STACS.

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs

Michal Pilipczuk, Christophe Paul, Florian Barbero, 2017, ICALP.

Algorithmic Generation of Graphs of Branch-width ≤ k

C. Paul, A. Proskurowski, J. A. Telle, 2008 .

Can transitive orientation make sandwich problems easier?

Michel Habib, Christophe Paul, David Kelly, 2007, Discret. Math..

Optimal Distance Labeling for Interval and Circular-Arc Graphs

Cyril Gavoille, Christophe Paul, C. Paul, 2003, ESA.

Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs pdf

Emeric Gioan, Christophe Paul, C. Paul, 2008, Discret. Appl. Math..

Dynamic Distance Hereditary Graphs Using Split Decomposition

Emeric Gioan, Christophe Paul, C. Paul, 2007, ISAAC.

Revisiting T. Uno and M. Yagiura's Algorithm

Michel Habib, Christophe Paul, Binh-Minh Bui-Xuan, 2005, ISAAC.