[91] C. Paul, E. Protopapas, D.M. Thilikos and S. Wiederrecht. Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces. In  International Colloquium on Automata, Logic and Programming – ICALP. Number 297 of Leibnitz International Proceedings in Informatics, pages 35:1-35:20, 2024.
To appear.

[90] D.G. Corneil, M. Habib, C. Paul, M. Tedder. A recursive linear time modular decomposition algorithm via LexBFS. arXiv:0710.3901, 2024.
Extended abstract: Simple, linear-time modular decomposition. In International Colloquium on Automata, Languages and Programming – ICALP. Number 5125 in Lecture Notes in Computer Science, pages 634-645, 2008.

[89] C. Paul, E. Protopapas, D.M. Thilikos. Graph Parameters, Universal Obstructions, and WQO. arXiv:2304.03688, 2023.

[88] C. Paul, E. Protopapas. Tree-Layout Based Graph Classes: Proper Chordal Graphs. In International Symposium on Theoretical Aspects of Computer Science – STACS. Number 289 of Leibnitz International Proceedings in Informatics, pages 55:1-55:18, 2024.
See also arXiv:2211.07550, 2022.

[87] C. Paul, E. Protopapas, D.M. Thilikos. Universal obstructions of graph parameters. arXiv 2304.14121, 2023.

[86] L. Magne, C. Paul, A. Sharma, D.M. Thilikos. Edge-treewidth: Algorithmic and combinatorial properties. Discrete Applied Mathematics, 341:40-54, 2023.
See also arXiv:2112.07524, 2021.

[85] G. Mescoff, C. Paul, D.M. Thilikos. The mixed search game against an agile and visible fugitive is monotone. Discrete Mathematics, 346(4):113345, 2023.
See also arXiv:2204.10691, 2022.

[84] C. Paul, M. Bläser. Preface of STACS 2020. Special issue of Theory of Computing Systems, 67(1):1-3, 2023.

[83] G. Mescoff, C. Paul, D.M. Thilikos. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. Discrete Applied Mathematics, 312:72-85, 2022.
See also arXiv:2004.00547, 2020.

[82] M.M. Kanté, C. Paul, D.M. Thilikos. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM Journal on Discrete Mathematics, 36(1):411-435, 2022.
Extended abstract in Annual European Symposium on Algorithms – ESA. Number 173 of Leibnitz International Proceedings in Informatics, pages 64:1-64:16, 2020.
See also arXiv:2004.11937, 2020.

[81] S. Høgemo, B. Bergougnoux, U. Brandes, C. Paul, J.A. Telle. On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. In International Symposium Fundamentals of Computation Theory – FCT. Number 12867 of Lecture Notes in Computer Science, pages 287-300, 2021.
See also arXiv:2105.12093, 2021.

[80] I. Adler, C. Paul, D.M. Thilikos. Connected search for a lazy robber. Journal of Graph Theory, 97(4):510-552, 2021.
Extended abstract in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science – FSTTCS. Number 150 of Leibnitz International Proceedings in Informatics, page 7:1-7:14, 2019.

[79] R. Niedermeier, C. Paul. Preface of STACS 2019 Special Issue of Theory of Computing Systems, 65(4):635-637, 2021.

[78] C. Paul, M. Pilipczuk. Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica, 82(8): 2133-2134, 2020.

[77] S. Høgemo, C. Paul, J.A. Telle. Hierarchical Clusterings of Unweighted Graphs. In International Symposium on Mathematical Foundations of Computer Science – MFCS. Number 173 of Leibnitz International Proceedings in Informatics, pages 47:1-47:13, 2020.
See also arXiv:2008.03061, 2020.

[76] S. Bessy, M. Bougeret, S. Chaplick, D. Gonçalves, C. Paul. On independent set in B1-EPG graphs. Discrete Applied Mathematics, 278:62-72, 2020.
Extended abstract in Workshop on Approximation and Online Algorithms – WAOA. Number 9499 of Lecture Notes in Computer Science , page 158-169, 2015.
See also arXiv:1510.00598, 2015.

[75] J. Baste, D. Gözüpek, C. Paul, I. Sau, M. Shalom, D.M. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks, 75(3):259-277, 2020.
Extended abstract in International Symposium on Parameterized and Exact Computation – IPEC. Number 89 of Leibnitz International Proceedings in Informatics, page 3:1-3:12, 2017.
See also arXiv:1703.01686, 2017.

[74] S. Limnios, C. Paul, J. Perret and D.M. Thilikos. Edge degeneracy: algorithmic and structural results. Theoretical Computer Science, 839:164-175, 2020.
See also arXiv:2009.03809, 2020.

[73] C. Paul, M. Bläser. Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science – STACS’20. Number 154 of Leibnitz International Proceedings in Informatics, 2020.

[72] V. Garnero, C. Paul, I. Sau and D.M. Thilikos. Explicit linear kernels for packing problems. Algorithmica, 81(4):1615-1656, 2019.
See also arXiv:1610.06131, 2016.

[71] F. Barbero, C. Paul and M. Pilipczuk. Strong immersion is a well-quasi-ordering for semi-complete digraphs. Journal of Graph Theory, 90(4):484-496, 2019.
See also arXiv:1707.03563, 2017.

[70] C. Paul, R. Niedermeier. Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science – STACS’19. Number 129 of Leibnitz International Proceedings in Informatics, 2019.

[69] C. Paul, M. Pilipczuk. Proceedings of the 13th International Symposium on Parameterized and Exact Computation – IPEC’18. Number 115 of Leibnitz International Proceedings in Informatics, 2019.

[68] E.J. Kim, S.I. Oum, C. Paul, I. Sau and D.M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica, 80(1):116,135, 2018.
Extended abstract in Workshop on Approximation and Online Algorithms – WAOA. Number 9499 of Lecture Notes in Computer Science , page 35-46, 2015.
See also arXiv:1509.04880, 2015.

[67] D.G. Corneil, S.-I. Oum, C. Paul. Preface: Seventh  Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. Discrete Applied Mathematics, 248: 1-2, 2018.

[66] F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. ACM Transactions on Algorithmics, 14(3):38:1-38-31, 2018.
Extended abstract in International Colloquim on Automata, Languages, and Programming – ICALP. Number 80 of Leibnitz International Proceedings in Informatics, page 70:1-70:13, 2017.
See also arXiv:1706.00617, 2017.

[65] M.M. Kanté, E.J. Kim, O. Kwon and C. Paul. An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. Algorithmica, 79(1):66-95, 2017. 
Extended abstract in International Symposium on Parameterized and Exact Computation – IPEC. Number 43 of Leibnitz International Proceedings in Informatics, page 138-150, 2015.
See also arXiv:1504.05905, 2015.

[64] 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, 86:191-206, 2017.
Extended abstract in International Symposium on Parameterized and Exact Computation – IPEC. Number 43 of Leibnitz International Proceedings in Informatics, page 78-89, 2015.
See also arXiv:1509.07404, 2015.

[63] N. Cohen, D. Gonçalves, 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, 89:315-327, 2017.
Extended abstract in International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 8747 of Lecture Notes in Computer Science , page 201-213, 2015.
See also arXiv:1403.5702, 2014.

[62]  D. Gözüpek, S. Özkan, C. Paul, I. Sau, M. Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theoretical Computer Science, 690:91-103, 2017.
Extended abstract in International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 9941 of Lecture Notes in Computer Science , page 195-206, 2016.
See also arXiv:1605.00532, 2016.

[61] M. Jones, C. Paul, C. Scornavacca. On the consistency of orthology relationships. In RECOMB Comparative Genomics Satellite Workshop – RECOMB-CG. BMC Bioinformatics, 17(S-14):251-262, 2016.

[60] J. Baste, C. Paul, I. Sau and C. Scornavacca. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Bulletin of Mathematical Biology, 79:920–938, 2017.
Extended abstract in International Conference on Algorithmic Aspects in Information and Management – AAIM. Number 9778 of Lecture Notes in Computer Science , page 53-64, 2016.
See also arXiv:1604.03008, 2016.

[59] C. Paul, A. Perez and S. Thomassé. Linear kernel for rooted triplet inconsistency and other problems based on conflict packing technique. Journal of Computer and System Science, 82(2):366-379, 2016.
Extended abstract: Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem. Mathematical Foundations of Computer Science – MFCS. Number 6907 of Lecture Notes in Computer Science , page 497-507, 2011.
See also arXiv:1101.4491, 2011.

[58] 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, 12(2):21, 2016.
Extended abstract in International Colloquim on Automata, Languages, and Programming – ICALP. Number 7965 of Lecture Notes in Computer Science , page 613-624, 2013.
See also arXiv:1207.0835, 2012.

[57] 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, 81(1) :186-207, 2015.
Extended abstract in Scandinavian Workshop On Algorithmic Theory – SWAT. Number 7357 of Lecture Notes in Computer Science , page 119-130, 2012.
See also arXiv:1204.1417, 2012.

[56] P. Golovach, P. Heggernes, P. van’t Hof and C. Paul. Hadwiger number of graphs with small chordality. SIAM Journal on Discrete Applied Mathematics, 29(3) :1427-1451, 2015.
Extended abstract in Workshop on Approximation and Online Algorithms – WAOA. Number 9499 of Lecture Notes in Computer Science , page 158-169, 2014.
See also arXiv:1406.3812, 2014.

[55] V. Garnero, C. Paul, I. Sau and D. Thilikos. Explicit linear kernels via dynamic programming. SIAM Journal on Discrete Mathematics, 29(4) :1864-1894, 2015.
Extended abstract in Symposium on Theoretical Aspect of Computer Science – STACS. Number 25 of Leibnitz International Proceedings in Informatics, page 312-324, 2014.
See also arXiv:1312.6585, 2013.

[54] G. Joret, C. Paul, I. Sau, S. Saurabh and S. Thomassé. Hitting and harvesting pumpkins. SIAM Journal on Discrete Mathematics, 28(3):1363-1390, 2014.
Extended abstract in European Symposium on Algorithms – ESA. Number 6942 of Lecture Notes in Computer Science , page 394-407, 2011.
See also arXiv:1105.2704,  2011.

[53] E. Gioan, C. Paul, M. Tedder and D.G. Corneil. Circle Graph Recognition in Time O(n+m).\alpha(n+m). Algorithmica, 69(4):759-788, 2014.
See also arXiv:1104.3284, 2011.

[52] E. Gioan, C. Paul, M. Tedder and D.G. Corneil. Practical and Efficient Split Decomposition via Graph-Labelled Trees. Algorithmica, 69(4):789-843, 2014.
See also arXiv:1104.3283,  2011.

[51] P. Heggernes, P. van’t Hof, B. Lévêque and C. Paul. Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Applied Mathematics, 164(2):444-449, 2014.
Extended abstract in Latin-American Algorithms, Graphs, and Optimization Symposium – LAGOS,  Electronic Notes in Discrete Mathematics, 37:87-92, 2011.

[50] N. Bousquet, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized domination in circle graphs. Theory of Computing Systems, 54(1):45-72, 2014.
Extended abstract in International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 7551 of Lecture Notes in Computer Science , page 308-319, 2012.
See also arXiv:1205.3728, 2012.

[49] P. Heggernes P. van ‘t Hof, B. Lévêque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. Algorithmica, 68(1):109-132, 2014.
Extended abstract in International Symposium on Parameterized and exact Computation – IPEC. Number 7112 of Lecture Notes in Computer Science , page 55-66, 2011.
See also arXiv:1104.3677, 2011.

[48] S. Guillemot, F. Havet, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for Pl-free edge modification problems. Algorithmica, 65(4):900-926, 2013.
Extended abstract in International Symposium on Parameterized and Exact Computation – IPEC. Number 6478 in Lecture Notes in Computer Science, pages 147-157, 2010.
See also arXiv:1007.4011, 2010.

[47] P. Heggernes, P. van ‘t Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. SIAM Journal on Discrete Mathematics, 27(4):2143-2156, 2013.
Extended abstract in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science – FSTTCS. Number 13 of Leibnitz International Proceedings in Informatics, page 217-228, 2011.
See also arXiv:1102.5441, 2011.

[46] E. Gioan and C. Paul. Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs. Discrete Applied Mathematics, 160(6):708-733, 2012. 
Extended abstract: Dynamic distance hereditary graphs using split decomposition. In International Symposium on Algorithms and Computation – ISAAC, number 4835 in Lecture Notes in Computer Science, pages 41-51, 2007.
See also arXiv:0810.1823, 2008.

[45] P. Gambette, V. Berry and C. Paul. Quartet and unrooted phylogenetic networks. Journal of Bioinformatics and Computational Biology, 10(4):23 pages, 2012.

[44]  S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomassé. Kernels for feedback arc set in tournaments. Journal of Computer and System Science, 77(6):1071-1078, 2011.
Extended abstract in International Workshop On Combinatorial Algorithms – FSTTCS. Number 4 in Leibnitz International Proceedings in Informatics, pages 37-47, 2009.
See also arXiv:0907.2165, 2009.

[43] C. Paul, M. Habib. Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science – WG’09. Revised Papers. Number 5911 of Lecture Notes in Computer Science, 2010

[42] P. Heggernes, D. Lokshtanov, J. Nederlof, C. Paul and J.A. Telle. Generalized graph clustering : recognizing (p,q)-cluster. In International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 6410 in Lecture Notes in Computer Science, pages 171-183, 2010.

[41] M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides and  N. Yu. Milling a graph with turn costs : a parameterized complexity perspective. In International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 6410 in Lecture Notes in Computer Science, pages 123-134, 2010. 
See also arXiv:0912.1050, 2009.

[40] C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Algorithmica, 58(2):405-432, 2010.
Extended abstract in International Workshop on Graph Theoretical Concepts in Computer Science- WG, number 3787 in Lecture Notes in Computer Science, pages 38-48, 2005.

[39] M. Habib and C. Paul. A survey on algorithmic aspects of modular decomposition. Computer Science Review, 4(1):41-59, 2010.
See also arXiv:0912.1457, 2009.

[38] S. Bessy and C. Paul and A. Perez. Polynomial kernels for 3-leaf power graph modification problems. Discrete Applied Mathematics, 158(16):1732-1744, 2010.
Extended abstract in International Workshop On Combinatorial Algorithms – IWOCA. Number 5874 in Lecture Notes in Computer Science, pages 72-80, 2009.
See also arXiv:0809.2858, 2009.

[37] D.H. Huson, R. Rupp, V. Berry, P. Gambette, C. Paul. Computing galled networks from real data. In International Conference on Intelligent Systems for Molecular Biology – ISMB, Bioinformatics, 25(12), 2009.

[36] P. Gambette, V. Berry and C. Paul. The structure of level-k phylogenetic networks. In Annual Symposium on Combinatorial Pattern Matching – CPM. Number 5577 in Lecture Notes in Computer Science, pages 289-300, 2009. 

[35] S. Durocher, C. Paul. Kinetic maintenance of mobile k-centres on trees. Discrete Applied Mathematics, 157(7):1432-1446, 2009.
Extended abstract in International Symposium on Algorithms and Computation – ISAAC, number 4825 in Lecture Notes in Computer Science, pages 341-352, 2007.

[34] 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, 157(7):1555-1570, 2009.
See also arXiv:0802.2736,  2008.

[33] C. Paul and J.A. Telle. Branchwidth of chordal graphs. Discrete Applied Mathematics, 157(12):2718-2725, 2009.

[32] C. Paul and J.A. Telle. Edge maximal graphs of branchwidth k : the k-branches. Discrete Mathematics, 309(6):1467-1475, 2009.
Extended abstract: New Tools and Simpler Algorithms for Branchwidth. In European Symposium on Algorithms – ESA, number 3669 in Lecture Notes in Computer Science, pages 379-390, 2005.

[31] Y. Villanger, P. Heggerness, C. Paul and J.A. Telle. Interval completion is fixed parameter tractable. In SIAM Journal on Computing, 38(5):2007-2020 , 2009.
Extended abstract in ACM Symposium on Theory of Computing – STOC, pages 347-381, 2007.

[30] S. Bérard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Computation of perfect DCJ rearrangement with linear and circular chromosomes. In Journal of Computational Biology, 16(10) :1287-1309, 2009.
Extend abstract: Perfect DCJ rearrangement. In Annual RECOMB Satellite Workshop on Comparative Genomic – RECOMB-CG. Number 5267 in Lecture Notes in Bioinformatics, pages 156-167, 2008. 

[29] D. Bremner, J. Lenchner, G. Liotta, C. Paul, M. Pouget, S. Stolpner, S. Wismath. A note on α-drawable k-trees. In Canadian Conference on Computational Geometry – CCCG. 2008.

[28] V. Berry, S. Guillemot, F. Nicolas and C. Paul. Linear time 3-approximation for MAST problem. ACM Transcations on Algorithms, 5(2):1-18, 2009.
Extended abstract: On the Approximation of Computing Evolutionary Trees. International Computing and Combinatorics Conference – COCOON, number 3595 in Lecture Notes in Computer Science, pages 115-125, 2005.

[27] B.M. Bui Xuan and M. habib and C. Paul. Competitive Graph Searches. Theoretical Computer Science, 393(1-3):72-80, 2008.

[26] S. Bérard, C. Chauve and C. Paul. A more efficient algorithm for perfect sorting by reversals. Information Processing Letters, 106:90-95, 2008.

[25] C. Gavoille and C. Paul. Optimal Distance Labeling for Interval and Circular-Arc Graphs. SIAM Journal on Discrete Mathematics, 22(3) :1239-1258, 2008.
Extended abstract in Annual European Symposium on Algorithms – ESA, number 2832 in Lecture Notes in Computer Science, pages 254-265, 2003.

[24] A. Bretscher, D. Corneil, M. Habib and C. Paul. A simple linear time LexBFS cograph recognition algorithm. SIAM Journal on Discrete Mathematics, 22(4) :1277-1296, 2008.
Extended abstract in International Workshop on Graph-Theoretic Concepts in Computer Science – WG, number 2880 in Lecture Notes in Computer Science, pages 119-130, 2003. 

[23] M. Habib, D. Kelly, E. Lebhar and C. Paul. Can transitive orientation make sandwich problems easier ? Discrete Mathematics, 307:2030-2041, 2007.

[22] A. Bergeron, S. Bérard, C. Chauve, and C. Paul. Sorting by Intervals with Common Intervals is not Always Difficult. IEEE-ACM Transaction on Computational Biology and Bioinformatics, 4(1):4-16, 2007.
Extended abstract in International Workshop on Algorithm in Bioinformatics – WABI. Number 3692 in Lecture Notes in Bioinformatics, pages 228-238, 2005.

[21] C. Paul, A. Proskurowski and J.A. Telle. Algorithmic generation of graphs of branchwidth <= k. In International Workshop on Graph Theoretical Concepts in Computer Science – WG, number 4271 in Lecture Notes in Computer Science, pages 206-216, 2006.

[20] C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. Discrete Applied Mathematics, 154(12):1722-1741, 2006.
Extended abstract in International Workshop on Graph Theoretical Concepts in Computer Science – WG, number 3353 in Lecture Notes in Computer Science, pages 93-104, 2004.

[19] P. Fraigniaud and C. Gavoille and C. Paul. Eclecticism Shrinks Even Small Worlds. Journal of Distributed Computing, 18(4):279-291, 2006.
Extended abstract in Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing – PODC, pages 168-178, 2004.

[18] B.M. Bui Xuan, M. Habib and C. Paul. Revisiting Uno and Yagiura’s Algorithm. In International Symposium on Algorithms and Computation- ISAAC, number 3827 in Lecture Notes in Computer Science, pages 146–155, 2005.

[17] C. Paul, J.A. Telle. Edge-maximal graphs of branchwidth k. In International Colloquium on Graph Theory – ICGT. Electronic Notes in Discrete Mathematics, 22: 363-368, 2005.

[16] M. Habib and C. Paul. A Simple Linear Time Algorithm for Cograph Recongition. Discrete Applied Mathematics, 145(2):183-197, 2005.

[15] M. Habib, C. Paul and M. Raffinot. Common connected Components of Interval Graphs. In Annual Combinatorial Pattern Matching Symposium – CPM, number 3109 in Lecture Notes in Computer Science, pages 347-358, 2004.

[14] M. Habib, F. de Montgolfier and C. Paul. A simple linear-time modular decomposition algorithm. In  Scandinavian Workshop on Algorithm Theory – SWAT, number 3111 in Lecture Notes in Computer Science, pages 187-198, 2004.
There is a flaw in the algorithm presented in that paper.

[13] M. Bouklit and D. Coudert and J.-F. Lalande and C. Paul and H. Rivano. Approximate multicommodity flow for WDM networks design. In International Colloquium on Structural Information Complexity – SIROCCO, number 17 of Proceedings in Informatics, Carleton Scientific, pages 43-56,  2003.

[12] C. Gavoille and C. Paul. Distance labeling and split decomposition. Discrete Mathematics, 273(1-3):115-130, 2003.

[11] M. Habib and E. Lebhar and C. Paul. A note on finding all homogeneous set sandwiches. Information Processing Letters, 87:147-151, 2003.

[10] D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. Discrete Applied Mathematics, 113(2-3):143-166, 2001.
Extended abstract in International Workshop Graph-Theoretic Concepts in Computer Science – WG, volume 1517 of Lecture Notes in Computer Science, pages 192-202, 1998.

[9] M. Habib, C. Paul, and L. Viennot. Linear time recognition of P4-indifference graphs. Discrete Mathematics and Theoretical Computer Science, 4(2):173-178, 2001. Special issue: Graph Decomposition.

[8] C. Gavoille, C. Paul. Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. In Euroconference on Combinatorics, Graph Theory and Applications – EuroComb. Electronic Notes in Discrete Mathematics, 10:117-120, 2001.

[7] G. Damiand, M. Habib, and C. Paul. A simple paradigm for graph recognition : application to cographs and distance hereditary graphs. Theoretical Computer Science, 263:99-111, 2001. 

[6] C. Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate distance labeling scheme. In Annual European Symposium on Algorithms – ESA, number 2161 in Lecture Notes in Computer Science, pages 476-487. 9th , 2001.

[5] C. Gavoille, C. Paul. Approximate Distance Labeling Schemes. In International Conference on Graph Theory – ICGT. Electronic Notes in Discrete Mathematics, 5: 134-137, 2000.

[4] 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. Theoretical Computer Science, 234:59-84, 2000.

[3] M. Habib, C. Paul, and L. Viennot. Partition refinement: an interested algorithmic tool kit. International Journal of Foundation of Computer Science, 10(2):147-170, 1999

[2] M. Habib, C. Paul, and L. Viennot. A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In International Symposium on Theoretical Aspect of Computer Science – STACS, number 1373 in Lecture Notes in Computer Science, pages 25-38, 1998.

[1] P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. In International Workshop on Graph-Theoretic Concepts in Computer Science – WG, volume 1017 of Lecture Notes in Computer Science, pages 358-371, 1995.