Pierre Charbit

468 total citations
28 papers, 177 citations indexed

About

Pierre Charbit is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Pierre Charbit has authored 28 papers receiving a total of 177 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 11 papers in Discrete Mathematics and Combinatorics and 8 papers in Geometry and Topology. Recurrent topics in Pierre Charbit's work include Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (10 papers) and Complexity and Algorithms in Graphs (9 papers). Pierre Charbit is often cited by papers focused on Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (10 papers) and Complexity and Algorithms in Graphs (9 papers). Pierre Charbit collaborates with scholars based in France, United Kingdom and Canada. Pierre Charbit's co-authors include Stéphan Thomassé, Anders Yeo, Nicolas Trotignon, Mathieu Raffinot, Fabien de Montgolfier, Michel Habib, Ron Aharoni, David M. Howard, Kristina Vušković and Nicolás Bousquet and has published in prestigious journals such as Applied Mathematics Letters, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Pierre Charbit

25 papers receiving 168 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Pierre Charbit France	6	136	65	30	23	22	28	177
Pim van ’t Hof Norway	12	280 2.1×	47 0.7×	122 4.1×	17 0.7×	24 1.1×	40	327
Luérbio Faria Brazil	8	175 1.3×	49 0.8×	61 2.0×	12 0.5×	37 1.7×	56	212
Dimitrios M. Thilikos France	7	127 0.9×	43 0.7×	36 1.2×	18 0.8×	9 0.4×	25	149
Somnath Sikdar Germany	11	238 1.8×	42 0.6×	77 2.6×	36 1.6×	31 1.4×	23	264
Rudi Pendavingh Netherlands	7	89 0.7×	43 0.7×	19 0.6×	24 1.0×	19 0.9×	26	138
Fahad Panolan India	7	183 1.3×	31 0.5×	75 2.5×	14 0.6×	13 0.6×	57	205
Pål Grønås Drange Norway	5	135 1.0×	11 0.2×	57 1.9×	16 0.7×	7 0.3×	9	157
Alice A. McRae United States	12	346 2.5×	61 0.9×	154 5.1×	7 0.3×	16 0.7×	29	433
Steve Linton United Kingdom	7	47 0.3×	55 0.8×	36 1.2×	54 2.3×	24 1.1×	18	121
Vincent Bouchitté France	7	196 1.4×	26 0.4×	88 2.9×	25 1.1×	12 0.5×	15	224

Countries citing papers authored by Pierre Charbit

Since Specialization

Citations

This map shows the geographic impact of Pierre Charbit's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pierre Charbit with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Charbit more than expected).

Fields of papers citing papers by Pierre Charbit

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pierre Charbit. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pierre Charbit. The network helps show where Pierre Charbit may publish in the future.

Co-authorship network of co-authors of Pierre Charbit

This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Charbit. A scholar is included among the top collaborators of Pierre Charbit based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pierre Charbit. Pierre Charbit is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bonamy, Marthe, et al.. (2023). Improved Pyrotechnics: Closer to the Burning Number Conjecture. The Electronic Journal of Combinatorics. 30(4). 2 indexed citations

Charbit, Pierre, et al.. (2023). Heroes in oriented complete multipartite graphs. Journal of Graph Theory. 105(4). 652–669. 2 indexed citations

Charbit, Pierre, et al.. (2023). A new graph parameter to measure linearity. Journal of Graph Theory. 103(3). 462–485. 1 indexed citations

Charbit, Pierre, Geňa Hahn, Marcin Kamiński, et al.. (2021). Edge clique covers in graphs with independence number two. Journal of Graph Theory. 97(2). 324–339. 2 indexed citations

Bousquet, Nicolás, et al.. (2020). Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica. 82(8). 2360–2394. 3 indexed citations

Charbit, Pierre, et al.. (2017). Limits of structures and the example of tree semi-lattices. Discrete Mathematics. 340(10). 2589–2603.

Charbit, Pierre, et al.. (2015). Perfect graphs of arbitrarily large clique-chromatic number. Journal of Combinatorial Theory Series B. 116. 456–464. 14 indexed citations

Charbit, Pierre, et al.. (2015). Vertex elimination orderings for hereditary graph classes. Discrete Mathematics. 338(5). 825–834. 9 indexed citations

Charbit, Pierre, et al.. (2014). Influence of the tie-break rule on the end-vertex problem. Discrete Mathematics & Theoretical Computer Science. Vol. 16 no. 2(PRIMA 2013). 7 indexed citations

10.

Bruhn, Henning, Pierre Charbit, Oliver Schaudt, & Jan Arne Telle. (2014). The graph formulation of the union-closed sets conjecture. European Journal of Combinatorics. 43. 210–219. 4 indexed citations

11.

Aharoni, Ron, Pierre Charbit, & David M. Howard. (2014). On a Generalization of the Ryser-Brualdi-Stein Conjecture. Journal of Graph Theory. 78(2). 143–156. 13 indexed citations

12.

Charbit, Pierre, et al.. (2012). LexBFS, structure and algorithms. arXiv (Cornell University). 1 indexed citations

13.

Charbit, Pierre, Michel Habib, Nicolas Trotignon, & Kristina Vušković. (2012). Detecting 2-joins faster. Journal of Discrete Algorithms. 17. 60–66. 4 indexed citations

14.

Charbit, Pierre, Fabien de Montgolfier, & Mathieu Raffinot. (2009). A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. arXiv (Cornell University). 2 indexed citations

15.

Charbit, Pierre, Michel Habib, Vincent Limouzy, et al.. (2008). A note on computing set overlap classes. Information Processing Letters. 108(4). 186–191. 5 indexed citations

16.

Charbit, Pierre, et al.. (2007). Finding a vector orthogonal to roughly half a collection of vectors. Journal of Complexity. 24(1). 39–53. 3 indexed citations

17.

Viennot, Laurent, Michel Habib, Yacine Boufkhad, et al.. (2007). Graphs, networks and algorithms. 2 indexed citations

18.

Charbit, Pierre & Stéphan Thomassé. (2007). Graphs with Large Girth Not Embeddable in the Sphere. Combinatorics Probability Computing. 16(6). 829–832.

19.

Charbit, Pierre, Stéphan Thomassé, & Anders Yeo. (2006). The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Combinatorics Probability Computing. 16(1). 1–4. 74 indexed citations

20.

Charbit, Pierre. (2005). Circuits in graphs and digraphs via Embeddings. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact