Christophe Paul

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 51

Top Venues

CoRR

Algorithmica

Discret. Appl. Math.

J. Comput. Syst. Sci.

Publications

Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. ICALP (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. CoRR (2024)
Christophe Paul, Evangelos Protopapas
Tree-Layout Based Graph Classes: Proper Chordal Graphs. STACS (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
Obstructions to Erdös-Pósa Dualities for Minors. CoRR (2024)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
Graph Parameters, Universal Obstructions, and WQO. CoRR (2023)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
The mixed search game against an agile and visible fugitive is monotone. Discret. Math. 346 (4) (2023)
Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341 (2023)
Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos
Universal Obstructions of Graph Parameters. CoRR (2023)
Christophe Paul, Markus Bläser
Preface of STACS 2020 Special Issue. Theory Comput. Syst. 67 (1) (2023)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discret. Appl. Math. 312 (2022)
Christophe Paul, Evangelos Protopapas
Tree-layout based graph classes: proper chordal graphs. CoRR (2022)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36 (1) (2022)
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
The mixed search game against an agile and visible fugitive is monotone. CoRR (2022)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR (2021)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected search for a lazy robber. J. Graph Theory 97 (4) (2021)
Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos
Edge-trewidth: Algorithmic and combinatorial properties. CoRR (2021)
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT (2021)
Rolf Niedermeier, Christophe Paul
Preface of STACS 2019 Special Issue. Theory Comput. Syst. 65 (4) (2021)
Christophe Paul, Michal Pilipczuk
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica 82 (8) (2020)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR (2020)
Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. 839 (2020)
Svein Høgemo, Christophe Paul, Jan Arne Telle
Hierarchical Clusterings of Unweighted Graphs. CoRR (2020)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75 (3) (2020)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA (2020)
Svein Høgemo, Christophe Paul, Jan Arne Telle
Hierarchical Clusterings of Unweighted Graphs. MFCS (2020)
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
On independent set in B1-EPG graphs. Discret. Appl. Math. 278 (2020)
Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos
Edge Degeneracy: Algorithmic and Structural Results. CoRR (2020)
Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR (2020)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit Linear Kernels for Packing Problems. Algorithmica 81 (4) (2019)
Isolde Adler, Christophe Paul, Dimitrios M. Thilikos
Connected Search for a Lazy Robber. FSTTCS (2019)
Florian Barbero, Christophe Paul, Michal Pilipczuk
Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory 90 (4) (2019)
Derek G. Corneil, Sang-il Oum, Christophe Paul
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discret. Appl. Math. 248 (2018)
Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80 (1) (2018)
Florian Barbero, Christophe Paul, Michal Pilipczuk
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms 14 (3) (2018)
Florian Barbero, Christophe Paul, Michal Pilipczuk
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP (2017)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica 79 (1) (2017)
Florian Barbero, Christophe Paul, Michal Pilipczuk
Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC (2017)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR (2017)
Florian Barbero, Christophe Paul, Michal Pilipczuk
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR (2017)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690 (2017)
Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. 86 (2017)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89 (2017)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG (2016)
Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR (2016)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR (2016)
Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM (2016)
Christophe Paul, Anthony Perez, Stéphan Thomassé
Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. J. Comput. Syst. Sci. 82 (2) (2016)
Mark Jones, Christophe Paul, Céline Scornavacca
On the consistency of orthology relationships. BMC Bioinform. 17 (S-14) (2016)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12 (2) (2016)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit linear kernels for packing problems. CoRR (2016)
Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-cut Decomposition. WAOA (2015)
Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR (2015)
Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR (2015)
Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR (2015)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. 29 (4) (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On independent set on B1-EPG graphs. CoRR (2015)
Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On Independent Set on B1-EPG Graphs. WAOA (2015)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29 (3) (2015)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
-minor cover problem. J. Comput. Syst. Sci. 81 (1) (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC (2015)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica 69 (4) (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees. Algorithmica 68 (1) (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger Number of Graphs with Small Chordality. WG (2014)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164 (2014)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54 (1) (2014)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit Linear Kernels via Dynamic Programming. STACS (2014)
Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28 (3) (2014)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR (2014)
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
Hadwiger number of graphs with small chordality. CoRR (2014)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Circle Graph Recognition. Algorithmica 69 (4) (2014)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27 (4) (2013)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit linear kernels via dynamic programming. CoRR (2013)
Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez
-Free Edge Modification Problems. Algorithmica 65 (4) (2013)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) (2013)
Emeric Gioan, Christophe Paul
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. Discret. Appl. Math. 160 (6) (2012)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT (2012)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs CoRR (2012)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
A single-exponential FPT algorithm for the $K_4$-minor cover problem CoRR (2012)
Philippe Gambette, Vincent Berry, Christophe Paul
Quartets and Unrooted phylogenetic Networks. J. Bioinform. Comput. Biol. 10 (4) (2012)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear kernels and single-exponential algorithms via protrusion decompositions CoRR (2012)
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
Parameterized Domination in Circle Graphs. WG (2012)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges CoRR (2011)
Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
Hitting and Harvesting Pumpkins. ESA (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees CoRR (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37 (2011)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Practical and Efficient Split Decomposition via Graph-Labelled Trees CoRR (2011)
Christophe Paul, Anthony Perez, Stéphan Thomassé
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems CoRR (2011)
Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
Hitting and Harvesting Pumpkins CoRR (2011)
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
Circle Graph Recognition in Time O(n+m) α(n+m) CoRR (2011)
Christophe Paul, Anthony Perez, Stéphan Thomassé
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. MFCS (2011)
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS (2011)
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
Contracting Graphs to Paths and Trees. IPEC (2011)
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77 (6) (2011)
Stéphane Bessy, Christophe Paul, Anthony Perez
Polynomial kernels for 3-leaf power graph modification problems. Discret. Appl. Math. 158 (16) (2010)
Christophe Crespelle, Christophe Paul
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica 58 (2) (2010)
Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG (2010)
Sylvain Guillemot, Christophe Paul, Anthony Perez
-free Edge Modification Problems. IPEC (2010)

Christophe Paul.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christophe Paul