Pierre Charbit

Documents

Publications

($\overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number

Pierre Aboulker , Guillaume Aubian , Pierre Charbit , Stéphan Thomassé

The Electronic Journal of Combinatorics, 2024, 31 (4), ⟨10.37236/11838⟩

Article dans une revue hal-04970384v1

Improved Pyrotechnics: Closer to the Burning Number Conjecture

Paul Bastide , Marthe Bonamy , Anthony Bonato , Pierre Charbit , Shahin Kamali et al.

The Electronic Journal of Combinatorics, 2023, 30 (4), ⟨10.37236/11113⟩

Article dans une revue hal-04587525v1

Edge clique covers in graphs with independence number two

Pierre Charbit , Geňa Hahn , Marcin Kamiński , Manuel Lafond , Nicolas Lichiardopol et al.

Journal of Graph Theory, 2021

Article dans une revue hal-02969899v1

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

Marthe Bonamy , Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Panos Giannopoulos et al.

Journal of the ACM (JACM), 2021, 68 (2), pp.1-38. ⟨10.1145/3433160⟩

Article dans une revue hal-03107441v1

Extension of Gyárfás-Sumner conjecture to digraphs

Pierre Aboulker , Pierre Charbit , Reza Naserasr

The Electronic Journal of Combinatorics, 2021, ⟨10.37236/9906⟩

Article dans une revue hal-02969880v1

Parameterized Complexity of Independent Set in H-free Graphs

Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Stéphan Thomassé , Rémi Watrigant

Algorithmica, 2020, Parameterized and Exact Computation, IPEC 2018, 82 (8), pp.2360-2394. ⟨10.1007/s00453-020-00730-6⟩

Article dans une revue hal-03015353v2

Revisiting a theorem by Folkman on graph colouring

Marthe Bonamy , Pierre Charbit , Oscar Defrain , Gwénaël Joret , Aurélie Lagoutte et al.

The Electronic Journal of Combinatorics, 2020, 27 (1), pp.P1.56. ⟨10.37236/8899⟩

Article dans une revue hal-02194900v2

Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations

John Asplund , Pierre Charbit , Carl Feghali

Discrete Mathematics, 2019, 342 (8), pp.2195-2203. ⟨10.1016/j.disc.2019.04.021⟩

Article dans une revue hal-02429274v1

Perfect graphs of arbitrarily large clique-chromatic number

Pierre Charbit , Irena Penev , Stéphan Thomassé , Nicolas Trotignon

Journal of Combinatorial Theory, Series B, 2016, 116, pp.456-464. ⟨10.1016/j.jctb.2015.09.008⟩

Article dans une revue hal-01324052v1

The graph formulation of the union-closed sets conjecture

Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

European Journal of Combinatorics, 2015, 43, pp.210-219. ⟨10.1016/j.ejc.2014.08.030⟩

Article dans une revue hal-01253152v1

On a Generalization of the Ryser-Brualdi-Stein Conjecture

Pierre Charbit , Ron Aharoni , David Howard

Journal of Graph Theory, 2015, pp.14. ⟨10.1002/jgt.21796⟩

Article dans une revue hal-01101508v1

Vertex elimination orderings for hereditary graph classes

Pierre Aboulker , Pierre Charbit , Nicolas Trotignon , Kristina Vušković

Discrete Mathematics, 2015, 338 (5), ⟨10.1016/j.disc.2014.12.014⟩

Article dans une revue hal-01230783v1

Influence of the tie-break rule on the end-vertex problem

Pierre Charbit , Michel Habib , Antoine Mamcarz

Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 2, pp.57-72. ⟨10.46298/dmtcs.2081⟩

Article dans une revue hal-01101514v1

Detecting 2-joins faster

Charbit Pierre , Michel Habib , Trotignon Nicolas , Vuskovic Kristina

Journal of Discrete Algorithms, 2012, 17, pp.60-66

Article dans une revue ensl-00800019v1

Linear Time Split Decomposition Revisited

Pierre Charbit , Fabien de Montgolfier , Mathieu Raffinot

SIAM Journal on Discrete Mathematics, 2012, 26 (2), pp.499-514. ⟨10.1137/10080052X⟩

Article dans une revue hal-00921774v1

The Fractional Chromatic Number of Zykov Products of Graphs

Pierre Charbit , Jean-Sébastien Sereni

Applied Mathematics Letters, 2011, 24 (4), pp.432--437. ⟨10.1016/j.aml.2010.10.032⟩

Article dans une revue hal-00558883v1

A Note on Computing Set Overlap Classes

Pierre Charbit , Michel Habib , Vincent Limouzy , Fabien de Montgolfier , Mathieu Raffinot et al.

Information Processing Letters, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩

Article dans une revue lirmm-00325371v1

Finding a Vector Orthogonal to Roughly Half a Collection of Vectors

Pierre Charbit , Emmanuel Jeandel , Pascal Koiran , Sylvain Perifel , Stéphan Thomassé

Journal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩

Article dans une revue lirmm-00292703v1

Graphs with Large Girth Not Embeddable in the Sphere

Pierre Charbit , Stéphan Thomassé

Combinatorics, Probability and Computing, 2007, 16 (6), pp.829-832. ⟨10.1017/S0963548307008528⟩

Article dans une revue lirmm-00250083v1

The Minimum Feedback Arc Set Problem is NP-hard for Tournaments

Pierre Charbit , Stéphan Thomassé , Anders Yeo

Combinatorics, Probability and Computing, 2007, 16, pp.01-04. ⟨10.1017/S0963548306007887⟩

Article dans une revue lirmm-00140321v1

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction

Pierre Charbit , Geoffroy Couteau , Pierre Meyer , Reza Naserasr

TCC 2024, Dec 2024, Milan (Italie), Italy

Communication dans un congrès hal-04779135v1

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction

Pierre Charbit , Geoffroy Couteau , Pierre Meyer , Reza Naserasr

TCC 2024, Dec 2024, Milan, Italy

Communication dans un congrès hal-04773929v1

EPTAS for Max Clique on Disks and Unit Balls

Marthe Bonamy , Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Stéphan Thomassé

FOCS: Foundations of Computer Science, Oct 2018, Paris, France. ⟨10.1109/FOCS.2018.00060⟩

Communication dans un congrès hal-01962198v1

Parameterized Complexity of Independent Set in H-free graphs

Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Stéphan Thomassé , Rémi Watrigant

IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.CVIT.2016.23⟩

Communication dans un congrès hal-01962369v1

A New Graph Parameter to Measure Linearity

Pierre Charbit , Michel Habib , Lalla Mouatadid , Reza Naserasr

COCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩

Communication dans un congrès hal-01672521v1

Graphs with large chromatic number induce 3k-cycles

Marthe Bonamy , Stéphan Thomassé , Pierre Charbit

2017

Pré-publication, Document de travail hal-01431393v1

χ-bounded families of oriented graphs

Pierre Aboulker , Jørgen Bang-Jensen , Nicolas Bousquet , Pierre Charbit , Frédéric Havet et al.

2016

Pré-publication, Document de travail hal-01412667v1

Limits of Structures and the Example of Tree-Semilattices

Pierre Charbit , Lucas Hosseini , Patrice Ossona de Mendez

2015

Pré-publication, Document de travail hal-01150659v2

Finding a Vector Orthogonal to Roughly Half a Collection of Vectors

Pierre Charbit , Emmanuel Jeandel , Pascal Koiran , Sylvain Perifel , Stéphan Thomassé

2007

Pré-publication, Document de travail ensl-00153736v1

A Note On Computing Set Overlap Classes

Pierre Charbit , Michel Habib , Vincent Limouzy , Fabien de Montgolfier , Mathieu Raffinot et al.

2007

Pré-publication, Document de travail hal-00192579v1

Cyclic Orders: Equivalence and Duality

András Sebő , Pierre Charbit

2006

Pré-publication, Document de travail hal-00005192v1

About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration

Pierre Charbit

Discrete Mathematics [cs.DM]. Université Paris Diderot, 2019

HDR tel-02462270v1

Chargement...