Graphs with Large Girth Not Embeddable in the Sphere. - Pierre Charbit; Stéphan Thomassé (Comb. Probab. Comput., 2007)

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. - Pierre Charbit; Stéphan Thomassé; Anders Yeo (Comb. Probab. Comput., 2007)

Infinite Locally Random Graphs. - Pierre Charbit; Alex D. Scott (Internet Math., 2007)

Cyclic orders: Equivalence and duality. - Pierre Charbit; András Sebö (Comb., 2008)

A note on computing set overlap classes. - Pierre Charbit; Michel Habib; Vincent Limouzy; Fabien de Montgolfier; Mathieu Raffinot; Michaël Rao (Inf. Process. Lett., 2008)

Finding a vector orthogonal to roughly half a collection of vectors. - Pierre Charbit; Emmanuel Jeandel; Pascal Koiran; Sylvain Perifel; Stéphan Thomassé (J. Complex., 2008)

A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (CoRR, 2009)

The fractional chromatic number of Zykov products of graphs. - Pierre Charbit; Jean-Sébastien Sereni (Appl. Math. Lett., 2011)

LexBFS, structure and algorithms - Pierre Aboulker; Pierre Charbit; Maria Chudnovsky; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2012)

Detecting 2-joins faster. - Pierre Charbit; Michel Habib; Nicolas Trotignon; Kristina Vuskovic (J. Discrete Algorithms, 2012)

Linear Time Split Decomposition Revisited. - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2012)

Graphs with large chromatic number induce $3k$-cycles. - Marthe Bonamy; Pierre Charbit; Stéphan Thomassé (CoRR, 2014)

Influence of the tie-break rule on the end-vertex problem. - Pierre Charbit; Michel Habib; Antoine Mamcarz (Discret. Math. Theor. Comput. Sci., 2014)

Vertex elimination orderings for hereditary graph classes. - Pierre Aboulker; Pierre Charbit; Nicolas Trotignon; Kristina Vuskovic (Discret. Math., 2015)

The graph formulation of the union-closed sets conjecture. - Henning Bruhn; Pierre Charbit; Oliver Schaudt; Jan Arne Telle (Eur. J. Comb., 2015)

On a Generalization of the Ryser-Brualdi-Stein Conjecture. - Ron Aharoni; Pierre Charbit; David M. Howard 002 (J. Graph Theory, 2015)

Perfect graphs of arbitrarily large clique-chromatic number. - Pierre Charbit; Irena Penev; Stéphan Thomassé; Nicolas Trotignon (J. Comb. Theory B, 2016)

Towards A Unified View of Linear Structure on Graph Classes. - Pierre Charbit; Michel Habib; Lalla Mouatadid; Reza Naserasr (CoRR, 2017)

Limits of structures and the example of tree semi-lattices. - Pierre Charbit; Lucas Hosseini; Patrice Ossona de Mendez (Discret. Math., 2017)

EPTAS for Max Clique on Disks and Unit Balls. - Marthe Bonamy; Edouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé (FOCS, 2018)

χ-bounded families of oriented graphs. - Pierre Aboulker; Jørgen Bang-Jensen; Nicolas Bousquet 001; Pierre Charbit; Frédéric Havet; Frédéric Maffray; José Zamora (J. Graph Theory, 2018)

About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration. - Pierre Charbit (2019)

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. - John Asplund; Pierre Charbit; Carl Feghali (Discret. Math., 2019)

Parameterized Complexity of Independent Set in H-Free Graphs. - Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2020)

Revisiting a Theorem by Folkman on Graph Colouring. - Marthe Bonamy; Pierre Charbit; Oscar Defrain; Gwenaël Joret; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor; Jean-Sébastien Sereni (Electron. J. Comb., 2020)

Extension of Gyárfás-Sumner Conjecture to Digraphs. - Pierre Aboulker; Pierre Charbit; Reza Naserasr (Electron. J. Comb., 2021)

Improved pyrotechnics : Closer to the burning graph conjecture. - Paul Bastide 002; Marthe Bonamy; Pierre Charbit; Théo Pierron; Mikaël Rabie (CoRR, 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Edge clique covers in graphs with independence number two. - Pierre Charbit; Gena Hahn; Marcin Kaminski 001; Manuel Lafond; Nicolas Lichiardopol; Reza Naserasr; Ben Seamone; Rezvan Sherkati (J. Graph Theory, 2021)

(P6, triangle)-free digraphs have bounded dichromatic number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (CoRR, 2022)

Decomposing and colouring some locally semicomplete digraphs. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (Eur. J. Comb., 2022)

Improved Pyrotechnics: Closer to the Burning Number Conjecture. - Paul Bastide 002; Marthe Bonamy; Anthony Bonato; Pierre Charbit; Shahin Kamali; Théo Pierron; Mikaël Rabie (Electron. J. Comb., 2023)

Digraph Colouring and Arc-Connectivity. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (CoRR, 2023)

Clique number of tournaments. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Raul Lopes 001 (CoRR, 2023)

A new graph parameter to measure linearity. - Pierre Charbit; Michel Habib; Lalla Mouatadid; Reza Naserasr (J. Graph Theory, 2023)

($ overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Stéphan Thomassé (Electron. J. Comb., 2024)

Dichromatic Number and Cycle Inversions. - Pierre Charbit; Stéphan Thomassé (CoRR, 2024)

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. - Pierre Charbit; Geoffroy Couteau; Pierre Meyer; Reza Naserasr (IACR Cryptol. ePrint Arch., 2024)

Heroes in oriented complete multipartite graphs. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit (J. Graph Theory, 2024)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. - Romain Bourneuf; Pierre Charbit; Stéphan Thomassé (CoRR, 2025)