Edit Profile (opens in new tab) Paul, Christophe Compute Distance To: Compute Author ID: paul.christophe Published as: Paul, Christophe; Paul, C. External Links: MGP Documents Indexed: 99 Publications since 1998 7 Contributions as Editor Co-Authors: 82 Co-Authors with 103 Joint Publications 2,108 Co-Co-Authors all top 5 Co-Authors 0 single-authored 20 Sau, Ignasi 15 Habib, Michel A. 13 Thilikos, Dimitrios M. 12 Kim, Eunjung 10 Heggernes, Pinar 9 Telle, Jan Arne 8 Corneil, Derek Gordon 8 Gavoille, Cyril 8 Perez, Anthony 8 Thomassé, Stéphan 7 van ’t Hof, Pim 6 Bessy, Stéphane 6 Gonçalves, Daniel 5 Guillemot, Sylvain 5 Lokshtanov, Daniel 5 Pilipczuk, Michał 4 Berry, Vincent 4 Crespelle, Christophe 4 Gioan, Emeric 4 Saurabh, Saket 3 Barbero, Florian 3 Baste, Julien 3 Garnero, Valentin 3 Gözüpek, Didem 3 Kanté, Mamadou Moustapha 3 Lévêque, Benjamin 3 Nicolas, François 3 Oum, Sang-Il 3 Shalom, Mordechai 3 Tedder, Marc 3 Viennot, Laurent 2 Bougeret, Marin 2 Bousquet, Nicolas 2 Bretscher, Anna 2 Bui-Xuan, Binh-Minh 2 Cohen, Nathann 2 Dragan, Feodor F. 2 Durocher, Stephane 2 Fomin, Fedor V. 2 Fraigniaud, Pierre 2 Gaspers, Serge 2 Golovach, Petr A. 2 Joret, Gwenaël 2 Kwon, Ojoung 2 Langer, Alexander 2 Lebhar, Emmanuelle 2 Mertzios, George B. 2 Niedermeier, Rolf 2 Ozkan, Sibel 2 Philip, Geevarghese 2 Reidl, Felix 2 Rossmanith, Peter 2 Scornavacca, Celine 2 Sikdar, Somnath 2 Singh, Garib Nath 2 Villanger, Yngve 2 Weller, Mathias 1 Bérard, Sèverine 1 Bergougnoux, Benjamin 1 Bläser, Markus 1 Brandes, Ulrik 1 Chaplick, Steven 1 Chauve, Cedric 1 Damiand, Guillaume 1 de Montgolfier, Fabien 1 Fellows, Michael Ralph 1 Gambette, Philippe 1 Giannopoulos, Panos 1 Habib, Michael 1 Havet, Frédéric 1 Høgemo, Svein 1 Katz, Michal 1 Katz, Nir A. 1 Khetan, Mukti 1 Knauer, Christian 1 Limnios, Stratis 1 Mescoff, Guillaume 1 Nederlof, Jesper 1 Peleg, David 1 Perret, Joanny 1 Proskurowski, Andrzej 1 Raffinot, Mathieu 1 Rosamond, Frances A. 1 Sharma, Anup Kumar 1 Suman, Surbhi 1 Whitesides, Sue H. 1 Yu, Nathan all top 5 Serials 12 Discrete Applied Mathematics 9 Algorithmica 7 SIAM Journal on Discrete Mathematics 5 Journal of Computer and System Sciences 5 Theoretical Computer Science 3 Discrete Mathematics 3 ACM Transactions on Algorithms 3 LIPIcs – Leibniz International Proceedings in Informatics 2 Information Processing Letters 2 Theory of Computing Systems 1 Bulletin of Mathematical Biology 1 Journal of Graph Theory 1 SIAM Journal on Computing 1 International Journal of Foundations of Computer Science 1 Communications in Statistics. Theory and Methods 1 Distributed Computing 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 Hacettepe Journal of Mathematics and Statistics 1 Lecture Notes in Computer Science 1 Computer Science Review all top 5 Fields 85 Computer science (68-XX) 84 Combinatorics (05-XX) 8 Operations research, mathematical programming (90-XX) 7 General and overarching topics; collections (00-XX) 6 Biology and other natural sciences (92-XX) 3 Statistics (62-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Numerical analysis (65-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 82 Publications have been cited 752 times in 526 Documents Cited by ▼ Year ▼ Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Zbl 0945.68189Habib, M.; McConnell, R.; Paul, C.; Viennot, L. 81 2000 A survey of the algorithmic aspects of modular decomposition. Zbl 1302.68140Habib, Michel; Paul, Christophe 51 2010 Simpler linear-time modular decomposition via recursive factorizing permutations. Zbl 1153.68410Tedder, Marc; Corneil, Derek; Habib, Michel; Paul, Christophe 48 2008 Fully dynamic recognition algorithm and certificate for directed cographs. Zbl 1110.68096Crespelle, C.; Paul, C. 33 2006 A simple linear time algorithm for cograph recognition. Zbl 1055.05107Habib, Michel; Paul, Christophe 32 2005 Approximate distance labeling schemes (extended abstract). Zbl 1006.68542Gavoille, Cyril; Katz, Michal; Katz, Nir A.; Paul, Christophe; Peleg, David 26 2001 Interval completion is fixed parameter tractable. Zbl 1227.05241Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne 25 2009 Partition refinement techniques: an interesting algorithmic tool kit. Zbl 1319.68240Habib, Michel; Paul, Christophe; Viennot, Laurent 20 1999 Kernels for feedback arc set in tournaments. Zbl 1235.05134Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan 20 2011 On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1262.68048Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony 20 2013 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 19 2013 A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs. Zbl 0972.05046Damiand, G.; Habib, M.; Paul, C. 18 2001 A simple linear time LexBFS cograph recognition algorithm. Zbl 1255.68108Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe 18 2003 Contracting graphs to paths and trees. Zbl 1310.68229Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe 17 2014 A simple linear-time modular decomposition algorithm for graphs, using order extension. Zbl 1095.68622Habib, Michel; de Montgolfier, Fabien; Paul, Christophe 16 2004 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 15 2016 Diameter determination on restricted graph families. Zbl 0990.05119Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe 13 2001 A simple linear time LexBFS cograph recognition algorithm. Zbl 1187.05070Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe 13 2008 Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe 13 2013 Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. Zbl 1236.05162Gioan, Emeric; Paul, Christophe 12 2012 Eclecticism shrinks even small worlds. Zbl 1321.05246Fraigniaud, Pierre; Gavoille, Cyril; Paul, Christophe 11 2004 Practical and efficient circle graph recognition. Zbl 1303.05190Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek 11 2014 Interval completion with few edges. Zbl 1232.68074Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve 10 2007 Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. Zbl 1205.68258Crespelle, Christophe; Paul, Christophe 9 2010 Explicit linear kernels via dynamic programming. Zbl 1323.05119Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 9 2015 Obtaining a bipartite graph by contracting few edges. Zbl 1246.68132Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe 9 2011 On the approximation of computing evolutionary trees. Zbl 1128.68554Berry, Vincent; Guillemot, Sylvain; Nicolas, François; Paul, Christophe 8 2005 Distance labeling scheme and split decomposition. Zbl 1029.05136Gavoille, Cyril; Paul, Christophe 8 2003 On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1309.68151Guillemot, Sylvain; Paul, Christophe; Perez, Anthony 8 2010 The structure of level-\(k\) phylogenetic networks. Zbl 1247.92018Gambette, Philippe; Berry, Vincent; Paul, Christophe 8 2009 Dynamic distance hereditary graphs using split decomposition. Zbl 1193.68191Gioan, Emeric; Paul, Christophe 8 2007 Revisiting T. Uno and M. Yagiura’s algorithm. (Extended abstract). Zbl 1173.68836Xuan, Binh-Minh Bui; Habib, Michel; Paul, Christophe 8 2005 Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem. Zbl 1343.68119Paul, Christophe; Perez, Anthony; Thomassé, Stéphan 7 2011 Practical and efficient split decomposition via graph-labelled trees. Zbl 1303.05191Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek 7 2014 Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne 6 2010 Hitting and harvesting pumpkins. Zbl 1305.05221Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 6 2014 Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1288.05060Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe 6 2014 Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. Zbl 1182.05046Gavoille, Cyril; Paul, Christophe 5 2001 Optimal distance labeling for interval and circular-arc graphs. Zbl 1266.05019Gavoille, Cyril; Paul, Christophe 5 2003 Polynomial kernels for 3-leaf power graph modification problems. Zbl 1231.05131Bessy, Stéphane; Paul, Christophe; Perez, Anthony 5 2010 New tools and simpler algorithms for branchwidth. Zbl 1162.68503Paul, Christophe; Telle, Jan Arne 5 2005 Optimal distance labeling for interval graphs and related graph families. Zbl 1197.05097Gavoille, Cyril; Paul, Christophe 4 2008 Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. Zbl 1454.68055Barbero, Florian; Paul, Christophe; Pilipczuk, MichaŁ 4 2018 A note on finding all homogeneous set sandwiches. Zbl 1161.68671Habib, Michel; Lebhar, Emmanuelle; Paul, Christophe 4 2003 Kernels for feedback arc set in tournaments. Zbl 1248.68235Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan 4 2009 A more efficient algorithm for perfect sorting by reversals. Zbl 1186.68143Bérard, Sèverine; Chauve, Cedric; Paul, Christophe 3 2008 Milling a graph with turn costs: a parameterized complexity perspective. Zbl 1309.68093Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan 3 2010 Competitive graph searches. Zbl 1136.68040Bui-Xuan, Binh-Minh; Habib, Michel; Paul, Christophe 3 2008 An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Zbl 1372.68131Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-joung; Paul, Christophe 3 2017 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 3 2017 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2015 Hadwiger number of graphs with small chordality. Zbl 1417.05209Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Paul, Christophe 3 2014 Eclecticism shrinks even small worlds. Zbl 1264.05127Fraigniaud, Pierre; Gavoille, Cyril; Paul, Christophe 3 2006 Contracting graphs to paths and trees. Zbl 1310.68228Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe 3 2012 Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. Zbl 1126.68515Crespelle, Christophe; Paul, Christophe 3 2005 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68221Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2018 Explicit linear kernels for packing problems. Zbl 1422.68111Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 2 2019 Can transitive orientation make sandwich problems easier? Zbl 1122.05088Habib, Michel; Kelly, David; Lebhar, Emmanuelle; Paul, Christophe 2 2007 A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1372.05216Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias 2 2017 On independent set on B1-EPG graphs. Zbl 1478.05099Bougeret, M.; Bessy, S.; Gonçalves, D.; Paul, C. 2 2015 Hadwiger number of graphs with small chordality. Zbl 1327.05322Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe 2 2015 A single-exponential FPT algorithm for the \(K_4\)-minor cover problem. Zbl 1357.68289Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese 2 2015 Diameter determination on restricted graph families. Zbl 0928.68087Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe 2 1998 Some estimation procedures of sensitive character using scrambled response techniques in successive sampling. Zbl 1392.62037Singh, G. N.; Suman, S.; Khetan, M.; Paul, C. 2 2018 Strong immersion is a well-quasi-ordering for semicomplete digraphs. Zbl 1414.05273Barbero, Florian; Paul, Christophe; Pilipczuk, Michał 1 2019 Maximal common connected sets of interval graphs. Zbl 1103.68655Habib, Michel; Paul, Christophe; Raffinot, Mathieu 1 2004 Fully-dynamic recognition algorithm and certificate for directed cographs. Zbl 1112.68416Crespelle, Christophe; Paul, Christophe 1 2004 Linear time recognition of \(P_4\)-indifference graphs. Zbl 0981.05092Habib, Michael; Paul, Christophe; Viennot, Laurent 1 2001 Edge-maximal graphs of branchwidth \(K\). Zbl 1200.05194Paul, Christophe; Telle, Jan Arne 1 2005 Branchwidth of chordal graphs. Zbl 1211.05167Paul, Christophe; Telle, Jan Arne 1 2009 Polynomial kernels for 3-leaf power graph modification problems. Zbl 1267.05244Bessy, Stéphane; Paul, Christophe; Perez, Anthony 1 2009 Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Zbl 1443.68119Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. 1 2018 Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches. Zbl 1229.05153Paul, Christophe; Telle, Jan Arne 1 2009 Parameterized complexity of the MinCCA problem on graphs of bounded decomposability. Zbl 1372.68126Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2017 Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2015 An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Zbl 1372.68130Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-Joung; Paul, Christophe 1 2015 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1480.92142Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 1 2016 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2016 Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. Zbl 1346.68112Paul, Christophe; Perez, Anthony; Thomassé, Stéphan 1 2016 Hitting and harvesting pumpkins. Zbl 1346.68111Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 1 2011 Parameterized domination in circle graphs. Zbl 1286.68222Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan 1 2014 A linear fixed parameter tractable algorithm for connected pathwidth. Zbl 07489476Kanté, Mamadou M.; Paul, Christophe; Thilikos, Dimitrios M. 1 2022 A linear fixed parameter tractable algorithm for connected pathwidth. Zbl 07489476Kanté, Mamadou M.; Paul, Christophe; Thilikos, Dimitrios M. 1 2022 Explicit linear kernels for packing problems. Zbl 1422.68111Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 2 2019 Strong immersion is a well-quasi-ordering for semicomplete digraphs. Zbl 1414.05273Barbero, Florian; Paul, Christophe; Pilipczuk, Michał 1 2019 Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. Zbl 1454.68055Barbero, Florian; Paul, Christophe; Pilipczuk, MichaŁ 4 2018 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68221Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2018 Some estimation procedures of sensitive character using scrambled response techniques in successive sampling. Zbl 1392.62037Singh, G. N.; Suman, S.; Khetan, M.; Paul, C. 2 2018 Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Zbl 1443.68119Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. 1 2018 An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Zbl 1372.68131Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-joung; Paul, Christophe 3 2017 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 3 2017 A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1372.05216Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias 2 2017 Parameterized complexity of the MinCCA problem on graphs of bounded decomposability. Zbl 1372.68126Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2017 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 15 2016 Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1480.92142Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine 1 2016 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai 1 2016 Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. Zbl 1346.68112Paul, Christophe; Perez, Anthony; Thomassé, Stéphan 1 2016 Explicit linear kernels via dynamic programming. Zbl 1323.05119Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 9 2015 An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 3 2015 On independent set on B1-EPG graphs. Zbl 1478.05099Bougeret, M.; Bessy, S.; Gonçalves, D.; Paul, C. 2 2015 Hadwiger number of graphs with small chordality. Zbl 1327.05322Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe 2 2015 A single-exponential FPT algorithm for the \(K_4\)-minor cover problem. Zbl 1357.68289Kim, Eun Jung; Paul, Christophe; Philip, Geevarghese 2 2015 Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 1 2015 An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Zbl 1372.68130Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-Joung; Paul, Christophe 1 2015 Contracting graphs to paths and trees. Zbl 1310.68229Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe 17 2014 Practical and efficient circle graph recognition. Zbl 1303.05190Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek 11 2014 Practical and efficient split decomposition via graph-labelled trees. Zbl 1303.05191Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek 7 2014 Hitting and harvesting pumpkins. Zbl 1305.05221Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 6 2014 Contracting chordal graphs and bipartite graphs to paths and trees. Zbl 1288.05060Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe 6 2014 Hadwiger number of graphs with small chordality. Zbl 1417.05209Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Paul, Christophe 3 2014 Parameterized domination in circle graphs. Zbl 1286.68222Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan 1 2014 On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1262.68048Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony 20 2013 Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath 19 2013 Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe 13 2013 Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. Zbl 1236.05162Gioan, Emeric; Paul, Christophe 12 2012 Contracting graphs to paths and trees. Zbl 1310.68228Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe 3 2012 Kernels for feedback arc set in tournaments. Zbl 1235.05134Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan 20 2011 Obtaining a bipartite graph by contracting few edges. Zbl 1246.68132Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe 9 2011 Conflict packing yields linear vertex-kernels for \(k\)-FAST, \(k\)-dense RTI and a related problem. Zbl 1343.68119Paul, Christophe; Perez, Anthony; Thomassé, Stéphan 7 2011 Hitting and harvesting pumpkins. Zbl 1346.68111Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan 1 2011 A survey of the algorithmic aspects of modular decomposition. Zbl 1302.68140Habib, Michel; Paul, Christophe 51 2010 Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. Zbl 1205.68258Crespelle, Christophe; Paul, Christophe 9 2010 On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. Zbl 1309.68151Guillemot, Sylvain; Paul, Christophe; Perez, Anthony 8 2010 Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne 6 2010 Polynomial kernels for 3-leaf power graph modification problems. Zbl 1231.05131Bessy, Stéphane; Paul, Christophe; Perez, Anthony 5 2010 Milling a graph with turn costs: a parameterized complexity perspective. Zbl 1309.68093Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan 3 2010 Interval completion is fixed parameter tractable. Zbl 1227.05241Villanger, Yngve; Heggernes, Pinar; Paul, Christophe; Telle, Jan Arne 25 2009 The structure of level-\(k\) phylogenetic networks. Zbl 1247.92018Gambette, Philippe; Berry, Vincent; Paul, Christophe 8 2009 Kernels for feedback arc set in tournaments. Zbl 1248.68235Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan 4 2009 Branchwidth of chordal graphs. Zbl 1211.05167Paul, Christophe; Telle, Jan Arne 1 2009 Polynomial kernels for 3-leaf power graph modification problems. Zbl 1267.05244Bessy, Stéphane; Paul, Christophe; Perez, Anthony 1 2009 Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches. Zbl 1229.05153Paul, Christophe; Telle, Jan Arne 1 2009 Simpler linear-time modular decomposition via recursive factorizing permutations. Zbl 1153.68410Tedder, Marc; Corneil, Derek; Habib, Michel; Paul, Christophe 48 2008 A simple linear time LexBFS cograph recognition algorithm. Zbl 1187.05070Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe 13 2008 Optimal distance labeling for interval graphs and related graph families. Zbl 1197.05097Gavoille, Cyril; Paul, Christophe 4 2008 A more efficient algorithm for perfect sorting by reversals. Zbl 1186.68143Bérard, Sèverine; Chauve, Cedric; Paul, Christophe 3 2008 Competitive graph searches. Zbl 1136.68040Bui-Xuan, Binh-Minh; Habib, Michel; Paul, Christophe 3 2008 Interval completion with few edges. Zbl 1232.68074Heggernes, Pinar; Paul, Christophe; Teile, Jan Arne; Villanger, Yngve 10 2007 Dynamic distance hereditary graphs using split decomposition. Zbl 1193.68191Gioan, Emeric; Paul, Christophe 8 2007 Can transitive orientation make sandwich problems easier? Zbl 1122.05088Habib, Michel; Kelly, David; Lebhar, Emmanuelle; Paul, Christophe 2 2007 Fully dynamic recognition algorithm and certificate for directed cographs. Zbl 1110.68096Crespelle, C.; Paul, C. 33 2006 Eclecticism shrinks even small worlds. Zbl 1264.05127Fraigniaud, Pierre; Gavoille, Cyril; Paul, Christophe 3 2006 A simple linear time algorithm for cograph recognition. Zbl 1055.05107Habib, Michel; Paul, Christophe 32 2005 On the approximation of computing evolutionary trees. Zbl 1128.68554Berry, Vincent; Guillemot, Sylvain; Nicolas, François; Paul, Christophe 8 2005 Revisiting T. Uno and M. Yagiura’s algorithm. (Extended abstract). Zbl 1173.68836Xuan, Binh-Minh Bui; Habib, Michel; Paul, Christophe 8 2005 New tools and simpler algorithms for branchwidth. Zbl 1162.68503Paul, Christophe; Telle, Jan Arne 5 2005 Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. Zbl 1126.68515Crespelle, Christophe; Paul, Christophe 3 2005 Edge-maximal graphs of branchwidth \(K\). Zbl 1200.05194Paul, Christophe; Telle, Jan Arne 1 2005 A simple linear-time modular decomposition algorithm for graphs, using order extension. Zbl 1095.68622Habib, Michel; de Montgolfier, Fabien; Paul, Christophe 16 2004 Eclecticism shrinks even small worlds. Zbl 1321.05246Fraigniaud, Pierre; Gavoille, Cyril; Paul, Christophe 11 2004 Maximal common connected sets of interval graphs. Zbl 1103.68655Habib, Michel; Paul, Christophe; Raffinot, Mathieu 1 2004 Fully-dynamic recognition algorithm and certificate for directed cographs. Zbl 1112.68416Crespelle, Christophe; Paul, Christophe 1 2004 A simple linear time LexBFS cograph recognition algorithm. Zbl 1255.68108Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe 18 2003 Distance labeling scheme and split decomposition. Zbl 1029.05136Gavoille, Cyril; Paul, Christophe 8 2003 Optimal distance labeling for interval and circular-arc graphs. Zbl 1266.05019Gavoille, Cyril; Paul, Christophe 5 2003 A note on finding all homogeneous set sandwiches. Zbl 1161.68671Habib, Michel; Lebhar, Emmanuelle; Paul, Christophe 4 2003 Approximate distance labeling schemes (extended abstract). Zbl 1006.68542Gavoille, Cyril; Katz, Michal; Katz, Nir A.; Paul, Christophe; Peleg, David 26 2001 A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs. Zbl 0972.05046Damiand, G.; Habib, M.; Paul, C. 18 2001 Diameter determination on restricted graph families. Zbl 0990.05119Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe 13 2001 Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. Zbl 1182.05046Gavoille, Cyril; Paul, Christophe 5 2001 Linear time recognition of \(P_4\)-indifference graphs. Zbl 0981.05092Habib, Michael; Paul, Christophe; Viennot, Laurent 1 2001 Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Zbl 0945.68189Habib, M.; McConnell, R.; Paul, C.; Viennot, L. 81 2000 Partition refinement techniques: an interesting algorithmic tool kit. Zbl 1319.68240Habib, Michel; Paul, Christophe; Viennot, Laurent 20 1999 Diameter determination on restricted graph families. Zbl 0928.68087Corneil, Derek G.; Dragan, Feodor F.; Habib, Michel; Paul, Christophe 2 1998 all cited Publications top 5 cited Publications all top 5 Cited by 711 Authors 34 Paul, Christophe 22 Thilikos, Dimitrios M. 21 Habib, Michel A. 17 Sau, Ignasi 16 Saurabh, Saket 14 Paulusma, Daniël 13 Gurski, Frank 13 Lokshtanov, Daniel 12 Dragan, Feodor F. 12 Fomin, Fedor V. 12 Golovach, Petr A. 11 Heggernes, Pinar 10 Corneil, Derek Gordon 10 Pilipczuk, Michał 9 Cao, Yixin 9 Crespelle, Christophe 9 Gavoille, Cyril 9 Komander, Dominique 9 Kwon, Ojoung 9 Niedermeier, Rolf 9 Papadopoulos, Charis 9 Perez, Anthony 9 Rehs, Carolin 9 van ’t Hof, Pim 8 Gutin, Gregory Z. 8 Hellmuth, Marc 8 Jansen, Bart M. P. 8 Komusiewicz, Christian 8 Stadler, Peter F. 8 Szeider, Stefan 8 Todinca, Ioan 8 Wang, Jianxin 7 Chen, Jian-er 7 Köhler, Ekkehard 7 Marx, Dániel 7 Pilipczuk, Marcin L. 6 Bessy, Stéphane 6 Chauve, Cedric 6 Ganian, Robert 6 Kim, Eunjung 6 Kratsch, Stefan 6 Tale, Prafullkumar 6 Telle, Jan Arne 6 Yeo, Anders 5 Agrawal, Akanksha 5 Baste, Julien 5 Belmonte, Rémy 5 Dabrowski, Konrad Kazimierz 5 Ducoffe, Guillaume 5 Eiben, Eduard 5 Fraigniaud, Pierre 5 Gambette, Philippe 5 Golumbic, Martin Charles 5 Guillemot, Sylvain 5 Guo, Jiong 5 Huang, Jing 5 Kelk, Steven 5 Klein, Sulamita 5 Korman, Amos 5 Lebhar, Emmanuelle 5 Maffray, Frédéric 5 Nikolopoulos, Stavros D. 5 Otachi, Yota 5 Peleg, David 5 Szwarcfiter, Jayme Luiz 5 Wrochna, Marcin 4 Bang-Jensen, Jørgen 4 Bougeret, Marin 4 Bouvel, Mathilde 4 Bui-Xuan, Binh-Minh 4 Faria, Luerbio 4 Fernandes dos Santos, Vinícius 4 Gonçalves, Daniel 4 Gözüpek, Didem 4 Hanaka, Tesshu 4 Hell, Pavol 4 Kanté, Mamadou Moustapha 4 Kim, Eun Jung 4 Kloks, Ton 4 Lévêque, Benjamin 4 McConnell, Ross M. 4 Meister, Daniel 4 Mertzios, George B. 4 Milanič, Martin 4 Mnich, Matthias 4 Müller, Haiko 4 Palios, Leonidas 4 Peng, Sheng-Lung 4 Raymond, Jean-Florent 4 Rotics, Udi 4 Sandeep, R. B. 4 Shalom, Mordechai 4 Sorge, Manuel 4 Traldi, Lorenzo 4 Uehara, Ryuhei 4 Van Leeuwen, Erik Jan 4 Villanger, Yngve 4 Wu, Taoyang 4 Zehavi, Meirav 3 Adler, Isolde ...and 611 more Authors all top 5 Cited in 64 Serials 95 Discrete Applied Mathematics 63 Theoretical Computer Science 61 Algorithmica 22 SIAM Journal on Discrete Mathematics 20 Journal of Computer and System Sciences 17 Discrete Mathematics 16 Information Processing Letters 13 Theory of Computing Systems 11 Journal of Combinatorial Optimization 8 Journal of Mathematical Biology 7 European Journal of Combinatorics 7 Distributed Computing 6 Information and Computation 5 Journal of Graph Algorithms and Applications 4 Journal of Graph Theory 4 The Electronic Journal of Combinatorics 4 Journal of Discrete Algorithms 4 Discrete Optimization 3 Journal of Combinatorial Theory. Series B 3 SIAM Journal on Computing 3 Journal of Classification 3 Graphs and Combinatorics 3 Mathematical Methods of Operations Research 3 Discrete Mathematics, Algorithms and Applications 3 Computer Science Review 2 Acta Informatica 2 Networks 2 Annals of Operations Research 2 International Journal of Foundations of Computer Science 2 Discrete Mathematics and Theoretical Computer Science. DMTCS 2 Trudy Instituta Matematiki 1 Linear and Multilinear Algebra 1 Physica A 1 Bulletin of Mathematical Biology 1 Applied Mathematics and Computation 1 Advances in Applied Mathematics 1 Science of Computer Programming 1 Order 1 Journal of Computer Science and Technology 1 Discrete & Computational Geometry 1 Computers & Operations Research 1 European Journal of Operational Research 1 International Journal of Computer Mathematics 1 Pattern Recognition 1 Cybernetics and Systems Analysis 1 Annals of Mathematics and Artificial Intelligence 1 Discussiones Mathematicae. Graph Theory 1 International Transactions in Operational Research 1 Doklady Mathematics 1 Journal of Scheduling 1 Data Mining and Knowledge Discovery 1 New Journal of Physics 1 RAIRO. Theoretical Informatics and Applications 1 RAIRO. Operations Research 1 ACM Transactions on Computational Logic 1 Computational Intelligence 1 Journal of Applied Logic 1 AKCE International Journal of Graphs and Combinatorics 1 International Electronic Journal of Algebra (IEJA) 1 Algorithms 1 RAIRO. Theoretical Informatics and Applications 1 Journal of Theoretical Biology 1 ACM Transactions on Computation Theory 1 The Art of Discrete and Applied Mathematics all top 5 Cited in 17 Fields 400 Combinatorics (05-XX) 349 Computer science (68-XX) 40 Operations research, mathematical programming (90-XX) 29 Biology and other natural sciences (92-XX) 10 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 9 Order, lattices, ordered algebraic structures (06-XX) 8 Convex and discrete geometry (52-XX) 6 Mathematical logic and foundations (03-XX) 5 Linear and multilinear algebra; matrix theory (15-XX) 4 Statistics (62-XX) 3 Numerical analysis (65-XX) 3 Information and communication theory, circuits (94-XX) 1 Number theory (11-XX) 1 Group theory and generalizations (20-XX) 1 Functional analysis (46-XX) 1 Geometry (51-XX) 1 Probability theory and stochastic processes (60-XX) Citations by Year