Documentation
Français (FR)

Anglais (EN)

Christophe Paul

11

Documents

Publications

889063

	Edge Maximal Graphs of Branchwidth k: The k-Branches Christophe Paul , Jan Arne Telle Discrete Mathematics, 2009, 309 (6), pp.1467-1475. ⟨10.1016/j.disc.2008.02.030⟩ Article dans une revue lirmm-00371208v1
	Branchwidth of Chordal Graphs Christophe Paul , Jan Arne Telle Discrete Applied Mathematics, 2009, 157 (12), pp.2718-2725. ⟨10.1016/j.dam.2008.08.006⟩ Article dans une revue lirmm-00394553v1
	Interval completion is Fixed Parameter Tractable Yngve Villanger , Pinar Heggernes , Christophe Paul , Jan Arne Telle SIAM Journal on Computing, 2009, 38 (5), pp.2007-2020. ⟨10.1137/070710913⟩ Article dans une revue lirmm-00371876v1
	Edge-Maximal Graphs of Branchwidth $k$ Christophe Paul , Jan Arne Telle Electronic Notes in Discrete Mathematics, 2005, 22 (7th International Colloquium on Graph Theory), pp.363-368. ⟨10.1016/j.endm.2005.06.075⟩ Article dans une revue lirmm-00106051v1

	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
	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
	Generalized Graph Clustering: Recognizing (p,q)-Cluster Pinar Heggerness , Daniel Lokshtanov , Jesper Nederlof , Christophe Paul , Jan Arne Telle WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12 Communication dans un congrès lirmm-00533520v1
	Interval Completion with Few Edges Pinar Heggerness , Christophe Paul , Jan Arne Telle , Yngve Villanger STOC'07: 39th ACM Symposium on Theory of Computing, Jun 2007, San Diego, CA, United States. pp.374-381, ⟨10.1145/1250790.1250847⟩ Communication dans un congrès lirmm-00189511v1
	Algorithmic Generation of Graphs of Branch-width ≤ k Christophe Paul , Andrzej Proskurowski , Jan Arne Telle WG 2006 - 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2006, Bergen, Norway. pp.206-216, ⟨10.1007/11917496_19⟩ Communication dans un congrès lirmm-00324551v1
	New Tools and Simpler Algorithms for Branchwidth Christophe Paul , Jan Arne Telle ESA 2003 - 13rd Annual European Symposium on Algorithms, Oct 2005, Palma de Mallorca, Spain. pp.379-390, ⟨10.1007/11561071_35⟩ Communication dans un congrès lirmm-00106466v1
	A Linear-Time Algorithm for Recognition of Catval Graphs Michel Habib , Christophe Paul , Jan Arne Telle EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic Communication dans un congrès lirmm-00269443v1