Conference papers
[C58] 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.
[C57] 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, page 55:1-55:18, 2024.
[C56] 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.
[C55] M.M. KantĂ©, C. Paul, D.M. Thilikos. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. In Annual European Symposium on Algorithms – ESA. Number 173 of Leibnitz International Proceedings in Informatics, pages 64:1-64:16, 2020.
[C54] 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.
[C53] I. Adler, C. Paul, D.M. Thilikos. Connected Search for a Lazy Robber. 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.
[C52] J. Baste, D. GözĂŒpek, C. Paul, I. Sau, M. Shalom and D.M. Thilikos. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. In International Symposium on Parameterized and Exact Computation – IPEC. Number 89 of Leibnitz International Proceedings in Informatics, page 3:1-3:12, 2017.
[C51] F. Barbero, C. Paul and M. Pilipczuk. Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. In International Colloquim on Automata, Languages, and Programming – ICALP. Number 80 of Leibnitz International Proceedings in Informatics, page 70:1-70:13, 2017.
[C50] M. Jones, C. Paul and C. Scornavacca. On the consistency of orthology relationships. In RECOMB Comparative Genomics Satellite Workshop â RECOMB-CG. In BMC Bionformatics, 17(S-14) :251-262, 2016.
[C49] D. GözĂŒpek, S. Ăzkan, C. Paul, I. Sau, M. Shalom. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. In International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 9941 of Lecture Notes in Computer Science , page 195-206, 2016.
[C48] J. Baste, C. Paul, I. Sau and C. Scornavacca. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. In International Conference on Algorithmic Aspects in Information and Management – AAIM. Number 9778 of Lecture Notes in Computer Science , page 53-64, 2016.
[C47] 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.
[C46] 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.
[C45] E.J. Kim, C. Paul, I. Sau and D.M. Thilikos. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. In International Symposium on Parameterized and Exact Computation – IPEC. Number 43 of Leibnitz International Proceedings in Informatics, page 78-89, 2015.
[C44] E.J. Kim, S.I. Oum, C. Paul, I. Sau and D.M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. In Workshop on Approximation and Online Algorithms – WAOA. Number 9499 of Lecture Notes in Computer Science , page 35-46, 2015.
[C43] 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. In International workshop on Graph Theoretical Concepts in Computer Science – WG. Number 8747 of Lecture Notes in Computer Science , page 201-213, 2015.
[C42] P. Golovach, P. Heggernes, P. Vanât Hof and C. Paul. Hadwiger Number of Graphs with Small Chordality. In Workshop on Approximation and Online Algorithms – WAOA. Number 9499 of Lecture Notes in Computer Science , page 158-169, 2014.
[C41] V. Garnero, C. Paul, I. Sau, and D.M. Thilikos. Explicit linear kernels via dynamic programming. In Symposium on Theoretical Aspect of Computer Science – STACS. Number 25 of Leibnitz International Proceedings in Informatics, page 312-324, 2014.
[C40] 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. In International Colloquim on Automata, Languages, and Programming – ICALP. Number 7965 of Lecture Notes in Computer Science , page 613-624, 2013.
[C39] N. Bousquet, G. Mertzios, C. Paul, I. Sau and S. ThomassĂ©. Parameterized domination in circle graphs. In International Workshop on Graph Theoretical Concepts in Computer Science – WG. Number 7551 of Lecture Notes in Computer Science , page 308-319, 2012.
[C38] E.J. Kim, C. Paul and G. Philip. Parameterized K4-cover in single exponential time. In Scandinavian Workshop On Algorithmic Theory – SWAT. Number 7357 of Lecture Notes in Computer Science , page 119-130, 2012.
[C37] P. Heggernes, P. van’t Hof, D. Lokshtanov and C. Paul. Obtaining a bipartite graph by contracting few edges. 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.
[C36] P. Heggernes, P. van’t Hof, B. LĂ©vĂȘque, D. Lokshtanov and C. Paul. Contracting graphs to paths and trees. In International Symposium on Parameterized and exact Computation – IPEC. Number 7112 of Lecture Notes in Computer Science , page 55-66, 2011.
[C35] P. Heggernes, P. vanât Hof, B. LĂ©vĂȘque and C. Paul. Contracting chordal graphs and bipartite graphs to paths and trees. In Latin-American Algorithms, Graphs, and Optimization Symposium â LAGOS, Electronic Notes in Discrete Mathematics, 37:87-92, 2011.
[C34] G. Joret, C. Paul, I. Sau, S. Saurabh and S. ThomassĂ©. Hitting and harvesting pumpkins. In European Symposium on Algorithms – ESA. Number 6942 of Lecture Notes in Computer Science , page 394-407, 2011.
[C33] C. Paul, A. Perez and S. ThomassĂ©. Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem. In Mathematical Foundations of Computer Science – MFCS. Number 6907 of Lecture Notes in Computer Science , page 497-507, 2011.
[C32] 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.
[C31] 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.
[C30] 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.
[C29] 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.
[C28] 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.
[C27] 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.
[C26] S. BĂ©rard, A. Chateau, C. Chauve, C. Paul and E. Tannier. Perfect DCJ rearrangement. In Annual RECOMB Satellite Workshop on Comparative Genomic – RECOMB-CG. Number 5267 in Lecture Notes in Bioinformatics, pages 156-167, 2008.
[C25] 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.
[C24] 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.
[C23] 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.
[C22] 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.
[C21] P. Heggerness, C. Paul, J.A. Telle and Y. Villanger. Interval completion with few edges. In ACM Symposium on Theory of Computing – STOC, pages 347-381, 2007.
[C20] 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.
[C19] 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.
[C18] 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.
[C17] 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.
[C16] 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.
[C15] V. Berry, S. Guillemot, F. Nicolas and C. Paul. On the Approximation of Computing Evolutionary Trees. In International Computing and Combinatorics Conference – COCOON, number 3595 in Lecture Notes in Computer Science, pages 115-125, 2005.
[C14] C. Crespelle and C. Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. In International Workshop on Graph Theoretical Concepts in Computer Science- WG, number 3787 in Lecture Notes in Computer Science, pages 38-48, 2005.
[C13] 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.
[C12] 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.
[C11] C. Crespelle and C. Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. In International Workshop on Graph Theoretical Concepts in Computer Science – WG, number 3353 in Lecture Notes in Computer Science, pages 93-104, 2004.
[C10] P. Fraigniaud, C. Gavoille and C. Paul. Eclecticism Shrinks Even Small World. In Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing – PODC, pages 168-178, 2004.
[C9] C. Gavoille and C. Paul. Optimal Distance Labeling Scheme for Interval and Circular-arc Graphs. In Annual European Symposium on Algorithms – ESA, number 2832 in Lecture Notes in Computer Science, pages 254-265, 2003.
[C8] A. Bretscher and D.G. Corneil and M. Habib and C. Paul. A Simple Linear Time LexBFS Cograph Recognition Algorithm. In International Workshop on Graph-Theoretic Concepts in Computer Science – ESA, number 2880 in Lecture Notes in Computer Science, pages 119-130, 2003.
[C7] 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.
[C6] 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.
[C5] 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.
[C4] C. Gavoille, C. Paul. Approximate Distance Labeling Schemes. In International Conference on Graph Theory â ICGT. Electronic Notes in Discrete Mathematics, 5: 134-137, 2000.
[C3] D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. International Workshop Graph-Theoretic Concepts in Computer Science â WG, volume 1517 of Lecture Notes in Computer Science, pages 192-202, 1998.
[C2]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.
[C1] 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.
