Van Bang Le
Universität Rostock
H-index: 22
Europe-Germany
Top articles of Van Bang Le
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs | Theory of Computing Systems | Hoang-Oanh Le Van Bang Le | 2024/2/23 |
On the d-Claw Vertex Deletion Problem | Algorithmica | Sun-Yuan Hsieh Hoang-Oanh Le Van Bang Le Sheng-Lung Peng | 2024/2 |
Maximizing Matching Cuts | arXiv preprint arXiv:2312.12960 | Van Bang Le Felicia Lucke Daniël Paulusma Bernard Ries | 2023/12/20 |
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time | arXiv e-prints | Van Bang Le Christian Rosenke | 2023/8 |
Complexity results for matching cut problems in graphs without long induced paths | Hoàng-Oanh Le Van Bang Le | 2023/6/28 | |
المرجع الألكتروني للمعلوماتية | Pythagoras | DH Bailey JM Borwein NJ Calkin R Girgensohn DR Luke | 2020/4/7 |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | Journal of Computer and System Sciences | Petr A Golovach Christian Komusiewicz Dieter Kratsch | 2022/2/1 |
Complexity of the cluster vertex deletion problem on H-free graphs | Hoang-Oanh Le Van Bang Le | 2022 | |
The perfect matching cut problem revisited | Theoretical Computer Science | Van Bang Le Jan Arne Telle | 2022/9/29 |
Wheel Graph | A Brandstädt VB Le JP Spinrad | 2022/4/13 | |
Matching cut in graphs with large minimum degree | Algorithmica | Chi-Yeh Chen Sun-Yuan Hsieh Hoàng-Oanh Le Van Bang Le Sheng-Lung Peng | 2021/5 |
Leaf powers | Christian Rosenke Van Bang Le Andreas Brandstädt | 2021 | |
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms | Discrete Applied Mathematics | Christian Komusiewicz Dieter Kratsch | 2020/9/15 |
Co-Authors
