Hoàng-Oanh Le

463 total citations
17 papers, 204 citations indexed

About

Hoàng-Oanh Le is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Hoàng-Oanh Le has authored 17 papers receiving a total of 204 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 5 papers in Computer Networks and Communications and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Hoàng-Oanh Le's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (10 papers) and Graph Labeling and Dimension Problems (9 papers). Hoàng-Oanh Le is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (10 papers) and Graph Labeling and Dimension Problems (9 papers). Hoàng-Oanh Le collaborates with scholars based in Germany, United States and Japan. Hoàng-Oanh Le's 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 and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Algorithmica.

In The Last Decade

Hoàng-Oanh Le

16 papers receiving 198 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Hoàng-Oanh Le Germany	10	199	58	57	52	12	17	204
Martin Vatshelle Norway	10	232 1.2×	81 1.4×	72 1.3×	26 0.5×	15 1.3×	19	251
Cláudia Linhares Sales Brazil	8	194 1.0×	25 0.4×	97 1.7×	42 0.8×	26 2.2×	33	219
Alexandre Pinlou France	10	229 1.2×	32 0.6×	108 1.9×	40 0.8×	36 3.0×	38	245
Benjamin Lévêque France	8	156 0.8×	34 0.6×	68 1.2×	24 0.5×	18 1.5×	28	167
Luis Cereceda United Kingdom	5	201 1.0×	79 1.4×	64 1.1×	17 0.3×	30 2.5×	7	206
Deepak Rajendraprasad India	6	166 0.8×	39 0.7×	78 1.4×	34 0.7×	22 1.8×	24	172
Mostafa Blidia Algeria	9	202 1.0×	51 0.9×	48 0.8×	33 0.6×	14 1.2×	35	211
Dingjun Lou China	9	223 1.1×	132 2.3×	73 1.3×	113 2.2×	25 2.1×	56	245
Charis Papadopoulos Greece	8	145 0.7×	52 0.9×	39 0.7×	54 1.0×	17 1.4×	31	167
Vassilis Giakoumakis France	11	284 1.4×	58 1.0×	119 2.1×	55 1.1×	42 3.5×	21	294

Countries citing papers authored by Hoàng-Oanh Le

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

17 of 17 papers shown

Le, Hoàng-Oanh & Van Bang Lê. (2024). Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory of Computing Systems. 68(2). 250–270.

Hsieh, Sun‐Yuan, Hoàng-Oanh Le, Van Bang Lê, & Sheng‐Lung Peng. (2023). On the d-Claw Vertex Deletion Problem. Algorithmica. 86(2). 505–525. 1 indexed citations

Le, Hoàng-Oanh & Van Bang Lê. (2018). A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theoretical Computer Science. 770. 69–78. 10 indexed citations

Le, Hoàng-Oanh & Van Bang Lê. (2018). Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. Algorithmica. 81(11-12). 4258–4274. 2 indexed citations

Le, Hoàng-Oanh & Van Bang Lê. (2018). Map graphs having witnesses of large girth. Theoretical Computer Science. 772. 143–148. 1 indexed citations

Le, Hoàng-Oanh & Van Bang Lê. (2016). On the Complexity of Matching Cut in Graphs of Fixed Diameter. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 64. 12. 1 indexed citations

Brandstädt, Andreas, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Lê, & Ryuhei Uehara. (2006). Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica. 47(1). 27–51. 14 indexed citations

Brandstädt, Andreas, Joost Engelfriet, Hoàng-Oanh Le, & Vadim Lozin. (2006). Clique-Width for 4-Vertex Forbidden Subgraphs. Theory of Computing Systems. 39(4). 561–590. 29 indexed citations

Brandstädt, Andreas, Hoàng-Oanh Le, & Raffaele Mosca. (2004). Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width. Discrete Applied Mathematics. 145(2). 232–241. 21 indexed citations

10.

Brandstädt, Andreas, Hoàng-Oanh Le, & Raffaele Mosca. (2004). GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH. International Journal of Foundations of Computer Science. 15(1). 163–185. 22 indexed citations

11.

Brandstädt, Andreas, Feodor F. Dragan, Hoàng-Oanh Le, & Raffaele Mosca. (2004). New Graph Classes of Bounded Clique-Width. Theory of Computing Systems. 38(5). 623–645. 26 indexed citations

12.

Brandstädt, Andreas, Feodor F. Dragan, Hoàng-Oanh Le, & Van Bang Lê. (2003). Tree spanners on chordal graphs: complexity and algorithms. Theoretical Computer Science. 310(1-3). 329–354. 27 indexed citations

13.

Le, Hoàng-Oanh, Van Bang Lê, & Haiko Müller. (2003). Splitting a graph into disjoint induced paths or cycles. Discrete Applied Mathematics. 131(1). 199–212. 12 indexed citations

14.

Kratsch, Dieter, et al.. (2003). Additive Tree Spanners. SIAM Journal on Discrete Mathematics. 17(2). 332–340. 19 indexed citations

15.

Brandstädt, Andreas, et al.. (2003). Structure and stability number of chair-, co-P- and gem-free graphs revisited. Information Processing Letters. 86(3). 161–167. 9 indexed citations

16.

Le, Hoàng-Oanh & Van Bang Lê. (2002). The NP-completeness of (1,r)-subcolorability of cubic graphs. Information Processing Letters. 81(3). 157–162. 5 indexed citations

17.

Brandstädt, Andreas, Hoàng-Oanh Le, & Van Bang Lê. (2002). On α-redundant vertices in P5-free graphs. Information Processing Letters. 82(3). 119–122. 5 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