Co-authors

Number of documents

115


Journal articles51 documents

  • Florian Barbero, Christophe Paul, Michał Pilipczuk. Strong immersion is a well-quasi-ordering for semicomplete digraphs. Journal of Graph Theory, Wiley, 2019, 90, pp.484-496. ⟨10.1002/jgt.22408⟩. ⟨lirmm-01918986⟩
  • Florian Barbero, Christophe Paul, Michał Pilipczuk. Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (3), pp.#38. ⟨10.1145/3196276⟩. ⟨lirmm-01919000⟩
  • Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica, Springer Verlag, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩. ⟨hal-01690385⟩
  • 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, Springer Verlag, 2017, 79 (1), pp.66-95. ⟨10.1007/s00453-016-0230-z⟩. ⟨lirmm-01692676⟩
  • Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theoretical Computer Science, Elsevier, 2017, 690, pp.91-103. ⟨10.1016/j.tcs.2017.06.013⟩. ⟨lirmm-01630777⟩
  • Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Sciences, Elsevier, 2017, 86, pp.191-206. ⟨10.1016/j.jcss.2017.01.003⟩. ⟨lirmm-01487567⟩
  • Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, et al.. A polynomial-time algorithm for Outerplanar Diameter Improvement. Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩. ⟨hal-01592242⟩
  • Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, et al.. Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Transactions on Algorithms, Association for Computing Machinery, 2016, 12 (2), pp.No. 21. ⟨10.1145/2797140⟩. ⟨lirmm-01288472⟩
  • Christophe Paul, Anthony Perez, Stéphan Thomassé. Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. Journal of Computer and System Sciences, Elsevier, 2016, 82 (2), ⟨10.1016/j.jcss.2015.08.002⟩. ⟨hal-01367979⟩
  • Mark Jones, Christophe Paul, Celine Scornavacca. On the consistency of orthology relationships. BMC Bioinformatics, BioMed Central, 2016, 17 (S14), ⟨10.1186/s12859-016-1267-3⟩. ⟨lirmm-01481206⟩
  • Kim Eun Jung, Christophe Paul, Geevarghese Philip. A single-exponential FPT algorithm for the $K_4$-minor cover problem. Journal of Computer and System Sciences, Elsevier, 2015, 81 (1), pp.186-207. ⟨hal-01178194⟩
  • Petr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe Paul. Hadwiger Number of Graphs with Small Chordality. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (3), pp.1427-1451. ⟨10.1137/140975279⟩. ⟨hal-01263856⟩
  • Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Explicit Linear Kernels via Dynamic Programming. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.1864-1894. ⟨10.1137/140968975⟩. ⟨lirmm-01263857⟩
  • Pinar Heggernes, Pim Van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. Contracting Graphs to Paths and Trees. Algorithmica, Springer Verlag, 2014, 68 (1), pp.109-132. ⟨10.1007/s00453-012-9670-2⟩. ⟨lirmm-01076841⟩
  • Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil. Practical and Efficient Circle Graph Recognition. Algorithmica, Springer Verlag, 2014, 69 (4), pp.759-788. ⟨10.1007/s00453-013-9745-8⟩. ⟨lirmm-00805194⟩
  • Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil. Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica, Springer Verlag, 2014, 69 (4), pp.789-843. ⟨10.1007/s00453-013-9752-9⟩. ⟨lirmm-00805193⟩
  • Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau, et al.. Parameterized domination in circle graphs. Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72. ⟨10.1007/s00224-013-9478-8⟩. ⟨hal-01178188⟩
  • Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Christophe Paul. Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Applied Mathematics, Elsevier, 2014, LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina, 164, pp.444-449. ⟨10.1016/j.dam.2013.02.025⟩. ⟨lirmm-01266352⟩
  • Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. Hitting and harvesting pumpkins. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1363-1390. ⟨10.1137/120883736⟩. ⟨hal-01178192⟩
  • 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, Springer Verlag, 2013, 65 (4), pp.900-926. ⟨hal-00821612⟩
  • Christophe Paul, Pinar Heggernes, Pim van 'T Hof, Daniel Lokshtanov. Obtaining a Bipartite Graph by Contracting Few Edges. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (4), pp.2143-215. ⟨hal-01178184⟩
  • Emeric Gioan, Christophe Paul. Split Decomposition and Graph-Labelled Trees: Characterizations and Fully-Dynamic Algorithms for Totally Decomposable Graphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.708-733. ⟨lirmm-00783420⟩
  • Philippe Gambette, Vincent Berry, Christophe Paul. Quartets and Unrooted Phylogenetic Networks. Journal of Bioinformatics and Computational Biology, World Scientific Publishing, 2012, 10 (4), pp.1250004.1-1250004.23. ⟨10.1142/S0219720012500047⟩. ⟨hal-00678046⟩
  • Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences, Elsevier, 2011, 77 (6), pp.1071-1078. ⟨lirmm-00738221⟩
  • Christophe Crespelle, Christophe Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Algorithmica, Springer Verlag, 2010, 58 (2), pp.405-432. ⟨lirmm-00533516⟩
  • Stéphane Bessy, Christophe Paul, Anthony Perez. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Discrete Applied Mathematics, Elsevier, 2010, 158 (16), pp.1732-1744. ⟨lirmm-00533517⟩
  • Michel Habib, Christophe Paul. A Survey on Algorithmic Aspects of Modular Decomposition. Computer Science Review, Elsevier, 2010, 4 (1), pp.41-59. ⟨10.1016/j.cosrev.2010.01.001⟩. ⟨lirmm-00533514⟩
  • Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul. Linear time 3-approximation for MAST problem. ACM Transactions on Algorithms, Association for Computing Machinery, 2009, 5 (2), pp.1-18. ⟨lirmm-00324073⟩
  • Sèverine Bérard, Annie Chateau, Cedric Chauve, Christophe Paul, Eric Tannier. Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. Journal of Computational Biology, Mary Ann Liebert, 2009, 16 (10), pp.1287-1309. ⟨lirmm-00432670⟩
  • Christophe Paul, Jan Arne Telle. Edge Maximal Graphs of Branchwidth k: The k-Branches. Discrete Mathematics, Elsevier, 2009, 309 (6), pp.1467-1475. ⟨lirmm-00371208⟩
  • François Nicolas, Sylvain Guillemot, Vincent Berry, Christophe Paul. On the Approximability Results for Maximum Agreement Subtree and Maximum Compatible Tree Problems. Discrete Applied Mathematics, Elsevier, 2009, 157 (7), pp.1555-1570. ⟨lirmm-00371209⟩
  • Christophe Paul, Jan Arne Telle. Branchwidth of Chordal Graphs. Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2718-2725. ⟨lirmm-00394553⟩
  • Christophe Paul, Stéphane Durocher. Kinetic Maintenance of Mobile k-Centres in Trees. Discrete Applied Mathematics, Elsevier, 2009, 157 (7), pp.1432-1446. ⟨10.1007/978-3-540-77120-3_31⟩. ⟨lirmm-00371207⟩
  • Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle. Interval completion is Fixed Parameter Tractable. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2009, 38 (5), pp.2007-2020. ⟨http://link.aip.org/link/?SMJ/38/2007⟩. ⟨10.1137/070710913⟩. ⟨lirmm-00371876⟩
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Competitive Graph Searches. Theoretical Computer Science, Elsevier, 2008, 393 (1-3), pp.72-80. ⟨lirmm-00324565⟩
  • Sèverine Bérard, Cedric Chauve, Christophe Paul. A More Efficient Algorithm for Perfect Sorting by Reversals. Information Processing Letters, Elsevier, 2008, 106, pp.90-95. ⟨10.1016/j.ipl.2007.10.012⟩. ⟨lirmm-00274051⟩
  • Cyril Gavoille, Christophe Paul. Optimal Distance Labeling for Interval Graphs and Related Graphs Families. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (3), pp.1239-1258. ⟨10.1137/050635006⟩. ⟨hal-00366618⟩
  • Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. A Simple Linear Time LexBFS Cograph Recongition Algorithm. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (4), pp.1277-1296. ⟨lirmm-00324572⟩
  • Christophe Paul, Sèverine Bérard, Anne Bergeron, Cedric Chauve. Perfect Sorting by Reversals is not Always Difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2007, 4 (1), pp.12. ⟨lirmm-00111979⟩
  • Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul. Can Transitive Orientation Make Sandwich Problems Easier?. Discrete Mathematics, Elsevier, 2007, 307 (16), pp.2030-2041. ⟨10.1016/j.disc.2005.12.048⟩. ⟨lirmm-00189518⟩
  • Christophe Crespelle, Christophe Paul. Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs. Discrete Applied Mathematics, Elsevier, 2006, 154 (12), pp.1722-1741. ⟨10.1016/j.dam.2006.03.005⟩. ⟨hal-01424432⟩
  • Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Eclectism Shrinks Even Small Worlds. Distributed Computing, Springer Verlag, 2006, 18 (4), pp.279-291. ⟨10.1007/s00446-005-0137-4⟩. ⟨lirmm-00102848⟩
  • , Christophe Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. Discrete Applied Mathematics, Elsevier, 2006, 154, pp.1722-1741. ⟨lirmm-00102849⟩
  • Michel Habib, Christophe Paul. A Simple Linear Time Algorithm for Cograph Recognition. Discrete Applied Mathematics, Elsevier, 2005, 145 (2), pp.183-197. ⟨lirmm-00105298⟩
  • Michel Habib, Emmanuelle Lebhar, Christophe Paul. A Note on Finding All Homogeneous Set Sandwiches. Information Processing Letters, Elsevier, 2003, 87, pp. 147-151. ⟨lirmm-00269575⟩
  • Cyril Gavoille, Christophe Paul. Distance Labeling and Split Decomposition. Discrete Mathematics, Elsevier, 2003, 273 (1-3), pp.147-151. ⟨10.1016/S0012-365X(03)00232-2⟩. ⟨lirmm-00269634⟩
  • Cyril Gavoille, Christophe Paul. Distance Labeling Scheme and Split Decomposition. Discrete Mathematics, Elsevier, 2003, 273, pp.115-130. ⟨hal-00307384⟩
  • G. Damiand, Michel Habib, Christophe Paul. A Simple Paradigm for Graph Recognition : Application to Cographs and Distance Hereditary Graphs. Theoretical Computer Science, Elsevier, 2001, 263 (1-2), pp.99-111. ⟨10.1016/S0304-3975(00)00234-6⟩. ⟨lirmm-00090372⟩
  • Michel Habib, Christophe Paul, Laurent Viennot. Linear time recognition of P4-indifference graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.173-178. ⟨http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/157⟩. ⟨inria-00471619⟩
  • Derek Corneil, Feodor Dragan, Michel Habib, Christophe Paul. Diameter Determination on Restricted Graph Families. Discrete Applied Mathematics, Elsevier, 2001, 113 (2-3), pp.146-166. ⟨10.1016/S0166-218X(00)00281-X⟩. ⟨lirmm-00090363⟩
  • Michel Habib, Ross Mac Connell, Christophe Paul, Laurent Viennot. Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing. Theoretical Computer Science, Elsevier, 2000, 234. ⟨inria-00471613⟩

Conference papers57 documents

  • Christophe Paul. Connected tree-width and connected cops and robber game. CAALM: Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India. ⟨lirmm-02079017⟩
  • Christophe Paul. A polynomial Turing kernel to compute the cut-width of semi-complete digraph. FILOFOCS: French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France. ⟨lirmm-02078882⟩
  • Florian Barbero, Christophe Paul, Michał Pilipczuk. Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Warsaw, Poland. pp.70:1--70:13, ⟨10.4230/LIPIcs.ICALP.2017.70⟩. ⟨lirmm-02021567⟩
  • Julien Baste, Christophe Paul, Ignasi Sau, Celine Scornavacca. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩. ⟨lirmm-01481368⟩
  • Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordeshai Shalom. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206, ⟨10.1007/978-3-662-53536-3_17⟩. ⟨lirmm-01481360⟩
  • Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩. ⟨hal-01178222⟩
  • Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-cut Decomposition. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩. ⟨lirmm-01264015⟩
  • Christophe Paul. Introduction to parameterized complexity and some algorithmic consequences of the graph minor theory. Workshop on Graph Theory and its Applications, 2015, Istanbul, Turkey. ⟨lirmm-02078876⟩
  • Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩. ⟨lirmm-01263999⟩
  • Christophe Paul, Eun Jung Kim, Mamadou Moustapha Kanté, O-Joung Kwon. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.139-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩. ⟨lirmm-01264011⟩
  • Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. On Independent Set on B1-EPG Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩. ⟨lirmm-01264022⟩
  • Christophe Crespelle, Emeric Gioan, Christophe Paul. Recognition of dynamic circle graphs. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨hal-01178215⟩
  • Petr A. Golovach, Pinar Heggernes, Pim Van 'T Hof, Christophe Paul. Hadwiger Number of Graphs with Small Chordality. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.201-213, ⟨10.1007/978-3-319-12340-0_17⟩. ⟨hal-01178217⟩
  • Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Explicit linear kernels via dynamic programming. STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩. ⟨hal-01084007⟩
  • Christophe Paul. Complexité et algorithmes paramétrés. Ecole Jeunes Chercheurs en Informatique Mathématique, 2013, Perpignan, France. ⟨hal-01178227⟩
  • Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, et al.. Linear Kernels and Single-exponential Algorithms via Protrusion Decompositions. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2013, Riga, Latvia. pp.613-624, ⟨10.1007/978-3-642-39206-1_52⟩. ⟨lirmm-00829999⟩
  • Eunjung Kim, Christophe Paul, Geevarghese Philip. Parameterized K_4-Cover in Single Exponential Time. SWAT: Scandinavian Workshop on Algorithmic Theory, Jul 2012, Helsinki, Sweden. pp.199-130. ⟨lirmm-00805191⟩
  • Christophe Paul. Algorithmics of Modular Decomposition. Algorithms and Permutations, Feb 2012, Paris, France. ⟨lirmm-00805415⟩
  • Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau, et al.. Parameterized Domination in Circle Graphs. WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.308-319, ⟨10.1007/978-3-642-34611-8_31⟩. ⟨lirmm-00738534⟩
  • Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. Hitting and Harvesting Pumpkins. ESA: European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407. ⟨lirmm-00642341⟩
  • Christophe Paul, Anthony Perez, Stéphan Thomassé. Conflict Packing Yield Linear Vertex-Kernels for k- Fast, k-Dense rti and a Related Problem. Mfcs'11: 36th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland. pp.497-507. ⟨lirmm-00642335⟩
  • Pinar Heggerness, Pim Van'T Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. Contracting Graphs to Paths and Trees. IPEC: International Symposium on Parameterized and Exact Computation, Sep 2011, Saarbrücken, Germany. pp.55-66. ⟨lirmm-00805183⟩
  • Pinar Heggerness, Pim Van'T Hof, Daniel Lokshtanov, Christophe Paul. Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Dec 2011, Mumbai, India. pp.217-228. ⟨lirmm-00805189⟩
  • Pinar Heggernes, Pim Van 'T Hof, Benjamin Lévêque, Christophe Paul. Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.87-92. ⟨lirmm-00620732⟩
  • Pinar Heggerness, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle. Generalized Graph Clustering: Recognizing (p,q)-Cluster. WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12. ⟨lirmm-00533520⟩
  • Sylvain Guillemot, Christophe Paul, Anthony Perez. On the (Non-)Existence of Polynomial Kernels for Pl -Free Edge Modification Problems. IPEC'10: International Symposium on Parameterized and Exact Computation, France. 12 p. ⟨lirmm-00533519⟩
  • Micheal Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Fran Rosamond, et al.. Milling a Graph with Turn Costs: a Parameterized Complexity Perspective. WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12. ⟨lirmm-00533521⟩
  • Daniel Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul. Computing Galled Networks from Real Data. ISMB/ECCB'09: 17th Annual Conference on Intelligent Systems for Molecular Biology & 8th European Conference on Computational Biology, Jun 2009, France. pp.i85-i93, ⟨10.1093/bioinformatics/btp217⟩. ⟨lirmm-00368545v2⟩
  • Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for Feedback Arc Set In Tournaments. FSTTCS'09: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.N/A. ⟨lirmm-00432668⟩
  • Stéphane Bessy, Anthony Perez, Christophe Paul. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82. ⟨lirmm-00432664⟩
  • Philippe Gambette, Vincent Berry, Christophe Paul. The Structure of Level-k Phylogenetic Networks. CPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. pp.289-300, ⟨10.1007/978-3-642-02441-2_26⟩. ⟨lirmm-00371485⟩
  • Annie Chateau, Cedric Chauve, Sèverine Bérard, Eric Tannier, Christophe Paul. Perfect DCJ rearrangement. RECOMB Comparative Genomics, Oct 2008, Paris, France. pp.158-169, ⟨10.1007/978-3-540-87989-3_12⟩. ⟨lirmm-00327258⟩
  • Christophe Paul, Andrzej Proskurowski, Jan Arne Telle. Algorithmic Generation of Graphs of Branch-width ≤ k. WG'06: Graph Theoretical Concepts in Computer Science, pp.206-216. ⟨lirmm-00324551⟩
  • David Bremner, Jonathan Lenchner, Giuseppe Liotta, Christophe Paul, Marc Pouget, et al.. A Note on α-Drawable k-Trees. CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27. ⟨lirmm-00324589⟩
  • Cyril Gavoille, Christophe Paul. Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA'03: 11th European Symposium on Algorithms, Budapest (Hungary), pp. 254-265. ⟨lirmm-00269576⟩
  • Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul. Simple, Linear-Time Modular Decomposition. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645. ⟨lirmm-00324557⟩
  • Stéphane Durocher, Christophe Paul. Kinetic Maintenance of Mobile k-Centre in Trees. ISAAC'07: 18th International Symposium on Algorithms and Computation, 2007, Sendei, Japan. pp.341-352. ⟨lirmm-00189505⟩
  • Emeric Gioan, Christophe Paul. Dynamic Distance Hereditary Graphs Using Split Decomposition. ISAAC'07: 18th International Symposium on Algorithms and Computation, 2007, Sendei, Japan. pp.41-51. ⟨lirmm-00189506⟩
  • Pinar Heggerness, Christophe Paul, Jan Arne Telle, Yngve Villanger. Interval Completion with Few Edges. STOC'07: 39th ACM Symposium on Theory of Computing, Jun 2007, San Diego, CA, United States. pp.374-381, ⟨10.1145/1250790.1250847⟩. ⟨lirmm-00189511⟩
  • Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul. Perfect Sorting by Reversal is not Always Difficult. WABI: Workshop on Algorithms in Bioinformatics, Oct 2005, Mallorca, Spain. pp.228-238, ⟨10.1007/11557067_19⟩. ⟨lirmm-00106465⟩
  • , Christophe Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. WG'05: 31st International Workshop on Graph Theoretical Concepts in Computer Science, Jun 2005, Metz, France. pp.38-48, ⟨10.1007/11604686_4⟩. ⟨lirmm-00106039⟩
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Revisiting Uno and Yagiura's Algorithms. ISAAC'05: 16th Annual Symposium on Algorithms and Computation, 2005. ⟨lirmm-00106037⟩
  • Vincent Berry, N. Francois, Sylvain Guillemot, Christophe Paul. On the Approximation of Computing Evolutionary Trees. COCOON'05: 11th Annual International Conference on Computing and Combinatorics, 2005, pp.115-125. ⟨lirmm-00106451⟩
  • Christophe Paul, Jan Arne Telle. New Tools and Simpler Algorithms for Branchwidth. ESA'05: 13rd Annual European Symposium on Algorithms, 2005, pp.379-390. ⟨lirmm-00106466⟩
  • Christophe Paul, Jan Arne Telle. Edge Maximal Graphs of Branchwidth k. ICGT'05: International Conference on Graph Theory, 2005. ⟨lirmm-00106051⟩
  • , Christophe Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG'04: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2004, Bad Honnef (Germany), pp.93-104. ⟨lirmm-00108770⟩
  • Michel Habib, Christophe Paul, Mathieu Raffinot. Maximal Common Connected Sets of Interval Graphs. CPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. pp.359-372, ⟨10.1007/978-3-540-27801-6_27⟩. ⟨lirmm-00108787⟩
  • Michel Habib, Fabien de Montgolfier, Christophe Paul. A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. 9th Scandinavian Workshop on Algorithm Theory, 2004, Humlebaek, Denmark. pp.187-198. ⟨hal-00159601⟩
  • Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Eclecticism Shrinks Even Small Worlds. $23^$ Annual ACM Symposium on Principles of Distributed Computing (PODC), 2004, Canada. pp.169-178. ⟨hal-00307394⟩
  • Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Eclectisme dans les petits mondes. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2004, Lyon, France. pp.270-284. ⟨hal-00307396⟩
  • Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano. Approximate Multicommodity Flow for WDM Networks Design. SIROCCO: Structural Information and Communication Complexity, Jun 2003, Umeä, Sweden. pp.43-56. ⟨lirmm-00269524⟩
  • Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul. On Poset Sandwich Problems. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic. ⟨lirmm-00269577⟩
  • Cyril Gavoille, Christophe Paul. Optimal Distance Labeling Schemes for Interval and Circular-arc Graphs. $11^$ Annual European Symposium on Algorithms (ESA), 2003, United States. pp.254-265. ⟨hal-00307388⟩
  • Michel Habib, Christophe Paul, Jan Arne Telle. A Linear-Time Algorithm for Recognition of Catval Graphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic. ⟨lirmm-00269443⟩
  • Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2003, Elspeet, Netherlands. pp.119-130, ⟨10.1007/978-3-540-39890-5_11⟩. ⟨lirmm-00269525⟩
  • Michel Habib, Christophe Paul, Laurent Viennot. Partition refinement and graph decomposition. Symposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2. ⟨inria-00471612⟩
  • Michel Habib, Christophe Paul, Laurent Viennot. A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and Automata. 15th Symposium on Theoretical Aspects of Computer Science (STACS), 1998, Paris, France. pp.25-38, ⟨10.1007/BFb0028546⟩. ⟨inria-00471611⟩

Books1 document

  • Christophe Paul, Michel Habib. WG'09: International Workshop on Theoretic Concepts in Computer Science. 352 p., 2010, Lecture Notes in Computer Science. ⟨lirmm-00533518⟩

Book sections2 documents

  • Christophe Paul. Split decomposition, circle graphs and related graph families. Ming-Yang Kao. Encyclopedia of Algorithms, Springer, 2015, 978-1-4939-2863-7. ⟨10.1007/978-1-4939-2864-4_686⟩. ⟨hal-01178198⟩
  • Christophe Paul. Complexité et algorithmes paramétrés. Philippe Langlois. Informatique mathématique, une photographie en 2013, Presse universitaires de Perpignan, 2013. ⟨hal-01178225⟩

Directions of work or proceedings3 documents

Habilitation à diriger des recherches1 document

  • Christophe Paul. Aspects algorithmiques de la décomposition modulaire. Mathématiques [math]. Université Montpellier II - Sciences et Techniques du Languedoc, 2006. ⟨tel-00112390⟩