Nombre de documents

16

Page de Pierre Charbit


Article dans une revue12 documents

  • Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon. Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory, Series B, Elsevier, 2016, 116, pp.456-464. <10.1016/j.jctb.2015.09.008>. <hal-01324052>
  • Pierre Charbit, Ron Aharoni, David Howard. On a Generalization of the Ryser-Brualdi-Stein Conjecture. Journal of Graph Theory, Wiley, 2015, pp.14. <10.1002/jgt.21796>. <hal-01101508>
  • Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vušković. Vertex elimination orderings for hereditary graph classes. Contributions to Discrete Mathematics, University of Calgary, 2015, 338 (5), <10.1016/j.disc.2014.12.014>. <hal-01230783>
  • Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle. The graph formulation of the union-closed sets conjecture. European Journal of Combinatorics, Elsevier, 2015, 43, pp.210-219. <10.1016/j.ejc.2014.08.030>. <hal-01253152>
  • Pierre Charbit, Michel Habib, Antoine Mamcarz. Influence of the tie-break rule on the end-vertex problem. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, pp.57-72. <hal-01101514>
  • Charbit Pierre, Michel Habib, Trotignon Nicolas, Vuskovic Kristina. Detecting 2-joins faster. Journal of Discrete Algorithms, Elsevier, 2012, 17, pp.60-66. <ensl-00800019>
  • Pierre Charbit, Fabien De Montgolfier, Mathieu Raffinot. Linear Time Split Decomposition Revisited. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (2), pp.499-514. <10.1137/10080052X>. <hal-00921774>
  • Pierre Charbit, Jean-Sébastien Sereni. The Fractional Chromatic Number of Zykov Products of Graphs. Applied Mathematics Letters, Elsevier, 2011, 24 (4), pp.432--437. <10.1016/j.aml.2010.10.032>. <hal-00558883>
  • Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien De Montgolfier, Mathieu Raffinot, et al.. A Note on Computing Set Overlap Classes. Information Processing Letters, Elsevier, 2008, 108 (4), pp.186-191. <10.1016/j.ipl.2008.05.005>. <lirmm-00325371>
  • Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé. Finding a Vector Orthogonal to Roughly Half a Collection of Vectors. Journal of Complexity, Elsevier, 2008, 24, pp.39-53. <10.1016/j.jco.2006.09.005>. <lirmm-00292703>
  • Pierre Charbit, Stéphan Thomassé, Anders Yeo. The Minimum Feedback Arc Set Problem is NP-hard for Tournaments. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2007, 16, pp.01-04. <http://www.lirmm.fr/~thomasse/liste/feedback.pdf>. <10.1017/S0963548306007887>. <lirmm-00140321>
  • Pierre Charbit, Stéphan Thomassé. Graphs with Large Girth Not Embeddable in the Sphere. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2007, 16 (6), pp.829-832. <10.1017/S0963548307008528>. <lirmm-00250083>

Pré-publication, Document de travail4 documents

  • Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez. Limits of Structures and the Example of Tree-Semilattices. 2015. <hal-01150659v2>
  • Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé. Finding a Vector Orthogonal to Roughly Half a Collection of Vectors. 13 pages. 2007. <ensl-00153736>
  • Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien De Montgolfier, Mathieu Raffinot, et al.. A Note On Computing Set Overlap Classes. 2007. <hal-00192579>
  • Andras Sebo, Pierre Charbit. Cyclic Orders: Equivalence and Duality. Cahier Leibniz n°119. 2006. <hal-00005192>