Pierre Charbit
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 20
- Complexity and Algorithms in Graphs 9
- Graph Labeling and Dimension Problems 6
-
- Limits and Structures in Graph Theory 10
- Co-authors
- Stéphan Thomassé (7 shared papers)Anders Yeo (1 shared paper)Nicolas Trotignon (4 shared papers)Mathieu Raffinot (3 shared papers)Fabien de Montgolfier (4 shared papers)Michel Habib (5 shared papers)David M. Howard (1 shared paper)Ron Aharoni (1 shared paper)
- Journals
- Journal of Graph Theory (5 papers)Discrete Mathematics (3 papers)European Journal of Combinatorics (2 papers)Combinatorics Probability Computing (2 papers)Algorithmica (1 paper)
- Partner nations
- FranceCanadaUnited Kingdom
In The Last Decade
Pierre Charbit
25 papers receiving 174 citations
Peers
Comparison fields: 5 of 45
- Discrete Mathematics and Combinatorics 67
- Computational Theory and Mathematics 141
- Geometry and Topology 19
- Computer Networks and Communications 32
- Computer Graphics and Computer-Aided Design 4
Countries citing papers authored by Pierre Charbit
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
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-authors
The 25 scholars most cited alongside Pierre Charbit, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2006 | 80 | |
| 2 | 2015 | 14 | |
| 3 | 2014 | 13 | |
| 4 | 2012 | 12 | |
| 5 | 2015 | 9 | |
| 6 | 2014 | 7 | |
| 7 | 2022 | 5 | |
| 8 | 2008 | 5 | |
| 9 | 2014 | 4 | |
| 10 | 2012 | 4 | |
| 11 | 2019 | 4 | |
| 12 | 2018 | 3 | |
| 13 | 2007 | 3 | |
| 14 | 2020 | 3 | |
| 15 | 2021 | 2 | |
| 16 | A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs | 2009 | 2 |
| 17 | 2023 | 2 | |
| 18 | 2023 | 2 | |
| 19 | 2008 | 2 | |
| 20 | Graphs, networks and algorithms | 2007 | 2 |
About Pierre Charbit
Pierre Charbit is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Electrical and Electronic Engineering, having authored 28 papers that have together received 184 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (10 papers), Complexity and Algorithms in Graphs (9 papers), Graph Labeling and Dimension Problems (6 papers), Graph theory and applications (6 papers), Computational Geometry and Mesh Generation (4 papers), graph theory and CDMA systems (4 papers) and Interconnection Networks and Systems (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (67 citations), Computational Theory and Mathematics (141 citations), Geometry and Topology (19 citations), Computer Networks and Communications (32 citations) and Computer Graphics and Computer-Aided Design (4 citations). Pierre Charbit has collaborated with scholars based in France, Canada and United Kingdom. Frequent co-authors include Stéphan Thomassé, Anders Yeo, Nicolas Trotignon, Mathieu Raffinot, Fabien de Montgolfier, Michel Habib, David M. Howard, Ron Aharoni, Kristina Vušković and Nicolás Bousquet. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, European Journal of Combinatorics, Combinatorics Probability Computing and Algorithmica.
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.