Van Bang Lê

3.2k total citations · 1 hit paper
77 papers, 1.5k citations indexed

About

Van Bang Lê is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Van Bang Lê has authored 77 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 71 papers in Computational Theory and Mathematics, 20 papers in Discrete Mathematics and Combinatorics and 19 papers in Computer Networks and Communications. Recurrent topics in Van Bang Lê's work include Advanced Graph Theory Research (71 papers), Graph Labeling and Dimension Problems (35 papers) and Complexity and Algorithms in Graphs (34 papers). Van Bang Lê is often cited by papers focused on Advanced Graph Theory Research (71 papers), Graph Labeling and Dimension Problems (35 papers) and Complexity and Algorithms in Graphs (34 papers). Van Bang Lê collaborates with scholars based in Germany, United States and Canada. Van Bang Lê's co-authors include Andreas Brandstädt, Jeremy Spinrad, Hoàng-Oanh Le, Bert Randerath, Feodor F. Dragan, Chı́nh T. Hoàng, Dieter Rautenbach, R. Sritharan, Haiko Müller and Dieter Kratsch and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Annals of Operations Research and Theoretical Computer Science.

In The Last Decade

Van Bang Lê

73 papers receiving 1.4k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Graph Classes: A Survey

1999 875 citations Andreas Brandstädt, Van Bang Lê et al. profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Van Bang Lê Germany	14	1.3k	419	329	274	154	77	1.5k
Dieter Kratsch France	27	1.9k 1.5×	756 1.8×	356 1.1×	234 0.9×	214 1.4×	132	2.2k
Fǎnicǎ Gavril Israel	17	1.2k 1.0×	575 1.4×	199 0.6×	200 0.7×	183 1.2×	35	1.5k
Andreas Brandstädt Germany	25	2.3k 1.8×	690 1.6×	657 2.0×	457 1.7×	272 1.8×	110	2.5k
Feodor F. Dragan United States	20	781 0.6×	275 0.7×	147 0.4×	245 0.9×	115 0.7×	82	1.0k
Michael D. Plummer United States	20	1.3k 1.0×	358 0.9×	520 1.6×	447 1.6×	229 1.5×	92	1.5k
Douglas B. West United States	25	1.8k 1.4×	582 1.4×	757 2.3×	528 1.9×	387 2.5×	231	2.3k
Richard J. Nowakowski Canada	19	1.0k 0.8×	244 0.6×	344 1.0×	371 1.4×	114 0.7×	111	1.5k
Mirka Miller Australia	18	1.1k 0.9×	368 0.9×	300 0.9×	356 1.3×	550 3.6×	145	1.5k
James Oxley United States	19	1.2k 0.9×	279 0.7×	547 1.7×	257 0.9×	657 4.3×	142	1.6k
Ivan Rival Canada	23	1.1k 0.9×	155 0.4×	214 0.7×	326 1.2×	119 0.8×	123	1.6k

Countries citing papers authored by Van Bang Lê

Since Specialization

Citations

This map shows the geographic impact of Van Bang Lê'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 Van Bang Lê with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Van Bang Lê more than expected).

Fields of papers citing papers by Van Bang Lê

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Van Bang Lê. 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 Van Bang Lê. The network helps show where Van Bang Lê may publish in the future.

Co-authorship network of co-authors of Van Bang Lê

This figure shows the co-authorship network connecting the top 25 collaborators of Van Bang Lê. A scholar is included among the top collaborators of Van Bang Lê 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 Van Bang Lê. Van Bang Lê 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

1.

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.

2.

Golovach, Petr A., Christian Komusiewicz, Dieter Kratsch, & Van Bang Lê. (2021). Refined Notions of Parameterized Enumeration Kernels with Applications\n to Matching Cut Enumeration. arXiv (Cornell University). 1 indexed citations

3.

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

4.

Joos, Felix, Van Bang Lê, & Dieter Rautenbach. (2014). Forests and trees among Gallai graphs. Discrete Mathematics. 338(2). 190–195. 1 indexed citations

5.

Lê, Van Bang & Sheng‐Lung Peng. (2014). Characterizing and recognizing probe block graphs. Theoretical Computer Science. 568. 97–102. 3 indexed citations

6.

Dourado, Mitre C., Van Bang Lê, Fábio Protti, Dieter Rautenbach, & Jayme L. Szwarcfiter. (2012). Mixed unit interval graphs. Discrete Mathematics. 312(22). 3357–3363. 6 indexed citations

7.

Brandstädt, Andreas & Van Bang Lê. (2009). Simplicial powers of graphs. Theoretical Computer Science. 410(52). 5443–5454. 3 indexed citations

8.

Lê, Van Bang, et al.. (2009). The square of a block graph. Discrete Mathematics. 310(4). 734–741. 11 indexed citations

9.

Brandstädt, Andreas, Van Bang Lê, & Dieter Rautenbach. (2008). A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discrete Mathematics. 309(12). 3843–3852. 8 indexed citations

10.

Lê, Van Bang, Raffaele Mosca, & Haiko Müller. (2007). On stable cutsets in claw-free graphs and planar graphs. Journal of Discrete Algorithms. 6(2). 256–276. 10 indexed citations

11.

Lê, Van Bang & Jeremy Spinrad. (2004). Consequences of an algorithm for bridged graphs. Discrete Mathematics. 280(1-3). 271–274.

12.

Lê, Van Bang. (2003). Bipartite-perfect graphs. Discrete Applied Mathematics. 127(3). 581–599. 1 indexed citations

13.

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

14.

Lê, Van Bang & Bert Randerath. (2003). On stable cutsets in line graphs. Theoretical Computer Science. 301(1-3). 463–475. 20 indexed citations

15.

Hoàng, Chı́nh T. & Van Bang Lê. (2001). P_4-Colorings and P_4-Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 4 no. 2. 4 indexed citations

16.

Brandstädt, Andreas & Van Bang Lê. (2000). Recognizing the P4-structure of block graphs. Discrete Applied Mathematics. 99(1-3). 349–366. 4 indexed citations

17.

Hoàng, Chı́nh T. & Van Bang Lê. (2000). On P4-transversals of perfect graphs. Discrete Mathematics. 216(1-3). 195–210. 6 indexed citations

18.

Brandstädt, Andreas, et al.. (2000). On stable cutsets in graphs. Discrete Applied Mathematics. 105(1-3). 39–50. 23 indexed citations

19.

Brandstädt, Andreas, et al.. (1998). The complexity of some problems related to Graph 3-colorability. Discrete Applied Mathematics. 89(1-3). 59–73. 32 indexed citations

20.

Lê, Van Bang. (1996). Gallai graphs and anti-Gallai graphs. Discrete Mathematics. 159(1-3). 179–189. 15 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