default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
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
- 2024
[c53]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: 114:1-114:19- [c52]Christophe Paul, Evangelos Protopapas
:
Tree-Layout Based Graph Classes: Proper Chordal Graphs. STACS 2024: 55:1-55:18 - [i41]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 abs/2406.16647 (2024) - [i40]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Obstructions to Erdös-Pósa Dualities for Minors. CoRR abs/2407.09671 (2024) - 2023
- [j68]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-treewidth: Algorithmic and combinatorial properties. Discret. Appl. Math. 341: 40-54 (2023) - [j67]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. Discret. Math. 346(4): 113345 (2023) - [j66]Christophe Paul, Markus Bläser:
Preface of STACS 2020 Special Issue. Theory Comput. Syst. 67(1): 1-3 (2023) - [i39]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Graph Parameters, Universal Obstructions, and WQO. CoRR abs/2304.03688 (2023) - [i38]Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos:
Universal Obstructions of Graph Parameters. CoRR abs/2304.14121 (2023) - 2022
- [j65]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: 72-85 (2022) - [j64]Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36(1): 411-435 (2022) - [i37]Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
The mixed search game against an agile and visible fugitive is monotone. CoRR abs/2204.10691 (2022) - [i36]Christophe Paul, Evangelos Protopapas:
Tree-layout based graph classes: proper chordal graphs. CoRR abs/2211.07550 (2022) - 2021
- [j63]Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected search for a lazy robber. J. Graph Theory 97(4): 510-552 (2021) - [j62]Rolf Niedermeier, Christophe Paul:
Preface of STACS 2019 Special Issue. Theory Comput. Syst. 65(4): 635-637 (2021) - [c51]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: 287-300 - [i35]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 abs/2105.12093 (2021) - [i34]Loïc Magne, Christophe Paul, Abhijat Sharma, Dimitrios M. Thilikos:
Edge-trewidth: Algorithmic and combinatorial properties. CoRR abs/2112.07524 (2021) - 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]Michel Habib, Christophe Paul, Mathieu Raffinot:
Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372 - [c10]Pierre Fraigniaud, Cyril Gavoille, Christophe Paul:
Eclecticism shrinks even small worlds. PODC 2004: 169-178 - [c9]Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 - [c8]Christophe Crespelle, Christophe Paul:
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG 2004: 93-104 - 2003
- [j9]Cyril Gavoille, Christophe Paul:
Distance labeling scheme and split decomposition. Discret. Math. 273(1-3): 115-130 (2003) - [j8]Michel Habib, Emmanuelle Lebhar, Christophe Paul:
A note on finding all homogeneous set sandwiches. Inf. Process. Lett. 87(3): 147-151 (2003) - [c7]Cyril Gavoille, Christophe Paul:
Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA 2003: 254-265 - [c6]Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano:
Approximate Multicommodity Flow for WDM Networks Design. SIROCCO 2003: 43-56 - [c5]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130 - 2001
- [j7]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter determination on restricted graph families. Discret. Appl. Math. 113(2-3): 143-166 (2001) - [j6]Michel Habib, Christophe Paul, Laurent Viennot:
Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. 4(2): 173-178 (2001) - [j5]Cyril Gavoille, Christophe Paul:
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electron. Notes Discret. Math. 10: 117-120 (2001) - [j4]Guillaume Damiand, Michel Habib, Christophe Paul:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1-2): 99-111 (2001) - [c4]Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg:
Approximate Distance Labeling Schemes. ESA 2001: 476-487 - 2000
- [j3]Cyril Gavoille, Christophe Paul:
Approximate Distance Labeling Schemes. Electron. Notes Discret. Math. 5: 134-137 (2000) - [j2]Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot:
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1-2): 59-84 (2000)
1990 – 1999
- 1999
- [j1]Michel Habib, Christophe Paul, Laurent Viennot:
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. 10(2): 147-170 (1999) - 1998
- [c3]Michel Habib, Christophe Paul, Laurent Viennot:
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS 1998: 25-38 - [c2]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202 - 1995
- [c1]Philippe Galinier, Michel Habib, Christophe Paul:
Chordal Graphs and Their Clique Graphs. WG 1995: 358-371
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
