Binh-Minh Bui-Xuan
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 10%
- Geometry and Topology
- Molecular Biology
- Co-authors
- Jan Arne TelleMartin VatshelleAubin JarryAfonso FerreiraMichel HabibVincent LimouzyFabien de MontgolfierOndřej Suchý
- Topics
- Advanced Graph Theory Research (11 papers)Complexity and Algorithms in Graphs (6 papers)semigroups and automata theory (2 papers)
In The Last Decade
Binh-Minh Bui-Xuan
12 papers receiving 123 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 92
- Computer Networks and Communications 62
- Discrete Mathematics and Combinatorics 18
- Geometry and Topology 10
- Molecular Biology 9
Countries citing papers authored by Binh-Minh Bui-Xuan
This map shows the geographic impact of Binh-Minh Bui-Xuan'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 Binh-Minh Bui-Xuan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Binh-Minh Bui-Xuan more than expected).
Fields of papers citing papers by Binh-Minh Bui-Xuan
This network shows the impact of papers produced by Binh-Minh Bui-Xuan. 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 Binh-Minh Bui-Xuan. The network helps show where Binh-Minh Bui-Xuan may publish in the future.
Co-authorship network of co-authors of Binh-Minh Bui-Xuan
This figure shows the co-authorship network connecting the top 25 collaborators of Binh-Minh Bui-Xuan. A scholar is included among the top collaborators of Binh-Minh Bui-Xuan 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 Binh-Minh Bui-Xuan. Binh-Minh Bui-Xuan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 33 | |
| 3 | 6 | |
| 4 | 3 | |
| 5 | 28 | |
| 6 | Feedback vertex set on graphs of low cliquewidth | 1 |
| 7 | 15 | |
| 8 | 1 | |
| 9 | 5 | |
| 10 | 3 | |
| 11 | Algorithmic Aspects of a General Modular Decomposition Theory | 3 |
| 12 | 0 | |
| 13 | Evolving graphs and least cost journeys in dynamic networks | 21 |
About Binh-Minh Bui-Xuan
Binh-Minh Bui-Xuan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 13 papers that have together received 126 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), Complexity and Algorithms in Graphs (6 papers) and semigroups and automata theory (2 papers). The work is most often cited by research in Computational Theory and Mathematics (92 citations), Discrete Mathematics and Combinatorics (18 citations) and Computer Networks and Communications (62 citations). Binh-Minh Bui-Xuan has collaborated with scholars based in France, Norway and Germany. Frequent co-authors include Jan Arne Telle, Martin Vatshelle, Aubin Jarry, Afonso Ferreira, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Ondřej Suchý, Michaël Rao and Christophe Paul. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics and European Journal of Combinatorics.
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.