| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Computing Treedepth in Polynomial Space and Linear FPT Time | Nadara, Wojciech et al. | 2022 |
| 2 | Determining 4-Edge-Connected Components in Linear Time | Nadara, Wojciech et al. | 2021 |
| 3 | Many Visits TSP Revisited | Kowalik, Łukasz et al. | 2020 |
| 4 | The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth | Kowalik, Łukasz et al. | 2020 |
| 5 | Improved Bounds for the Excluded-Minor Approximation of Treedepth | Czerwinski, Wojciech et al. | 2019 |
| 6 | Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness | Nadara, Wojciech et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |