I agree that this site is using cookies. You can find further informations here.
X
Charbit, Pierre
316  results:
Search for persons X
?
1

Heroes in oriented complete multipartite graphs:

Aboulker, Pierre ; Aubian, Guillaume ; Charbit, Pierre
Journal of Graph Theory.  105 (2023)  4 - p. 652-669 , 2023
Link: https://doi.org/10.1002/..
 
?
2

A new graph parameter to measure linearity:

Charbit, Pierre ; Habib, Michel ; Mouatadid, Lalla.
Journal of Graph Theory.  103 (2023)  3 - p. 462-485 , 2023
Link: https://doi.org/10.1002/..
 
?
3

Decomposing and colouring some locally semicomplete digraph:

Aboulker, Pierre ; Aubian, Guillaume ; Charbit, Pierre
European Journal of Combinatorics.  106 (2022)  - p. 103591 , 2022
Link: https://doi.org/10.1016/..
 
?
4

EPTAS and Subexponential Algorithm for Maximum Clique on Di..:

Bonamy, Marthe ; Bonnet, Édouard ; Bousquet, Nicolas...
Journal of the ACM.  68 (2021)  2 - p. 1-38 , 2021
Link: https://doi.org/10.1145/..
 
?
5

Edge clique covers in graphs with independence number two:

Charbit, Pierre ; Hahn, Geňa ; Kamiński, Marcin...
Journal of Graph Theory.  97 (2021)  2 - p. 324-339 , 2021
Link: https://doi.org/10.1002/..
 
?
6

Decomposing and Colouring Locally Out-Transitive Oriented G..:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Aboulker, Pierre ; Aubian, Guillaume ; Charbit, Pierre - p. 688-695 , 2021
Link: https://doi.org/10.1007/..
 
?
7

EPTAS and Subexponential Algorithm for Maximum Clique on Di..:

Bonamy, Marthe ; Bonnet, Édouard ; Bousquet, Nicolas...
Journal of the ACM (JACM).  68 (2021)  2 - p. 1-38 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Parameterized Complexity of Independent Set in H-Free Graph:

Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre..
Algorithmica.  82 (2020)  8 - p. 2360-2394 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Enclosings of decompositions of complete multigraphs in 2-e..:

Asplund, John ; Charbit, Pierre ; Feghali, Carl
Discrete Mathematics.  342 (2019)  8 - p. 2195-2203 , 2019
Link: https://doi.org/10.1016/..
 
?
10

Perfect graphs of arbitrarily large clique-chromatic number:

Charbit, Pierre ; Penev, Irena ; Thomassé, Stéphan.
Journal of Combinatorial Theory, Series B.  116 (2016)  - p. 456-464 , 2016
Link: https://doi.org/10.1016/..
 
?
11

The graph formulation of the union-closed sets conjecture:

Bruhn, Henning ; Charbit, Pierre ; Schaudt, Oliver.
European Journal of Combinatorics.  43 (2015)  - p. 210-219 , 2015
Link: https://doi.org/10.1016/..
 
?
12

Vertex elimination orderings for hereditary graph classes:

Aboulker, Pierre ; Charbit, Pierre ; Trotignon, Nicolas.
Discrete Mathematics.  338 (2015)  5 - p. 825-834 , 2015
Link: https://doi.org/10.1016/..
 
?
13

On a Generalization of the Ryser-Brualdi-Stein Conjecture:

Aharoni, Ron ; Charbit, Pierre ; Howard, David
Journal of Graph Theory.  78 (2014)  2 - p. 143-156 , 2014
Link: https://doi.org/10.1002/..
 
?
14

Detecting 2-joins faster:

Charbit, Pierre ; Habib, Michel ; Trotignon, Nicolas.
Journal of Discrete Algorithms.  17 (2012)  - p. 60-66 , 2012
Link: https://doi.org/10.1016/..
 
?
15

Linear Time Split Decomposition Revisited:

Charbit, Pierre ; de Montgolfier, Fabien ; Raffinot, Mathieu
SIAM Journal on Discrete Mathematics.  26 (2012)  2 - p. 499-514 , 2012
Link: https://doi.org/10.1137/..
 
1-15