Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDChristophe Paul
Person information
- affiliation: LIRMM Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j61]Christophe Paul, Michal Pilipczuk:
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica 82(8): 2133-2134 (2020)- [j60]Stéphane Bessy, Marin Bougeret, Steven Chaplick
, Daniel Gonçalves, Christophe Paul:
On independent set in B1-EPG graphs. Discret. Appl. Math. 278: 62-72 (2020) - [j59]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): 259-277 (2020) - [j58]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge degeneracy: Algorithmic and structural results. Theor. Comput. Sci. 839: 164-175 (2020) - [c50]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA 2020: 64:1-64:16 - [c49]Svein Høgemo, Christophe Paul, Jan Arne Telle:
Hierarchical Clusterings of Unweighted Graphs. MFCS 2020: 47:1-47:13 - [e4]Christophe Paul, Markus Bläser:
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. LIPIcs 154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-140-5 [contents] - [i33]Christophe Paul, Guillaume Mescoff, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph. CoRR abs/2004.00547 (2020) - [i32]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR abs/2004.11937 (2020) - [i31]Svein Høgemo, Christophe Paul, Jan Arne Telle:
Hierarchical Clusterings of Unweighted Graphs. CoRR abs/2008.03061 (2020) - [i30]Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge Degeneracy: Algorithmic and Structural Results. CoRR abs/2009.03809 (2020)
2010 – 2019
- 2019
- [j57]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels for Packing Problems. Algorithmica 81(4): 1615-1656 (2019) - [j56]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory 90(4): 484-496 (2019) - [c48]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected Search for a Lazy Robber. FSTTCS 2019: 7:1-7:14 - [e3]Christophe Paul, Michal Pilipczuk:
13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. LIPIcs 115, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-084-2 [contents] - [e2]Rolf Niedermeier, Christophe Paul:
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. LIPIcs 126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-100-9 [contents] - 2018
- [j55]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - [j54]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: 1-2 (2018) - [j53]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms 14(3): 38:1-38:31 (2018) - 2017
- [j52]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): 66-95 (2017) - [j51]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: 191-206 (2017) - [j50]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: 315-327 (2017) - [j49]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: 91-103 (2017) - [c47]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP 2017: 70:1-70:13 - [c46]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: 3:1-3:12 - [i29]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 abs/1703.01686 (2017) - [i28]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR abs/1706.00617 (2017) - [i27]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR abs/1707.03563 (2017) - 2016
- [j48]Mark Jones, Christophe Paul, Céline Scornavacca:
On the consistency of orthology relationships. BMC Bioinform. 17(S-14): 251-262 (2016) - [j47]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): 366-379 (2016) - [j46]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): 21:1-21:41 (2016) - [c45]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM 2016: 53-64 - [c44]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: 195-206 - [r1]Christophe Paul:
Split Decomposition via Graph-Labelled Trees. Encyclopedia of Algorithms 2016: 2051-2056 - [i26]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR abs/1604.03008 (2016) - [i25]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR abs/1605.00532 (2016) - [i24]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels for packing problems. CoRR abs/1610.06131 (2016) - 2015
- [j45]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the K4-minor cover problem. J. Comput. Syst. Sci. 81(1): 186-207 (2015) - [j44]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29(3): 1427-1451 (2015) - [j43]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. 29(4): 1864-1894 (2015) - [c43]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: 123-142 - [c42]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - [c41]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: 138-150 - [c40]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [c39]Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On Independent Set on B1-EPG Graphs. WAOA 2015: 158-169 - [i23]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR abs/1504.05905 (2015) - [i22]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - [i21]Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR abs/1509.07404 (2015) - [i20]Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On independent set on B1-EPG graphs. CoRR abs/1510.00598 (2015) - 2014
- [j42]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014) - [j41]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Circle Graph Recognition. Algorithmica 69(4): 759-788 (2014) - [j40]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica 69(4): 789-843 (2014) - [j39]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: 444-449 (2014) - [j38]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): 45-72 (2014) - [j37]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. 28(3): 1363-1390 (2014) - [c38]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. STACS 2014: 312-324 - [c37]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. WG 2014: 201-213 - [i19]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 abs/1403.5702 (2014) - [i18]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger number of graphs with small chordality. CoRR abs/1406.3812 (2014) - 2013
- [j36]Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez:
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems. Algorithmica 65(4): 900-926 (2013) - [j35]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27(4): 2143-2156 (2013) - [c36]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: 613-624 - [i17]Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit linear kernels via dynamic programming. CoRR abs/1312.6585 (2013) - 2012
- [j34]Emeric Gioan, Christophe Paul:
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. Discret. Appl. Math. 160(6): 708-733 (2012) - [j33]Philippe Gambette, Vincent Berry, Christophe Paul:
Quartets and Unrooted phylogenetic Networks. J. Bioinform. Comput. Biol. 10(4) (2012) - [c35]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT 2012: 119-130 - [c34]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. WG 2012: 308-319 - [i16]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the $K_4$-minor cover problem. CoRR abs/1204.1417 (2012) - [i15]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012) - [i14]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 abs/1207.0835 (2012) - 2011
- [j32]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: 87-92 (2011) - [j31]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): 1071-1078 (2011) - [c33]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. ESA 2011: 394-407 - [c32]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228 - [c31]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66 - [c30]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: 497-507 - [i13]Christophe Paul, Anthony Perez, Stéphan Thomassé:
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. CoRR abs/1101.4491 (2011) - [i12]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011) - [i11]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Practical and Efficient Split Decomposition via Graph-Labelled Trees. CoRR abs/1104.3283 (2011) - [i10]Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil:
Circle Graph Recognition in Time O(n+m) α(n+m). CoRR abs/1104.3284 (2011) - [i9]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011) - [i8]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé:
Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011) - 2010
- [j30]Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. Algorithmica 58(2): 405-432 (2010) - [j29]Michel Habib, Christophe Paul:
A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1): 41-59 (2010) - [j28]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial kernels for 3-leaf power graph modification problems. Discret. Appl. Math. 158(16): 1732-1744 (2010) - [c29]Sylvain Guillemot, Christophe Paul, Anthony Perez:
On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. IPEC 2010: 147-157 - [c28]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: 123-134 - [c27]Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle:
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183 - [e1]Christophe Paul, Michel Habib:
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Lecture Notes in Computer Science 5911, 2010, ISBN 978-3-642-11408-3 [contents] - [i7]Sylvain Guillemot, Christophe Paul, Anthony Perez:
On the (non-)existence of polynomial kernels for Pl-free edge modification problems. CoRR abs/1007.4011 (2010)
2000 – 2009
- 2009
- [j27]Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul:
Computing galled networks from real data. Bioinform. 25(12) (2009) - [j26]Stephane Durocher, Christophe Paul:
Kinetic maintenance of mobile k-centres on trees. Discret. Appl. Math. 157(7): 1432-1446 (2009) - [j25]Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul:
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discret. Appl. Math. 157(7): 1555-1570 (2009) - [j24]Christophe Paul, Jan Arne Telle:
Branchwidth of chordal graphs. Discret. Appl. Math. 157(12): 2718-2725 (2009) - [j23]Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k: The k-branches. Discret. Math. 309(6): 1467-1475 (2009) - [j22]Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier:
Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. J. Comput. Biol. 16(10): 1287-1309 (2009) - [j21]Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle:
Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009) - [j20]Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas:
Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms 5(2): 23:1-23:18 (2009) - [c26]Philippe Gambette, Vincent Berry, Christophe Paul:
The Structure of Level-k Phylogenetic Networks. CPM 2009: 289-300 - [c25]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47 - [c24]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA 2009: 72-82 - [i6]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. CoRR abs/0907.2165 (2009) - [i5]Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009) - [i4]Michel Habib, Christophe Paul:
A survey on algorithmic aspects of modular decomposition. CoRR abs/0912.1457 (2009) - 2008
- [j19]Sèverine Bérard, Cédric Chauve, Christophe Paul:
A more efficient algorithm for perfect sorting by reversals. Inf. Process. Lett. 106(3): 90-95 (2008) - [j18]Cyril Gavoille, Christophe Paul:
Optimal Distance Labeling for Interval Graphs and Related Graph Families. SIAM J. Discret. Math. 22(3): 1239-1258 (2008) - [j17]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. 22(4): 1277-1296 (2008) - [j16]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008) - [c23]Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath:
A note on alpha-drawable k-trees. CCCG 2008 - [c22]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul:
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645 - [c21]Sèverine Bérard, Annie Chateau, Cédric Chauve, Christophe Paul, Eric Tannier:
Perfect DCJ Rearrangement. RECOMB-CG 2008: 158-169 - [i3]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial kernels for 3-leaf power graph modification problems. CoRR abs/0809.2858 (2008) - [i2]Emeric Gioan, Christophe Paul:
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs. CoRR abs/0810.1823 (2008) - 2007
- [j15]Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul:
Can transitive orientation make sandwich problems easier? Discret. Math. 307(16): 2030-2041 (2007) - [j14]Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 4-16 (2007) - [c20]Emeric Gioan, Christophe Paul:
Dynamic Distance Hereditary Graphs Using Split Decomposition. ISAAC 2007: 41-51 - [c19]Stephane Durocher, Christophe Paul:
Kinetic Maintenance of Mobile k-Centres on Trees. ISAAC 2007: 341-352 - [c18]Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger:
Interval completion with few edges. STOC 2007: 374-381 - [i1]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul:
Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007) - 2006
- [b1]Christophe Paul:
Aspects algorithmiques de la décomposition modulaire. (Algorithmic aspects of modular decomposition). Montpellier 2 University, France, 2006 - [j13]Christophe Crespelle, Christophe Paul:
Fully dynamic recognition algorithm and certificate for directed cographs. Discret. Appl. Math. 154(12): 1722-1741 (2006) - [j12]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. Distributed Comput. 18(4): 279-291 (2006) - [c17]Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216 - 2005
- [j11]Michel Habib, Christophe Paul:
A simple linear time algorithm for cograph recognition. Discret. Appl. Math. 145(2): 183-197 (2005) - [j10]Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k. Electron. Notes Discret. Math. 22: 363-368 (2005) - [c16]Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul:
On the Approximation of Computing Evolutionary Trees. COCOON 2005: 115-125 - [c15]Christophe Paul, Jan Arne Telle:
New Tools and Simpler Algorithms for Branchwidth. ESA 2005: 379-390 - [c14]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155 - [c13]Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238 - [c12]Christophe Crespelle, Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. WG 2005: 38-48 - 2004
- [c11]