Van Bang Le

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 41

Top Venues

Publications

Hoàng-Oanh Le, Van Bang Le
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR (2024)
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
On the d-Claw Vertex Deletion Problem. Algorithmica 86 (2) (2024)
Stefan Kratsch, Van Bang Le
On polynomial kernelization for Stable Cutset. CoRR (2024)
Hoàng-Oanh Le, Van Bang Le
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. 68 (2) (2024)
Van Bang Le, Christian Rosenke
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. J. Graph Algorithms Appl. 28 (1) (2024)
Van Bang Le, Christian Rosenke
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. CoRR (2023)
Hoàng-Oanh Le, Van Bang Le
Complexity results for matching cut problems in graphs without long induced paths. CoRR (2023)
Hoàng-Oanh Le, Van Bang Le
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. WG (2023)
Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
Maximizing Matching Cuts. CoRR (2023)
Van Bang Le, Christian Rosenke
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. FCT (2023)
Van Bang Le, Jan Arne Telle
The perfect matching cut problem revisited. Theor. Comput. Sci. 931 (2022)
Hoàng-Oanh Le, Van Bang Le
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. MFCS (2022)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123 (2022)
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
On the d-Claw Vertex Deletion Problem. CoRR (2022)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR (2021)
Chi-Yeh Chen, Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
Matching Cut in Graphs with Large Minimum Degree. Algorithmica 83 (5) (2021)
Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng
On the d-Claw Vertex Deletion Problem. COCOON (2021)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS (2021)
Van Bang Le, Jan Arne Telle
The Perfect Matching Cut Problem Revisited. WG (2021)
Van Bang Le, Jan Arne Telle
The Perfect Matching Cut Problem Revisited. CoRR (2021)
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. 283 (2020)
Van Bang Le, Florian Pfender
Color-line and proper color-line graphs. Discret. Appl. Math. 278 (2020)
Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng
Matching Cut in Graphs with Large Minimum Degree. COCOON (2019)
Hoàng-Oanh Le, Van Bang Le
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. Algorithmica 81 (11-12) (2019)
Hoàng-Oanh Le, Van Bang Le
Constrained Representations of Map Graphs and Half-Squares. MFCS (2019)
Hoàng-Oanh Le, Van Bang Le
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. 770 (2019)
Hoàng-Oanh Le, Van Bang Le
Map graphs having witnesses of large girth. Theor. Comput. Sci. 772 (2019)
Hoàng-Oanh Le, Van Bang Le
Map graphs having witnesses of large girth. CoRR (2018)
Van Bang Le, Sheng-Lung Peng
On the complete width and edge clique cover problems. J. Comb. Optim. 36 (2) (2018)
Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC (2018)
Hoàng-Oanh Le, Van Bang Le
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR (2018)
Hoàng-Oanh Le, Van Bang Le
Hardness and structural results for half-squares of restricted tree convex bipartite graphs. CoRR (2018)
Feodor F. Dragan, Dieter Kratsch, Van Bang Le
Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday. Discret. Appl. Math. 216 (2017)
Hoàng-Oanh Le, Van Bang Le
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. COCOON (2017)
Van Bang Le, Thomas Podelleck
Characterization and recognition of some opposition and coalition graph classes. Discret. Appl. Math. 216 (2017)
Van Bang Le, Sheng-Lung Peng
Good characterizations and linear time recognition for 2-probe block graphs. Discret. Appl. Math. 231 (2017)
Van Bang Le, Sheng-Lung Peng
Good characterizations and linear time recognition for 2-probe block graphs. CoRR (2016)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
A unified approach to recognize squares of split graphs. Theor. Comput. Sci. 648 (2016)
Hoàng-Oanh Le, Van Bang Le
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC (2016)
Van Bang Le, Sheng-Lung Peng
On the complete width and edge clique cover problems. CoRR (2016)
Dieter Kratsch, Van Bang Le
Algorithms solving the Matching Cut problem. Theor. Comput. Sci. 609 (2016)
Van Bang Le, Sheng-Lung Peng
On the Complete Width and Edge Clique Cover Problems. COCOON (2015)
Van Bang Le, Sheng-Lung Peng
Characterizing and recognizing probe block graphs. Theor. Comput. Sci. 568 (2015)
Felix Joos, Van Bang Le, Dieter Rautenbach
Forests and trees among Gallai graphs. Discret. Math. 338 (2) (2015)
Van Bang Le, Thomas Podelleck
Characterization and recognition of some opposition and coalition graph classes. CoRR (2015)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. 602 (2015)
Van Bang Le, Florian Pfender
Color-line and Proper Color-line Graphs. CoRR (2015)
Dieter Kratsch, Van Bang Le
Algorithms Solving the Matching Cut Problem. CIAC (2015)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. CoRR (2014)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Squares of $3$-sun-free split graphs. CoRR (2014)
Van Bang Le, Florian Pfender
Complexity results for rainbow matchings. Theor. Comput. Sci. 524 (2014)
Andreas Brandstädt, Van Bang Le
-free graphs. Inf. Process. Lett. 114 (7) (2014)
Van Bang Le, Ragnar Nevries
Complexity and algorithms for recognizing polar and monopolar graphs. Theor. Comput. Sci. 528 (2014)
Van Bang Le, Andrea Oversberg, Oliver Schaudt
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. WG (2014)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
Preface. Discret. Appl. Math. 163 (2014)
Van Bang Le
On opposition graphs, coalition graphs, and bipartite permutation graphs. Discret. Appl. Math. 168 (2014)
Van Bang Le, Sheng-Lung Peng
Good characterizations and linear time recognition for 2-probe block graphs. ICS (2014)
Van Bang Le, Dieter Rautenbach
Integral mixed unit interval graphs. Discret. Appl. Math. 161 (7-8) (2013)
Van Bang Le, Florian Pfender
Extremal Graphs Having No Stable Cutset. Electron. J. Comb. 20 (1) (2013)
Van Bang Le, Florian Pfender
Complexity Results for Rainbow Matchings. CoRR (2013)
Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter
Mixed unit interval graphs. Discret. Math. 312 (22) (2012)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Complexity of Finding Graph Roots with Girth Conditions. Algorithmica 62 (1-2) (2012)
Van Bang Le, Dieter Rautenbach
Integral Mixed Unit Interval Graphs. COCOON (2012)
Van Bang Le
Two characterizations of chain partitioned probe graphs. Ann. Oper. Res. 188 (1) (2011)
Van Bang Le, Ragnar Nevries
Recognizing Polar Planar Graphs Using New Results for Monopolarity. ISAAC (2011)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graphs Comb. 27 (6) (2011)
Van Bang Le, Nguyen Ngoc Tuy
A good characterization of squares of strongly chordal split graphs. Inf. Process. Lett. 111 (3) (2011)
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
Exact leaf powers. Theor. Comput. Sci. 411 (31-33) (2010)
Van Bang Le, Nguyen Ngoc Tuy
The square of a block graph. Discret. Math. 310 (4) (2010)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Computing Graph Roots Without Short Cycles CoRR (2009)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le
Preface. Discret. Appl. Math. 157 (9) (2009)
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy
Computing Graph Roots Without Short Cycles. STACS (2009)
Daniel Bayer, Van Bang Le, H. N. de Ridder
Probe threshold and probe trivially perfect graphs. Theor. Comput. Sci. 410 (47-49) (2009)
Van Bang Le, Nguyen Ngoc Tuy
Hardness Results and Efficient Algorithms for Graph Powers. WG (2009)
Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought (2009)
Andreas Brandstädt, Van Bang Le
Simplicial powers of graphs. Theor. Comput. Sci. 410 (52) (2009)
Andreas Brandstädt, Van Bang Le, Dieter Rautenbach
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. Discret. Math. 309 (12) (2009)
Van Bang Le, Raffaele Mosca, Haiko Müller
On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6 (2) (2008)
Andreas Brandstädt, Van Bang Le
Simplicial Powers of Graphs. COCOA (2008)
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
Probe Ptolemaic Graphs. COCOON (2008)
Andreas Brandstädt, Van Bang Le, R. Sritharan
Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5 (1) (2008)
Van Bang Le, H. N. de Ridder
Characterisations and Linear-Time Recognition of Probe Cographs. WG (2007)
Van Bang Le, H. N. de Ridder
Probe Split Graphs. Discret. Math. Theor. Comput. Sci. 9 (1) (2007)
Van Bang Le, H. N. de Ridder
Linear-time certifying recognition for partitioned probe cographs. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007)
Andreas Brandstädt, Van Bang Le, Suhail Mahfud
New applications of clique separator decomposition for the Maximum Weight Stable Set problem. Theor. Comput. Sci. 370 (1-3) (2007)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47 (1) (2007)
Van Bang Le, Bert Randerath, Ingo Schiermeyer
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389 (1-2) (2007)
Andreas Brandstädt, Van Bang Le
Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98 (4) (2006)
Nguyen Ngoc Tuy, Jörg Bornemann, Van Bang Le
Graph classes related to chordal graphs and chordal bipartite graphs. Electron. Notes Discret. Math. 27 (2006)
Dieter Rautenbach, Andreas Brandstädt, Van Bang Le
Distance-Hereditary 5-Leaf Powers. Electron. Notes Discret. Math. 27 (2006)
H. N. de Ridder, Van Bang Le, Daniel Bayer
On probe classes of graphs. Electron. Notes Discret. Math. 27 (2006)
Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
Bisplit graphs. Discret. Math. 299 (1-3) (2005)
Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG (2005)
Andreas Brandstädt, Van Bang Le, Suhail Mahfud
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem. FCT (2005)
Andreas Brandstädt, Van Bang Le
Split-Perfect Graphs: Characterizations and Algorithmic Use. SIAM J. Discret. Math. 17 (3) (2004)
Van Bang Le, Jeremy P. Spinrad
Consequences of an algorithm for bridged graphs. Discret. Math. 280 (1-3) (2004)
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310 (1-3) (2004)
Andreas Brandstädt, Van Bang Le, H. N. de Ridder
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. Inf. Process. Lett. 89 (4) (2004)
Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. 131 (1) (2003)
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. 16 (4) (2003)

Van Bang Le.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Van Bang Le