Hoàng-Oanh Le
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics top 5%
- Geometry and Topology top 10%
- Electrical and Electronic Engineering
- Co-authors
- Andreas BrandstädtVan Bang LêRaffaele MoscaFeodor F. DraganHaiko MüllerVadim LozinJoost EngelfrietErich Prisner
- Topics
- Advanced Graph Theory Research (17 papers)Complexity and Algorithms in Graphs (10 papers)Graph Labeling and Dimension Problems (9 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- GermanyUnited StatesJapan
In The Last Decade
Hoàng-Oanh Le
16 papers receiving 198 citations
Peers
Comparison fields: 5 of 20
- Computational Theory and Mathematics 199
- Computer Networks and Communications 58
- Discrete Mathematics and Combinatorics 57
- Geometry and Topology 52
- Electrical and Electronic Engineering 12
Countries citing papers authored by Hoàng-Oanh Le
This map shows the geographic impact of Hoàng-Oanh Le'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 Hoàng-Oanh Le with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hoàng-Oanh Le more than expected).
Fields of papers citing papers by Hoàng-Oanh Le
This network shows the impact of papers produced by Hoàng-Oanh Le. 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 Hoàng-Oanh Le. The network helps show where Hoàng-Oanh Le may publish in the future.
Co-authorship network of co-authors of Hoàng-Oanh Le
This figure shows the co-authorship network connecting the top 25 collaborators of Hoàng-Oanh Le. A scholar is included among the top collaborators of Hoàng-Oanh Le 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 Hoàng-Oanh Le. Hoàng-Oanh Le is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 10 | |
| 4 | 2 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 14 | |
| 8 | 29 | |
| 9 | 21 | |
| 10 | 22 | |
| 11 | 26 | |
| 12 | 27 | |
| 13 | 12 | |
| 14 | 19 | |
| 15 | 9 | |
| 16 | 5 | |
| 17 | 5 |
About Hoàng-Oanh Le
Hoàng-Oanh Le is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 17 papers that have together received 204 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (10 papers) and Graph Labeling and Dimension Problems (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (57 citations), Computational Theory and Mathematics (199 citations) and Geometry and Topology (52 citations). Hoàng-Oanh Le has collaborated with scholars based in Germany, United States and Japan. Frequent co-authors include Andreas Brandstädt, Van Bang Lê, Raffaele Mosca, Feodor F. Dragan, Haiko Müller, Vadim Lozin, Joost Engelfriet, Erich Prisner, Dieter Kratsch and Ryuhei Uehara. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics 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.