| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs | Le, Hoang-Oanh et al. | 2022 |
| 2 | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration | Golovach, Petr A. et al. | 2021 |
| 3 | Constrained Representations of Map Graphs and Half-Squares | Le, Hoang-Oanh et al. | 2019 |
| 4 | Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms | Komusiewicz, Christian et al. | 2019 |
| 5 | On the Complexity of Matching Cut in Graphs of Fixed Diameter | Le, Hoang-Oanh et al. | 2016 |
| 6 | Computing Graph Roots Without Short Cycles | Farzad, Babak et al. | 2009 |
| 7 | Linear-time certifying recognition for partitioned probe cographs | Le, Van Bang et al. | 2007 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |