{"id":2285,"date":"2024-04-17T14:42:06","date_gmt":"2024-04-17T12:42:06","guid":{"rendered":"https:\/\/perso.lirmm.fr\/christophe-paul\/?page_id=2285"},"modified":"2024-08-19T10:32:39","modified_gmt":"2024-08-19T08:32:39","slug":"journal-paper","status":"publish","type":"page","link":"https:\/\/www.lirmm.fr\/christophe-paul\/journal-paper\/","title":{"rendered":"Journal papers"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Journal papers<\/strong><\/h4>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

[J65]<\/strong> L. Magne<\/span>, C. Paul, A. Sharma<\/span>, D.M. Thilikos. <\/span>Edge-treewidth: Algorithmic and combinatorial properties. Discrete Applied Mathematics<\/em><\/strong>, 341:40-54, 2023.
[J64]<\/strong> G. Mescoff<\/span>, C. Paul, D.M. Thilikos. <\/span>The mixed search game against an agile and visible fugitive is monotone. Discrete Mathematics<\/em><\/strong>, 346(4):113345, 2023.
[J63]<\/strong> C. Paul, M. Bl\u00e4ser. <\/span>Preface of STACS 2020 Special Issue. Theory of Computing Systems<\/em><\/strong>, 67(1):1-3, 2023. 
[J62]<\/strong> G. Mescoff<\/span>, C. Paul, D.M. Thilikos. <\/span>A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discrete Applied Mathematics<\/strong>,<\/em> 312:72-85, 2022. 
[J61]<\/strong> M.M. Kant\u00e9<\/span>, C. Paul, D.M. Thilikos. <\/span>A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM Journal on Discrete Mathematics<\/em><\/strong>, 36(1):411-435, 2022.
[J60]<\/strong> I. Adler<\/span>, C. Paul, D.M. Thilikos. <\/span>Connected search for a lazy robber. Journal of Graph Theory<\/em><\/strong>, 97(4):510-552, 2021.
[J59]<\/strong> R. Niedermeier<\/span>, C. Paul. Preface of STACS 2019 Special Issue. Theory of Computing Systems<\/em><\/strong>, 65(4):635-637, 2021. 
[J58]<\/strong> C. Paul, M. Pilipczuk. <\/span>Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica<\/em><\/strong>, 82(8): 2133-2134, 2020. 
[J57]<\/strong> S. Bessy, M. Bougeret, S. Chaplick, D. Gon\u00e7alves, C. Paul. On independent set in B1-EPG graphs. Discrete Applied Mathematics<\/em><\/strong>, 278:62-72, 2020. 
[J56]<\/b> J. Baste, D. G\u00f6z\u00fcpek, C. Paul, I. Sau, M. Shalom, D.M. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks<\/em><\/strong>, 75(3):259-277, 2020. 
[J55]<\/b> S. Limnios, C. Paul, J. Perret and D.M. Thilikos. Edge degeneracy: algorithmic and structural results. Theoretical Computer Science<\/em><\/strong>, 839:164-175, 2020. 
[J54]<\/b>  V. Garnero, C. Paul, I. Sau and D.M. Thilikos. Explicit linear kernels for packing problems. Algorithmica<\/em><\/strong>, 81(4):1615-1656, 2019. 
[J53]<\/b> F. Barbero, C. Paul and M. Pilipczuk. Strong immersion is a well-quasi-ordering for semi-complete digraphs. Journal of Graph Theory<\/em><\/strong>, 90(4):484-496, 2019. 
[J52] <\/b>E.J. Kim, S.I. Oum, C. Paul, I. Sau and D.M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica<\/i><\/strong>, 80(1):116,135, 2018. [DOI<\/a>] 
[J51] <\/b>D.G. Cor<\/span>neil<\/span>, S.-I. Oum<\/span>, C. Paul. Preface: Seventh  Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discrete Applied Mathematics<\/strong><\/em>, 248: 1-2, 2018. 
[J50] <\/strong>F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. ACM Transactions on Algorithmics<\/strong><\/em>, 14(3):38:1-38-31, 2018. 
[J49]<\/strong> J. Baste, C. Paul, I. Sau and C. Scornavacca. <\/span>Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees<\/a>. <\/span>Bulletin of Mathematical Biology<\/strong><\/em>, <\/span>79:<\/span>920\u2013938, <\/span>2017.<\/span>
[J48] <\/b>M.M. Kant\u00e9, E.J. Kim, O. Kwon and C. Paul. An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Algorithmica<\/strong><\/em>, 79(1):66-95, 2017. [DOI<\/a>] 
[J47] <\/b>E.J. Kim, C. Paul, I. Sau and D.M. Thilikos. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Science<\/strong><\/em>, 86:191-206, 2017. [DOI<\/a>] 
[J46] <\/b>N. Cohen, D. Gon\u00e7alves, E.J. Kim, C. Paul, I. Sau, D.M. Thilikos and M. Weller. A polynomial-time algorithm for outerplanar diameter improvement. Journal of Computer and System Science<\/strong><\/em>, 89:315-327, 2017. [DOI<\/a>] 
[J45] <\/b>D. G\u00f6z\u00fcpek, S. \u00d6zkan, C. Paul, I. Sau, M. Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theoretical Computer Science<\/strong><\/em>, 690:91-103, 2017. [DOI<\/a>] 
[J44]<\/b> Mark Jones<\/span>, Christophe Paul, C\u00e9line Scornavacca. <\/span>On the consistency of orthology relationships. BMC Bioinformatics<\/strong>,<\/em> 17(S-14):251-262, 2016. 
[J43] <\/b>C. Paul, A. Perez and S. Thomass\u00e9. Linear kernel for rooted triplet inconsistency and other problems based on conflict packing technique. Journal of Computer and System Science<\/em><\/strong>, 82(2):366-379, 2016. [DOI<\/a>] 
[J42] <\/b>E.J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Transactions on Algorithms<\/strong>,<\/em> 12(2):21, 2016. [DOI<\/a>] 
[<\/b>J41] <\/b>E.J. Kim, C. Paul and G. Philip. A single-exponential FPT algorithm for the K4-minor cover problem. Journal of Computer and System Science<\/strong>,<\/em> 81(1) :186-207, 2015. 
[J40] <\/b>P. Golovach, P. Heggernes, P. van’t Hof and C. Paul. Hadwiger number of graphs with small chordality. SIAM Journal on <\/b>Discrete Applied Mathematics<\/strong><\/em>, 29(3) :1427-1451, 2015. 
[J39] <\/b>V. Garnero, C. Paul, I. Sau and D. Thilikos. Explicit linear kernels via dynamic programming. SIAM Journal on Discrete Mathematics<\/strong><\/em>, 29(4) :1864-1894, 2015. 
[J38] <\/b>G. Joret, C. Paul, I. Sau, S. Saurabh and S. Thomass\u00e9. Hitting and harvesting pumpkins. SIAM Journal on Discrete Mathematics<\/em><\/strong>, 28(3) :1363-1390, 2014. See also arXiv:1105.2704<\/a>
[J37] <\/b>E. Gioan, C. Paul, M. Tedder and D.G. Corneil. Circle Graph Recognition in Time O(n+m).\\alpha(n+m). Algorithmica<\/em><\/strong>, 69(4):759-788, 2014. See also arXiv:1104.3284<\/a>
[J36] <\/b>E. Gioan, C. Paul, M. Tedder and D.G. Corneil. Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica<\/em><\/strong>, 69(4):789-843, 2014. See also arXiv:1104.3283<\/a> 
[J35] <\/b>P. Heggernes, P. van’t Hof, B. L\u00e9v\u00eaque and C. Paul. Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Applied Mathematics<\/em><\/strong>, 164(2):444-449, 2014. 
[J34] <\/b>N. Bousquet, G. Mertzios, C. Paul, I. Sau and S. Thomass\u00e9. Parameterized domination in circle graphs<\/a>. Theory of Computing Systems<\/em><\/strong>, 54(1):45-72, 2014. [DOI]. See also arXiv:1205.3728<\/a> 
[J33] <\/b>P. Heggernes P. van ‘t Hof, B. L\u00e9v\u00eaque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. Algorithmica<\/strong><\/em>, 68(1):109-132, 2014. See also arXiv:1104.3677<\/a>  
[J32] <\/b>S. Guillemot, F. Havet, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems. Algorithmica<\/em><\/strong>, 65(4):900-926, 2013. 
[J31] <\/b>P. Heggernes, P. van ‘t Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. SIAM Journal on Discrete Mathematics<\/em><\/strong>, 27(4):2143-2156, 2013. See also arXiv:1102.5441<\/a>
[J30] <\/b>E. Gioan and C. Paul. Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs. Discrete Applied Mathematics<\/em><\/strong>, 160(6):708-733, 2012. See also arXiv:0810.1823<\/a>
[J29] <\/b>P. Gambette, V. Berry and C. Paul. Quartet and unrooted phylogenetic networks. Journal of Bioinformatics and Computational Biology<\/strong>,<\/em> 10(4):23 pages, 2012. 
[J28] <\/b>S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomass\u00e9. Kernels for feedback arc set in tournaments. Journal of Computer and System Science<\/em><\/strong>, 77(6):1071-1078, 2011. 
[J27] <\/b>C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Algorithmica<\/em><\/strong>, 58(2):405-432, 2010.
[J26] <\/b>M. Habib and C. Paul. A survey on algorithmic aspects of modular decomposition. Computer Science Review<\/em><\/strong>, 4(1):41-59, 2010. 
[J25] <\/b>S. Bessy and C. Paul and A. Perez. Polynomial kernels for 3-leaf power graph modification problems. Discrete Applied Mathematics<\/em><\/strong>, 158(16):1732-1744, 2010. 
[J24]<\/strong> D.H. Huson, R. Rupp<\/span>, V. Berry<\/span>, P. Gambette<\/span>, C. Paul. Computing galled networks from real data. Bioinformatics<\/strong><\/em>, 25(12), 2009. 
[J23]<\/strong> S. Durocher, C. Paul. Kinetic maintenance of mobile k-centres on trees. Discrete Applied Mathematics<\/em><\/strong>, 157(7):1432-1446, 2009. 
[J22] <\/b>S. Guillemot, F. Nicolas, V. Berry and C. Paul. On the approximability results for maximum agreement subtree and maximum compatible tree problems. Discrete Applied Mathematics<\/em><\/strong>, 157(7):1555-1570, 2009. 
[J21] <\/b>C. Paul and J.A. Telle. Branchwidth of chordal graphs. Discrete Applied Mathematics<\/em><\/strong>, 157(12):2718-2725, 2009. 
[J20] <\/b>C. Paul and J.A. Telle. Edge maximal graphs of branchwidth k : the k-branches. Discrete Mathematics<\/em><\/strong>, 309(6):1467-1475, 2009. 
[J19] <\/b>S. B\u00e9rard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Computation of perfect DCJ rearrangement with linear and circular chromosomes. In Journal of Computational Biology<\/strong><\/em>, 16(10) :1287-1309, 2009. 
[J18] <\/b> Y. Villanger, P. Heggerness, C. Paul and J.A. Telle. Interval completion with few edges. In <\/i>SIAM Journal on Computing<\/strong>, 38(5):2007-2020 , 2009. 
<\/i>[J17] <\/b>V. Berry, S. Guillemot, F. Nicolas and C. Paul. Linear time 3-approximation for MAST problem. ACM Transcations on Algorithms<\/em><\/strong>, 5(2):1-18, 2009. 
[J16] <\/b>S. B\u00e9rard, C. Chauve and C. Paul. A more efficient algorithm for perfect sorting by reversals. Information Processing Letters<\/em><\/strong>, 106:90-95, 2008.
[J15] <\/b>C. Gavoille and C. Paul. Optimal Distance Labeling for Interval and Circular-Arc Graphs. SIAM Journal on Discrete Mathematics<\/em><\/strong>, 22(3) :1239-1258, 2008. 
[J14] <\/b>A. Bretscher, D. Corneil, M. Habib and C. Paul. A simple linear time LexBFS cograph recognition algorithm. SIAM Journal on Discrete Mathematics<\/em><\/strong>, 22(4) :1277-1296, 2008.  
[J13]<\/b> B.M. Bui Xuan and M. habib and C. Paul. Competitive Graph Searches. Theoretical Computer Science<\/em><\/strong>, 393(1-3):72-80, 2008. 
[J12] <\/b>M. Habib, D. Kelly, E. Lebhar and C. Paul. Can transitive orientation make sandwich problems easier? Discrete Mathematics<\/em><\/strong>, 307:2030-2041, 2007.
[J11] <\/b>A. Bergeron, S. B\u00e9rard, C. Chauve, and C. Paul. Perfect sorting by reversals is not Always Difficult. <\/span>IEEE-ACM Transaction on Computational Biology and Bioinformatics<\/em><\/strong>, 4(1):4-16, 2007. 
<\/span>[J10] <\/b>C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. <\/span>Discrete Applied Mathematics<\/em><\/strong>, 154(12):1722-1741, 2006. 
<\/span>[J9] <\/b>P. Fraigniaud and C. Gavoille and C. Paul. Eclecticism Shrinks Even Small Worlds. <\/span>Journal of Distributed Computing<\/em><\/strong>, 18(4):279-291, 2006. 
<\/span>[J8] <\/b>M. Habib and C. Paul. A Simple Linear Time Algorithm for Cograph Recongition. <\/span>Discrete Applied Mathematics<\/em><\/strong>, 145(2):183-197, 2005. 
<\/span>[J7] <\/b>C. Gavoille and C. Paul. Distance labeling and split decomposition. <\/span>Discrete Mathematics<\/em><\/strong>, 273(1-3):115-130, 2003. 
<\/span>[J6] <\/b>M. Habib and E. Lebhar and C. Paul. A note on finding all homogeneous set sandwiches. <\/span>Information Processing Letters<\/em><\/strong>, 87:147-151, 2003. 
<\/span>[J5] <\/b>D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. <\/span>Discrete Applied Mathematics<\/em><\/strong>, 113(2-3):143-166, 2001. 
<\/span>[J4] <\/b>M. Habib, C. Paul, and L. Viennot. Linear time recognition of <\/span>P<\/em>4-indifference graphs. <\/span>Discrete Mathematics and Theoretical Computer Science<\/em><\/strong>, 4(2):173-178, 2001. Special issue: Graph Decomposition. 
<\/span>[J3]<\/b> G. Damiand, M. Habib, and C. Paul. A simple paradigm for graph recognition : application to cographs and distance hereditary graphs. <\/span>Theoretical Computer Science<\/em><\/strong>, 263:99-111, 2001. 
<\/span>[J2]<\/b> M. Habib, R. McConnell, C. Paul, and L. Viennot. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. <\/span>Theoretical Computer Science<\/em><\/strong>, 234:59-84, 2000. 
<\/span>[J1]<\/b> M. Habib, C. Paul, and L. Viennot. Partition refinement : an interested algorithmic tool kit. <\/span>International Journal of Foundation of Computer Science<\/em><\/strong>, 10(2):147-170, 1999.<\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Journal papers [J65] L. Magne, C. Paul, A. Sharma, D.M. Thilikos. Edge-treewidth: Algorithmic and combinatorial properties. Discrete Applied Mathematics, 341:40-54, 2023.[J64] G. Mescoff, C. Paul, D.M. Thilikos. The mixed search game against an agile and…<\/p>\n","protected":false},"author":34,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"elementor_header_footer","meta":{"_crdt_document":"","_uag_custom_page_level_css":"","footnotes":""},"class_list":["post-2285","page","type-page","status-publish","hentry"],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"Christophe PAUL","author_link":"https:\/\/www.lirmm.fr\/christophe-paul\/author\/christophe-paul\/"},"uagb_comment_info":0,"uagb_excerpt":"Journal papers [J65] L. Magne, C. Paul, A. Sharma, D.M. Thilikos. Edge-treewidth: Algorithmic and combinatorial properties. Discrete Applied Mathematics, 341:40-54, 2023.[J64] G. Mescoff, C. Paul, D.M. Thilikos. The mixed search game against an agile and…","_links":{"self":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages\/2285","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/users\/34"}],"replies":[{"embeddable":true,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/comments?post=2285"}],"version-history":[{"count":0,"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/pages\/2285\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.lirmm.fr\/christophe-paul\/wp-json\/wp\/v2\/media?parent=2285"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}