# Publications

Home | Research | Publications | Talks | TeachingVitae

Journal papers
Conference papers
Books and book chapters
Thesis

## ^ Journal papers

[J48] F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. To appear in ACM Transactions on Algorithmics, 2018.

[J47] E.J. Kim, S.I. Oum, C. Paul, I. Sau and D. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica, 80(1):116,135, 2018. [DOI]

[J46] 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. [DOI]

[J45] N. Cohen, D. Gonçalves, E.J. Kim, C. Paul, I. Sau, D. Thilikos and M. Weller. A polynomial-time algorithm for outerplanar diameter improvement. Journal of Computer and System Science, 89:315-327, 2017. [DOI]

[J44] 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. [DOI]

[J43] E.J. Kim, C. Paul, I. Sau and D. Thilikos. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Science, 86:191-206, 2017. [DOI]

[J42] C. Paul, A. Perez and S. Thomassé. Conflict packing : a unifying technique to obtain polynomial kernel for editing problems on dense instances. Journal of Computer and System Science, 82(2) :366-379, 2016. [DOI]

[J41] 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. [DOI]

[J40] 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. [DOI]

[J39] P. Golovach, P. Heggernes, P. van't Hof and C. Paul. Hadwiger number of graphs with small chordality. Discrete Applied Mathematics, 29(3) :1427-1451, 2015. [DOI]

[J38] 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. [DOI] See also arXiv:1204.1417

[J37] 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. See also arXiv:1105.2704

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

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

[J34] 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. [DOI]

[J33] 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. [DOI]. See also arXiv:1205.3728

[J32] P. Heggernes P. van 't Hof, B. Lévque, D. Lokshtanov and C. Paul. Contracting chordal graphs to paths and trees. Algorithmica, 68(1):109-132, 2014. See also arXiv:1104.3677

[J31] 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. See also arXiv:1102.5441

[J30] 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.

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

[J28] 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, 2011. See also arXiv:0810.1823

[J27] 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.

[J26] 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.

[J25] C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Algorithmica, 58(2):405-432, 2010.
[ pdf file ]

[J24] M. Habib and C. Paul. A survey on algorithmic aspects of modular decomposition. Computer Science Review, 4(1):41-59, 2010.
[ pdf file ]

[J23] S. Bérard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Computation of perfect DCJ rearrangement with linear and circular chromosomes. Journal of Computational Biology, 16(10):1287-1309, 2009.
[ pdf file ]

[J22] 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.

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

[J20] 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. [DOI]

[J19] Y. Villanger, P. Heggerness, C. Paul and J.A. Telle. Interval completion with few edges. SIAM Journal on Computing, 38(5), 2009. [DOI]

[J18] C. Paul and J.A. Telle. Edge maximal graphs of branchwidth k : the k-branches. Discrete Mathematics, 309(6):1467-1475, 2009. [DOI]

[J17] Stephane Durocher, Christophe Paul. Kinetic maintenance of mobile k-centres on trees. Discrete Applied Mathematics, 157(7):1432-1446, 2009. [DOI]

[J16] 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.
[ pdf file ]

[J15] C. Gavoille and C. Paul. Optimal Distance Labeling for Interval and Circular-Arc Graphs. SIAM Journal on Discrete Mathematics, 22(3) :1239-1258, 2008.
[ pdf file ]

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

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

[J12] M. Habib, D. Kelly, E. Lebhar and C. Paul. On poset Sandwich Problems. Discrete Mathematics, 307:2030-2041, 2007.
[ pdf file ]

[J11] A. Bergeron, S. Bérard, C. Chauve, and C. Paul. Sorting by Intervals with Common Intervals is not Always Difficult. In IEEE-ACM Transaction on Computational Biology and Bioinformatics, 4(1):4-16, 2007.

[J10] C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. Discrete Applied Mathematics>, 154(12):1722-1741, 2006.
[pdf file ]

[J9] P. Fraigniaud and C. Gavoille and C. Paul. Eclecticism Shrinks Even Small Worlds. In Journal of Distributed Computing, 18(4):279-291, 2006.
[ pdf file ]

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

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

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

[J5] D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. Discrete Applied Mathematics, 113(2-3):143-166, 2001.
[ bib | postscript file ]

[J4] G. Damiand, M. Habib, and C. Paul. A simple paradigm forgraph recognition : application to cographs and distance hereditary graphs. Theoretical Computer Science, 263:99-111, 2001.
[ bib | postscript file ]

[J3] 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.
[ bib | postscript file ]

[J2] 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.
[ bib | postscript file ]

[J1] 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.
[ bib | postscript file ]

## ^ Conference papers

[C56] J. Baste, D. Gözüpek, C. Paul, Ignasi Sau, M. Shalom and D. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. International Symposium on Parameterized and Exact Computation - IPEC. Number 89 of Leibnitz International Proceedings in Informatics, page 3:1-3:12, 2017.

[C55] F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. International Colloquim on Automata, Languages, and Programming - ICALP. Number 80 of Leibnitz International Proceedings in Informatics, page 70:1-70:13, 2017

[C54] D. Gözüpek, S. Özkan, C. Paul, I. Sau, M. Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Graph Theoretical Concepts in Computer Science - WG. Number 9941 of Lecture Notes in Computer Science , page 195-206, 2016.

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

[C52] J. Baste, C. Paul, I. Sau and C. Scornavacca. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. International Conference on Algorithmic Aspects in Information and Management - AAIM. Number 9778 of Lecture Notes in Computer Science , page 53-64, 2016.

[C51] S. Bessy, M. Bougeret, D. Gonçalves and C. Paul. On independent set on B1-EPG graphs. Workshop on Approximation and Online Algorithms - WAOA. Number 9499 of Lecture Notes in Computer Science , page 158-169, 2015.

[C50] E.J. Kim, M. Kanté, O.J. Kwon and C. Paul. An FPT algorithm and a polynomial kernel for Linear Rankwidth One Vertex Deletion. International Symposium on Parameterized and Exact Computation - IPEC. Number 43 of Leibnitz International Proceedings in Informatics, page 138-150, 2015.

[C49] E.J. Kim, C. Paul, I. Sau and D. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. International Symposium on Parameterized and Exact Computation - IPEC. Number 43 of Leibnitz International Proceedings in Informatics, page 78-89, 2015.

[C48] E.J. Kim, S.I. Oum, C. Paul, I. Sau and D. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. Workshop on Approximation and Online Algorithms - WAOA. Number 9499 of Lecture Notes in Computer Science , page 35-46, 2015.

[C47] N. Cohen, D. Gonçalves, E.J.Kim, C. Paul, I. Sau, D. Thilikos and N. Cohen. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Graph Theoretical Concepts in Computer Science - WG. Number 8747 of Lecture Notes in Computer Science , page 201-213, 2015.

[C46] P. Golovach, P. Heggernes, P. Van’t Hof and C. Paul. Hadwiger Number of Graphs with Small Chordality. Workshop on Approximation and Online Algorithms - WAOA. Number 9499 of Lecture Notes in Computer Science , page 158-169, 2014.

[C45] C. Crespelle, E. Gioan and C. Paul. Recognition of dynamic circle graphs. International Conference on Graph Theory - ICGT, 2014.

[C44] V. Garnero, C. Paul, I. Sau, and D. Thilikos. Explicit linear kernels via dynamic programming. Symposium on Theoretical Aspect of Computer Science - STACS. Number 25 of Leibnitz International Proceedings in Informatics, page 312-324, 2014.

[C43] 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. International Colloquim on Automata, Languages, and Programming - ICALP. Number 7965 of Lecture Notes in Computer Science , page 613-624, 2013.

[C42] N. Bousquet, G. Mertzios, C. Paul, I. Sau and S. Thomassé. Parameterized domination in circle graphs. Graph Theoretical Concepts in Computer Science - WG. Number 7551 of Lecture Notes in Computer Science , page 308-319, 2012.

[C41] E.J. Kim, C. Paul and G. Philip. Parameterized K4-cover in single exponential time. Scandinavian Workshop On Algorithmic Theory - SWAT. Number 7357 of Lecture Notes in Computer Science , page 119-130, 2012.

[C40] P. Heggernes, P. van't Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. 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.

[C39] P. Heggernes, P. van't Hof, B. Lévêque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. International Symposium on Parameterized and exact Computation - IPEC. Number 7112 of Lecture Notes in Computer Science , page 55-66, 2011.

[C38] G. Joret, C. Paul, I. Sau, S. Saurabh and S. Thomassé. Hitting and harvesting pumpkins. European Symposium on Algorithms - ESA. Number 6942 of Lecture Notes in Computer Science , page 394-407, 2011.

[C37] Paul, A. Perez and S. Thomassé. 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.

[C36] Heggernes, P. van't Hof, B. Lévêque and C. Paul. Contracting chordal graphs and bipartite graphs to paths and trees. Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Number 37 of Electronic Notes in Discrete Mathematics, page 87-92, 2011.
[C35] S. Guillemot, C. Paul and A. Perez. On the (non-)existence of polynomial kernels for Pl -free edge modiﬁcation problems. In International Symposium on Parameterized and Exact Computation - IPEC. Number 6478 in Lecture Notes in Computer Science, pages 147-157, 2010.

[C34]
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 Graph Theoretical Concepts in Computer Science - WG. Number 6410 in Lecture Notes in Computer Science, pages 123-134, 2010.

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

[C32]
S. Bessy and F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh and S. Thomassé. Kernels for Feedback Arc Set In Tournaments. In International Workshop On Combinatorial Algorithms - FSTTCS. Number 4 in Leibnitz International Proceedings in Informatics, pages 37-47, 2009.

[C31] S. Bessy and C. Paul and A. Perez. Polynomial kernels for 3-leaf power graph modiﬁcation problems. In International Workshop On Combinatorial Algorithms - IWOCA. Number 5874 in Lecture Notes in Computer Science, pages 72-80, 2009.

[C30] 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.

[C29] S. Bérard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Perfect DCJ rearrangement. In Annual RECOMB Satellite Workshop on Comparative Genomic - RCG. Number 5267 in Lecture Notes in Bioinformatics, pages 156-167, 2008.

[C28] 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.

[C27] M. Tedder, D. Corneil, M. Habib and C. Paul. 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.
[ pdf file ]

[C26] E. Gioan and C. Paul. 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.
pdf file ]

[C25]
S. Durocher and C. Paul. Kinetic maintenance of mobile k-centre in trees. In International Symposium on Algorithms and Computation - ISAAC, number 4825 in Lecture Notes in Computer Science, pages 341-352, 2007.
pdf file ]

[C24] P. Heggerness, C. Paul,  J.A. Telle and Y. Villanger. Interval completion with few edges. In 39th ACM Symposium on Theory of Computing - STOC, pages 347-381, 2007.
pdf file ]

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

[C22] 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.
pdf file ]

[C21] C. Paul and J.A. Telle. 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.
pdf file ]

[C20] A. Bergeron, S. Bérard, C. Chauve and C. Paul. Sorting by Intervals with Common Intervals is not Always Difficult. In International Workshop on Algorithm in Bioinformatics - WABI, number 3692 in Lecture Notes in Computer Science, pages 228-238, 2005.
[ pdf file ]

[C19] C. Paul and J.A. Telle. Edge-maximal Graphs of Branchwidth $k$ and Graphs with Branchwidth Greater than Treewidth. In International Conference on Graph Theory - ICGT, number 23 in Electronic Notes in Discrete Mathematics, pages 363-368, 2005.
pdf file ]

[C18] V. Berry, S. Guillemot, F. Nicolas and C. Paul. On the Approximation of Computing Evolutionary Trees. In 11th International Computing and Combinatorics Conference - COCOON, number 3595 in Lecture Notes in Computer Science, pages 115--125, 2005.
pdf file ]

[C17] C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. In 31st International Workshop on Graph Theoretical Concepts in Computer Science - WG, number 3787 in Lecture Notes in Computer Science, pages 38--48, 2005.
[ pdf file ]

[C16] M. Habib, F. de Montgolfier and C. Paul. A simple linear-time modular decomposition algorithm. 9th Scandinavian Workshop on Algorithm Theory - SWAT, number 3111 in Lecture Notes in Computer Science, pages 187-198, 2004.
[ pdf file ]

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

[C14] C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. In 30th International Workshop on Graph Theoretical Concepts in Computer Science - WG, number 3353 in Lecture Notes in Computer Science, pages 93--104, 2004.
pdf file ]

[C13] P. Fraigniaud, C. Gavoille and C. Paul. Eclecticism Shrinks Even Small World. In 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - PODC, pages 168--178, 2004.
[ pdf file ]

[C12] C. Gavoille and C. Paul. Optimal Distance Labeling Scheme for Interval and Circular-arc Graphs. In G. Di Battista and U. Zwich, editor, Algorithms - ESA number 2832 in Lecture Notes in Computer Science, pages 254--265. 11th Annual European Symposium on Algorithms, 2003.
[ bib | postscript file ]

[C11] M. Habib and D. Kelly and E. Lebhar and C. Paul. On poset Sandwich Problems. In European Conference on Combinatorics, Graphs Theory and Applications, Pragues, EuroComb 2003.

[C10] M. Habib and C. Paul and J.A. Telle. A linear-time algorithm for recognition of catval graphs. In European Conference on Combinatorics, Graphs Theory and Applications, Pragues, EuroComb 2003.
[ bib | postscript file ]

[C9] A. Bretscher and D.G. Corneil and M. Habib and C. Paul. A Simple Linear Time LexBFS Cograph Recognition Algorithm. In H. Bodlaender, editor, Graph-Theoretic Concepts in Computer Science - WG, number 2880 in Lecture Notes in Computer Science, pages 119-130, 2003.

[C8] M. Bouklit and D. Coudert and J.-F. Lalande and C. Paul and H. Rivano. Approximate multicommodity flow for WDM networks design. SIROCCO 10, number 17 of Proceedings in Informatics, Carleton Scientific, pages 43--56. June 2003.
[ bib | pdf file ]

[C7] Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate distance labeling scheme. In Meyer auf der Heide, editor, Algorithms - ESA 2001, number 2161 in Lecture Notes in Computer Science, pages 476-487. 9th Annual European Symposium on Algorithms, 2001.
[ bib | postscript file ]

[C6] C. Gavoille and C. Paul. Split decomposition and distance labelling: An optimal scheme for distance hereditary graph. In Euroconference on Combinatorics, Graph Theory and Applications, COMB'01, volume 10 of Electronique Notes on Discrete Mathematics, 2001.
[ bib | postscript file ]

[C5] C. Gavoille and C. Paul. Approximate distance labeling scheme. In 6th International Conference on Graph Theory, IGCT, volume 5 of Electronique Notes on Discrete Mathematics, 2000.
[ bib | postscript file ]

[C4] D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. In Graph-Theoretic Concepts in Computer Science, WG'98, volume 1517 of Lecture Notes in Computer Science. 24st Internationnal Workshop WG'98, 1998.
[ bib | postscript file ]

[C3] M. Habib, C. Paul, and L. Viennot. A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In STACS 98, number 1373 in LNCS, pages 25-38. 15th Symposium on Theoretical Aspect of Computer Science, 1998.
[ bib | postscript file ]

[C2] P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. In M. Nagl (Ed.), editor, Graph-Theoretic Concepts in Computer Science, WG'95, volume 1017 of Lecture Notes in Computer Science, pages 358-371, Aachen, Germany, June 1995. 21st Internationnal Workshop WG'95, Springer.
[ bib | postscript file ]

[C1] P. Galinier, M. Habib, and C. Paul. Maximal intersection search: a new algorithm for chordal graph recognition. Technical Report 95044, LIRM Montpellier, October 1995.
[ bib | postscript file ]

## ^ Books and book chapters

[B1] C. Paul and M. Habib. International Workshop on Theoretic Concepts in Computer Science - WG, number 5911 of Lecture Notes in Computer Science, 2010.

[B2] C. Paul. Complexité et algorithmes paramétrés. In Informatique mathématique, une photographie en 2013, P. Langlois Ed., Presses Universitaires de Perpignan, 2013.

[B3] C. Paul. Split decomposition, circle graphs and related graph families. In Encyclopedia of Algorithms, Ming-Yang Kao editor, Springer, 2015. [DOI]

## ^ Dissertations

[D2] C. Paul. Aspects algorithmiques de la décomposition modulaire.  Habilitation à diriger des recherches, Université de Montpellier 2, France, 2006.
[ pdf file ]

[D1] C. Paul. Parcours en largeur lexicographique : un algorithme de partitionnement, application aux graphes et généralisation. PhD thesis, LIRMM, Université de Montpellier II, 1998.
[ bib | postscript file ]