Christophe Paul

176 papers A* 5A 12B 29C 3Misc 2Journal 114Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Circle Graphs Can Be Recognized in Linear Time. STACS Christophe Paul, Ignaz Rutter
2025	J	`jnl`	Circle graphs can be recognized in linear time. CoRR Christophe Paul, Ignaz Rutter
2025	J	`jnl`	Graph Parameters, Universal Obstructions, and WQO. Order Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2025	J	`jnl`	On a tree-based variant of bandwidth and forbidding simple topological minors. CoRR Hugo Jacob, William Lochet, Christophe Paul
2025	J	`jnl`	The Local Structure Theorem for Graph Minors with Finite Index. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2025	A	`conf`	Twin-Width One. STACS Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht
2025	J	`jnl`	Twin-width one. CoRR Jungho Ahn, Hugo Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht
2024	A*	`conf`	Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	A*	`conf`	Obstructions to Erdös-Pósa Dualities for Minors. FOCS Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	J	`jnl`	Obstructions to Erdös-Pósa Dualities for Minors. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
2024	A	`conf`	Tree-Layout Based Graph Classes: Proper Chordal Graphs. STACS Christophe Paul, Evangelos Protopapas
2023	J	`jnl`	Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
2023	J	`jnl`	Graph Parameters, Universal Obstructions, and WQO. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2023	J	`jnl`	Preface of STACS 2020 Special Issue. Theory Comput. Syst. Christophe Paul, Markus Bläser
2023	J	`jnl`	The mixed search game against an agile and visible fugitive is monotone. Discret. Math. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2023	J	`jnl`	Universal Obstructions of Graph Parameters. CoRR Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
2022	J	`jnl`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	The mixed search game against an agile and visible fugitive is monotone. CoRR Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
2022	J	`jnl`	Tree-layout based graph classes: proper chordal graphs. CoRR Christophe Paul, Evangelos Protopapas
2021	J	`jnl`	Connected search for a lazy robber. J. Graph Theory Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2021	J	`jnl`	Edge-trewidth: Algorithmic and combinatorial properties. CoRR Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
2021	B	`conf`	On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
2021	J	`jnl`	Preface of STACS 2019 Special Issue. Theory Comput. Syst. Rolf Niedermeier, Christophe Paul
2020	A	`ed.`	37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, March 10-13, 2020 STACS Christophe Paul, Markus Bläser
2020	A	`conf`	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	J	`jnl`	A linear fixed parameter tractable algorithm for connected pathwidth. CoRR Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
2020	J	`jnl`	A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos
2020	J	`jnl`	Edge Degeneracy: Algorithmic and Structural Results. CoRR Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
2020	J	`jnl`	Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
2020	B	`conf`	Hierarchical Clusterings of Unweighted Graphs. MFCS Svein Høgemo, Christophe Paul, Jan Arne Telle
2020	J	`jnl`	Hierarchical Clusterings of Unweighted Graphs. CoRR Svein Høgemo, Christophe Paul, Jan Arne Telle
2020	J	`jnl`	On independent set in B1-EPG graphs. Discret. Appl. Math. Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
2020	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2020	J	`jnl`	Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica Christophe Paul, Michal Pilipczuk
2019	B	`ed.`	13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, August 20-24, 2018 IPEC Christophe Paul, Michal Pilipczuk
2019	A	`ed.`	36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, March 13-16, 2019 STACS Rolf Niedermeier, Christophe Paul
2019	—	`conf`	Connected Search for a Lazy Robber. FSTTCS Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
2019	J	`jnl`	Explicit Linear Kernels for Packing Problems. Algorithmica Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2019	J	`jnl`	Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory Florian Barbero, Christophe Paul, Michal Pilipczuk
2018	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms Florian Barbero, Christophe Paul, Michal Pilipczuk
2018	J	`jnl`	Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. Derek G. Corneil, Sang-il Oum, Christophe Paul
2017	J	`jnl`	A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2017	J	`jnl`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2017	A*	`conf`	Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP Florian Barbero, Christophe Paul, Michal Pilipczuk
2017	J	`jnl`	Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR Florian Barbero, Christophe Paul, Michal Pilipczuk
2017	B	`conf`	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2017	J	`jnl`	Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR Florian Barbero, Christophe Paul, Michal Pilipczuk
2016	C	`conf`	Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	Explicit linear kernels for packing problems. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2016	J	`jnl`	Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2016	J	`jnl`	Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. J. Comput. Syst. Sci. Christophe Paul, Anthony Perez, Stéphan Thomassé
2016	J	`jnl`	On the consistency of orthology relationships. BMC Bioinform. Mark Jones, Christophe Paul, Céline Scornavacca
2016	B	`conf`	Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016	J	`jnl`	Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016	—	`ch.`	Split Decomposition via Graph-Labelled Trees. Encyclopedia of Algorithms Christophe Paul
2015	Misc	`conf`	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2015	J	`jnl`	A single-exponential FPT algorithm for the K J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Geevarghese Philip
2015	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. CoRR Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An FPT 2-Approximation for Tree-cut Decomposition. WAOA Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	J	`jnl`	Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
2015	J	`jnl`	Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2015	B	`conf`	On Independent Set on B1-EPG Graphs. WAOA Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
2015	J	`jnl`	On independent set on B1-EPG graphs. CoRR Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
2015	B	`conf`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2014	J	`jnl`	A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2014	J	`jnl`	Contracting Graphs to Paths and Trees. Algorithmica Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2014	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2014	A	`conf`	Explicit Linear Kernels via Dynamic Programming. STACS Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2014	B	`conf`	Hadwiger Number of Graphs with Small Chordality. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Hadwiger number of graphs with small chordality. CoRR Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2014	J	`jnl`	Parameterized Domination in Circle Graphs. Theory Comput. Syst. Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2014	J	`jnl`	Practical and Efficient Circle Graph Recognition. Algorithmica Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2014	J	`jnl`	Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2013	J	`jnl`	Explicit linear kernels via dynamic programming. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2013	—	`conf`	Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2013	J	`jnl`	On the (Non-)Existence of Polynomial Kernels for Algorithmica Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez
2012	—	`conf`	A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT Eun Jung Kim, Christophe Paul, Geevarghese Philip
2012	J	`jnl`	A single-exponential FPT algorithm for the $K_4$-minor cover problem CoRR Eun Jung Kim, Christophe Paul, Geevarghese Philip
2012	J	`jnl`	Linear kernels and single-exponential algorithms via protrusion decompositions CoRR Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012	J	`jnl`	Parameterized Domination in Circle Graphs CoRR Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	B	`conf`	Parameterized Domination in Circle Graphs. WG Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	J	`jnl`	Quartets and Unrooted phylogenetic Networks. J. Bioinform. Comput. Biol. Philippe Gambette, Vincent Berry, Christophe Paul
2012	J	`jnl`	Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. Discret. Appl. Math. Emeric Gioan, Christophe Paul
2011	J	`jnl`	Circle Graph Recognition in Time O(n+m) α(n+m) CoRR Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2011	B	`conf`	Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. MFCS Christophe Paul, Anthony Perez, Stéphan Thomassé
2011	J	`jnl`	Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems CoRR Christophe Paul, Anthony Perez, Stéphan Thomassé
2011	J	`jnl`	Contracting Graphs to Paths and Trees CoRR Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Contracting Graphs to Paths and Trees. IPEC Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2011	J	`jnl`	Hitting and Harvesting Pumpkins CoRR Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting and Harvesting Pumpkins. ESA Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	J	`jnl`	Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2011	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges CoRR Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	—	`conf`	Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Practical and Efficient Split Decomposition via Graph-Labelled Trees CoRR Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2010	J	`jnl`	A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. Michel Habib, Christophe Paul
2010	J	`jnl`	Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica Christophe Crespelle, Christophe Paul
2010	B	`conf`	Generalized Graph Clustering: Recognizing ( WG Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
2010	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers WG Christophe Paul, Michel Habib
2010	B	`conf`	Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2010	B	`conf`	On the (Non-)existence of Polynomial Kernels for IPEC Sylvain Guillemot, Christophe Paul, Anthony Perez
2010	J	`jnl`	On the (non-)existence of polynomial kernels for Pl-free edge modification problems CoRR Sylvain Guillemot, Christophe Paul, Anthony Perez
2010	J	`jnl`	Polynomial kernels for 3-leaf power graph modification problems. Discret. Appl. Math. Stéphane Bessy, Christophe Paul, Anthony Perez
2009	J	`jnl`	A survey on algorithmic aspects of modular decomposition CoRR Michel Habib, Christophe Paul
2009	J	`jnl`	Abstract Milling with Turn Costs CoRR Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009	J	`jnl`	Branchwidth of chordal graphs. Discret. Appl. Math. Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. J. Comput. Biol. Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier
2009	J	`jnl`	Computing galled networks from real data. Bioinform. Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul
2009	J	`jnl`	Edge-maximal graphs of branchwidth k: The k-branches. Discret. Math. Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle
2009	J	`jnl`	Kernels for Feedback Arc Set In Tournaments CoRR Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	—	`conf`	Kernels for Feedback Arc Set In Tournaments. FSTTCS Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	Kinetic maintenance of mobile k-centres on trees. Discret. Appl. Math. Stephane Durocher, Christophe Paul
2009	J	`jnl`	Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas
2009	J	`jnl`	On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discret. Appl. Math. Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul
2009	C	`conf`	Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA Stéphane Bessy, Christophe Paul, Anthony Perez
2009	B	`conf`	The Structure of Level-k Phylogenetic Networks. CPM Philippe Gambette, Vincent Berry, Christophe Paul
2008	J	`jnl`	A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
2008	J	`jnl`	A more efficient algorithm for perfect sorting by reversals. Inf. Process. Lett. Sèverine Bérard, Cédric Chauve, Christophe Paul
2008	—	`conf`	A note on alpha-drawable k-trees. CCCG Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath
2008	J	`jnl`	Competitive graph searches. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2008	J	`jnl`	Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discret. Math. Cyril Gavoille, Christophe Paul
2008	—	`conf`	Perfect DCJ Rearrangement. RECOMB-CG Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier
2008	J	`jnl`	Polynomial kernels for 3-leaf power graph modification problems CoRR Stéphane Bessy, Christophe Paul, Anthony Perez
2008	—	`conf`	Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
2008	J	`jnl`	Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs CoRR Emeric Gioan, Christophe Paul
2007	J	`jnl`	Can transitive orientation make sandwich problems easier? Discret. Math. Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
2007	B	`conf`	Dynamic Distance Hereditary Graphs Using Split Decomposition. ISAAC Emeric Gioan, Christophe Paul
2007	A*	`conf`	Interval completion with few edges. STOC Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
2007	B	`conf`	Kinetic Maintenance of Mobile k-Centres on Trees. ISAAC Stephane Durocher, Christophe Paul
2007	J	`jnl`	Perfect Sorting by Reversals Is Not Always Difficult. IEEE ACM Trans. Comput. Biol. Bioinform. Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
2007	J	`jnl`	Simple, linear-time modular decomposition CoRR Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
2006	—	`book`	Aspects algorithmiques de la décomposition modulaire. (Algorithmic aspects of modular decomposition). Christophe Paul
2006	J	`jnl`	Eclecticism shrinks even small worlds. Distributed Comput. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2006	J	`jnl`	Fully dynamic recognition algorithm and certificate for directed cographs. Discret. Appl. Math. Christophe Crespelle, Christophe Paul
2006	B	`conf`	Generation of Graphs with Bounded Branchwidth. WG Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
2005	J	`jnl`	A simple linear time algorithm for cograph recognition. Discret. Appl. Math. Michel Habib, Christophe Paul
2005	J	`jnl`	Edge-maximal graphs of branchwidth k. Electron. Notes Discret. Math. Christophe Paul, Jan Arne Telle
2005	B	`conf`	Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. WG Christophe Crespelle, Christophe Paul
2005	A	`conf`	New Tools and Simpler Algorithms for Branchwidth. ESA Christophe Paul, Jan Arne Telle
2005	Misc	`conf`	On the Approximation of Computing Evolutionary Trees. COCOON Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
2005	C	`conf`	Perfect Sorting by Reversals Is Not Always Difficult. WABI Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul
2005	B	`conf`	Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2004	—	`conf`	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT Michel Habib, Fabien de Montgolfier, Christophe Paul
2004	A*	`conf`	Eclecticism shrinks even small worlds. PODC Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
2004	B	`conf`	Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG Christophe Crespelle, Christophe Paul
2004	B	`conf`	Maximal Common Connected Sets of Interval Graphs. CPM Michel Habib, Christophe Paul, Mathieu Raffinot
2003	B	`conf`	A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
2003	J	`jnl`	A note on finding all homogeneous set sandwiches. Inf. Process. Lett. Michel Habib, Emmanuelle Lebhar, Christophe Paul
2003	B	`conf`	Approximate Multicommodity Flow for WDM Networks Design. SIROCCO Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano
2003	J	`jnl`	Distance labeling scheme and split decomposition. Discret. Math. Cyril Gavoille, Christophe Paul
2003	A	`conf`	Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA Cyril Gavoille, Christophe Paul
2001	J	`jnl`	A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. Guillaume Damiand, Michel Habib, Christophe Paul
2001	A	`conf`	Approximate Distance Labeling Schemes. ESA Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
2001	J	`jnl`	Diameter determination on restricted graph families. Discret. Appl. Math. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
2001	J	`jnl`	Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. Michel Habib, Christophe Paul, Laurent Viennot
2001	J	`jnl`	Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electron. Notes Discret. Math. Cyril Gavoille, Christophe Paul
2000	J	`jnl`	Approximate Distance Labeling Schemes. Electron. Notes Discret. Math. Cyril Gavoille, Christophe Paul
2000	J	`jnl`	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
1999	J	`jnl`	Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. Michel Habib, Christophe Paul, Laurent Viennot
1998	A	`conf`	A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS Michel Habib, Christophe Paul, Laurent Viennot
1998	B	`conf`	Diameter Determination on Restricted Graph Faminlies. WG Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
1995	B	`conf`	Chordal Graphs and Their Clique Graphs. WG Philippe Galinier, Michel Habib, Christophe Paul