Documentation
Français (FR)

Anglais (EN)

Christophe Paul

17

Documents

Publications

42363

	The mixed search game against an agile and visible fugitive is monotone Guillaume Mescoff , Christophe Paul , Dimitrios M. Thilikos Discrete Mathematics, 2023, 346 (4), pp.113345. ⟨10.1016/j.disc.2023.113345⟩ Article dans une revue hal-04042958v1
	A polynomial time algorithm to compute the connected treewidth of a series–parallel graph Guillaume Mescoff , Christophe Paul , Dimitrios M. Thilikos Discrete Applied Mathematics, 2022, 312, pp.72-85. ⟨10.1016/j.dam.2021.02.039⟩ Article dans une revue lirmm-03676663v1
	A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth Mamadou Moustapha Kanté , Christophe Paul , Dimitrios M. Thilikos SIAM Journal on Discrete Mathematics, 2022, 36 (1), pp.411-435. ⟨10.1137/20M1369361⟩ Article dans une revue hal-03771145v1
	Connected search for a lazy robber Isolde Adler , Christophe Paul , Dimitrios M. Thilikos Journal of Graph Theory, 2021, 97 (4), pp.510-552. ⟨10.1002/jgt.22669⟩ Article dans une revue hal-03327307v1
	Edge degeneracy: Algorithmic and structural results Stratis Limnios , Christophe Paul , Joanny Perret , Dimitrios M. Thilikos Theoretical Computer Science, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩ Article dans une revue hal-03001062v1
	Parameterized complexity of finding a spanning tree with minimum reload cost diameter Julien Baste , Didem Gözüpek , Christophe Paul , Ignasi Sau , Mordechai Shalom Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩ Article dans une revue lirmm-02989889v1
	Strong immersion is a well-quasi-ordering for semicomplete digraphs Florian Barbero , Christophe Paul , Michał Pilipczuk Journal of Graph Theory, 2019, 90, pp.484-496. ⟨10.1002/jgt.22408⟩ Article dans une revue lirmm-01918986v1
	Explicit Linear Kernels for Packing Problems Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos Algorithmica, 2019, 81 (4), pp.1615-1656. ⟨10.1007/s00453-018-0495-5⟩ Article dans une revue lirmm-02342736v1
	Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs Florian Barbero , Christophe Paul , Michał Pilipczuk ACM Transactions on Algorithms, 2018, 14 (3), pp.#38. ⟨10.1145/3196276⟩ Article dans une revue lirmm-01919000v1
	An FPT 2-Approximation for Tree-Cut Decomposition Eun Jung Kim , Sang-Il Oum , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos Algorithmica, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩ Article dans une revue hal-01690385v1

	On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters Svein Høgemo , Benjamin Bergougnoux , Ulrik Brandes , Christophe Paul , Jan Arne Telle FCT 2021 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩ Communication dans un congrès lirmm-03867040v1
	A linear fixed parameter tractable algorithm for connected pathwidth Mamadou Moustapha Kanté , Christophe Paul , Dimitrios M. Thilikos ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩ Communication dans un congrès hal-03002761v1
	Hierarchical Clusterings of Unweighted Graphs Svein Hogemo , Christophe Paul , Jan Arne Telle MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.47:1-47:13, ⟨10.4230/LIPIcs.MFCS.2020.47⟩ Communication dans un congrès lirmm-03027532v1
	Connected Search for a Lazy Robber Isolde Adler , Christophe Paul , Dimitrios M. Thilikos FSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩ Communication dans un congrès hal-03003243v1
	Connected tree-width and connected cops and robber game Christophe Paul CAALM 2019 - Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India Communication dans un congrès lirmm-02079017v1
	A polynomial Turing kernel to compute the cut-width of semi-complete digraph Christophe Paul FILOFOCS 2018 - 7th French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France Communication dans un congrès lirmm-02078882v1
	Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Florian Barbero , Christophe Paul , Michał Pilipczuk 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Jul 2017, Warsaw, Poland. pp.70:1--70:13, ⟨10.4230/LIPIcs.ICALP.2017.70⟩ Communication dans un congrès lirmm-02021567v1