Pierre Charbit

55 papers A* 2B 1Journal 49Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. FOCS Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025	J	`jnl`	A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. CoRR Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025	J	`jnl`	Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs. CoRR Pierre Charbit, Michel Habib, Amalia Sorondo
2024	J	`jnl`	($\overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. Electron. J. Comb. Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
2024	—	`conf`	A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. TCC (4) Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr
2024	J	`jnl`	A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. IACR Cryptol. ePrint Arch. Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr
2024	J	`jnl`	Dichromatic Number and Cycle Inversions. CoRR Pierre Charbit, Stéphan Thomassé
2024	J	`jnl`	Heroes in oriented complete multipartite graphs. J. Graph Theory Pierre Aboulker, Guillaume Aubian, Pierre Charbit
2023	J	`jnl`	A new graph parameter to measure linearity. J. Graph Theory Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2023	J	`jnl`	Clique number of tournaments. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes
2023	J	`jnl`	Digraph Colouring and Arc-Connectivity. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit
2023	J	`jnl`	Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
2022	J	`jnl`	(P6, triangle)-free digraphs have bounded dichromatic number. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
2022	J	`jnl`	Decomposing and colouring some locally semicomplete digraphs. Eur. J. Comb. Pierre Aboulker, Guillaume Aubian, Pierre Charbit
2022	J	`jnl`	Heroes in oriented complete multipartite graphs. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit
2021	J	`jnl`	Decomposing and colouring some locally semicomplete digraphs. CoRR Pierre Aboulker, Guillaume Aubian, Pierre Charbit
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	Edge clique covers in graphs with independence number two. J. Graph Theory Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
2021	J	`jnl`	Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. Pierre Aboulker, Pierre Charbit, Reza Naserasr
2021	J	`jnl`	Improved pyrotechnics : Closer to the burning graph conjecture. CoRR Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
2020	J	`jnl`	Extension of Gyarfas-Sumner conjecture to digraphs. CoRR Pierre Aboulker, Pierre Charbit, Reza Naserasr
2020	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2020	J	`jnl`	Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
2019	—	`book`	About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration. Pierre Charbit
2019	J	`jnl`	Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. John Asplund, Pierre Charbit, Carl Feghali
2018	A*	`conf`	EPTAS for Max Clique on Disks and Unit Balls. FOCS Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	J	`jnl`	EPTAS for Max Clique on Disks and Unit Balls. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
2018	B	`conf`	Parameterized Complexity of Independent Set in H-Free Graphs. IPEC Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	Parameterized Complexity of Independent Set in H-Free Graphs. CoRR Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
2018	J	`jnl`	χ-bounded families of oriented graphs. J. Graph Theory Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2017	—	`conf`	A New Graph Parameter to Measure Linearity. COCOA (2) Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2017	J	`jnl`	Limits of structures and the example of tree semi-lattices. Discret. Math. Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez
2017	J	`jnl`	Towards A Unified View of Linear Structure on Graph Classes. CoRR Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2016	J	`jnl`	$χ$-bounded families of oriented graphs. CoRR Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
2016	J	`jnl`	Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory B Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon
2015	J	`jnl`	On a Generalization of the Ryser-Brualdi-Stein Conjecture. J. Graph Theory Ron Aharoni, Pierre Charbit, David M. Howard
2015	J	`jnl`	The graph formulation of the union-closed sets conjecture. Eur. J. Comb. Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
2015	J	`jnl`	Vertex elimination orderings for hereditary graph classes. Discret. Math. Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic
2014	J	`jnl`	Graphs with large chromatic number induce $3k$-cycles. CoRR Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
2014	J	`jnl`	Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. Pierre Charbit, Michel Habib, Antoine Mamcarz
2013	J	`jnl`	On a Generalization of the Ryser-Brualdi-Stein Conjecture CoRR Ron Aharoni, Pierre Charbit, David M. Howard
2012	J	`jnl`	Detecting 2-joins faster. J. Discrete Algorithms Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
2012	J	`jnl`	LexBFS, structure and algorithms CoRR Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic
2012	J	`jnl`	Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
2011	J	`jnl`	Detecting 2-joins faster CoRR Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
2011	J	`jnl`	The fractional chromatic number of Zykov products of graphs. Appl. Math. Lett. Pierre Charbit, Jean-Sébastien Sereni
2009	J	`jnl`	A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs CoRR Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
2008	J	`jnl`	A note on computing set overlap classes. Inf. Process. Lett. Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2008	J	`jnl`	Cyclic orders: Equivalence and duality. Comb. Pierre Charbit, András Sebö
2008	J	`jnl`	Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé
2007	J	`jnl`	A Note On Computing Set Overlap Classes CoRR Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2007	J	`jnl`	Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. Pierre Charbit, Stéphan Thomassé
2007	J	`jnl`	Infinite Locally Random Graphs. Internet Math. Pierre Charbit, Alex D. Scott
2007	J	`jnl`	The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. Pierre Charbit, Stéphan Thomassé, Anders Yeo