| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy | Belova, Tatiana et al. | 2022 |
| 2 | Solving Target Set Selection with Bounded Thresholds Faster than 2^n | Bliznets, Ivan et al. | 2019 |
| 3 | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters | Bliznets, Ivan et al. | 2017 |
| 4 | Hardness of Approximation for H-Free Edge Modification Problems | Bliznets, Ivan et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |