default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Charbit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé:
($\overrightarrow{P_6}$, triangle)-Free Digraphs Have Bounded Dichromatic Number. Electron. J. Comb. 31(4) (2024)- [j26]Pierre Aboulker
, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. J. Graph Theory 105(4): 652-669 (2024) - [c4]Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr:
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. TCC (4) 2024: 167-199 - [i20]Pierre Charbit, Stéphan Thomassé:
Dichromatic Number and Cycle Inversions. CoRR abs/2401.15130 (2024) - [i19]Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr:
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. IACR Cryptol. ePrint Arch. 2024: 1473 (2024) - 2023
- [j25]Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie:
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30(4) (2023) - [j24]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
A new graph parameter to measure linearity. J. Graph Theory 103(3): 462-485 (2023) - [i18]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Digraph Colouring and Arc-Connectivity. CoRR abs/2304.04690 (2023) - [i17]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes:
Clique number of tournaments. CoRR abs/2310.04265 (2023) - 2022
- [j23]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Decomposing and colouring some locally semicomplete digraphs. Eur. J. Comb. 106: 103591 (2022) - [i16]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. CoRR abs/2202.13306 (2022) - [i15]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé:
(P6, triangle)-free digraphs have bounded dichromatic number. CoRR abs/2212.02272 (2022) - 2021
- [j22]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j21]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [j20]Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati:
Edge clique covers in graphs with independence number two. J. Graph Theory 97(2): 324-339 (2021) - [i14]Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Decomposing and colouring some locally semicomplete digraphs. CoRR abs/2103.07886 (2021) - [i13]Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie:
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR abs/2110.10530 (2021) - [i12]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR abs/2110.15419 (2021) - 2020
- [j19]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82(8): 2360-2394 (2020) - [j18]Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [i11]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyarfas-Sumner conjecture to digraphs. CoRR abs/2009.13319 (2020)
2010 – 2019
- 2019
- [b1]Pierre Charbit:
About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration. Paris Diderot University, France, 2019 - [j17]John Asplund, Pierre Charbit, Carl Feghali:
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. 342(8): 2195-2203 (2019) - 2018
- [j16]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - [c3]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c2]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC 2018: 17:1-17:13 - [i10]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i9]Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant:
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR abs/1810.04620 (2018) - 2017
- [j15]Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez:
Limits of structures and the example of tree semi-lattices. Discret. Math. 340(10): 2589-2603 (2017) - [c1]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
A New Graph Parameter to Measure Linearity. COCOA (2) 2017: 154-168 - [i8]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
Towards A Unified View of Linear Structure on Graph Classes. CoRR abs/1702.02133 (2017) - 2016
- [j14]Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon:
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory B 116: 456-464 (2016) - [i7]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
$χ$-bounded families of oriented graphs. CoRR abs/1605.07411 (2016) - 2015
- [j13]Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic:
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338(5): 825-834 (2015) - [j12]Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle:
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43: 210-219 (2015) - [j11]Ron Aharoni, Pierre Charbit, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. J. Graph Theory 78(2): 143-156 (2015) - 2014
- [j10]Pierre Charbit, Michel Habib, Antoine Mamcarz:
Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. 16(2): 57-72 (2014) - [i6]Marthe Bonamy, Pierre Charbit, Stéphan Thomassé:
Graphs with large chromatic number induce $3k$-cycles. CoRR abs/1408.2172 (2014) - 2013
- [i5]Ron Aharoni, Pierre Charbit, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. CoRR abs/1305.6164 (2013) - 2012
- [j9]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. J. Discrete Algorithms 17: 60-66 (2012) - [j8]Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26(2): 499-514 (2012) - [i4]Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic:
LexBFS, structure and algorithms. CoRR abs/1205.2535 (2012) - 2011
- [j7]Pierre Charbit, Jean-Sébastien Sereni:
The fractional chromatic number of Zykov products of graphs. Appl. Math. Lett. 24(4): 432-437 (2011) - [i3]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. CoRR abs/1107.3977 (2011)
2000 – 2009
- 2009
- [i2]Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. CoRR abs/0902.1700 (2009) - 2008
- [j6]Pierre Charbit, András Sebö:
Cyclic orders: Equivalence and duality. Comb. 28(2): 131-143 (2008) - [j5]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) - [j4]Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. 24(1): 39-53 (2008) - 2007
- [j3]Pierre Charbit, Stéphan Thomassé, Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16(1): 1-4 (2007) - [j2]Pierre Charbit, Stéphan Thomassé:
Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. 16(6): 829-832 (2007) - [j1]Pierre Charbit, Alex D. Scott:
Infinite Locally Random Graphs. Internet Math. 3(3): 321-331 (2007) - [i1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-19 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
