| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width | Bergé, Pierre et al. | 2023 |
| 2 | Deciding Twin-Width at Most 4 Is NP-Complete | Bergé, Pierre et al. | 2022 |
| 3 | Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs | Bergé, Pierre et al. | 2022 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 3 |