 | 2011 |
|---|
| 10 |       | Pierre Charbit,
Jean-Sébastien Sereni:
The fractional chromatic number of Zykov products of graphs.
Appl. Math. Lett. 24(4): 432-437 (2011) |
| 9 | | Pierre Charbit,
Michel Habib,
Nicolas Trotignon,
Kristina Vuskovic:
Detecting 2-joins faster
CoRR abs/1107.3977: (2011) |
| 2009 |
|---|
| 8 | | Pierre Charbit,
Fabien de Montgolfier,
Mathieu Raffinot:
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs
CoRR abs/0902.1700: (2009) |
| 2008 |
|---|
| 7 | | Pierre Charbit,
András Sebö:
Cyclic orders: Equivalence and duality.
Combinatorica 28(2): 131-143 (2008) |
| 6 | | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A note on computing set overlap classes.
Inf. Process. Lett. 108(4): 186-191 (2008) |
| 5 | | Pierre Charbit,
Emmanuel Jeandel,
Pascal Koiran,
Sylvain Perifel,
Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors.
J. Complexity 24(1): 39-53 (2008) |
| 2007 |
|---|
| 4 | | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A Note On Computing Set Overlap Classes
CoRR abs/0711.4573: (2007) |
| 3 | | Pierre Charbit,
Stéphan Thomassé,
Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
Combinatorics, Probability & Computing 16(1): 1-4 (2007) |
| 2 | | Pierre Charbit,
Stéphan Thomassé:
Graphs with Large Girth Not Embeddable in the Sphere.
Combinatorics, Probability & Computing 16(6): 829-832 (2007) |
| 1 | | Pierre Charbit,
Alex D. Scott:
Infinite Locally Random Graphs.
Internet Mathematics 3(3): 321-331 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page