No. Title Author Year
1 Tight Algorithms for Connectivity Problems Parameterized by Clique-Width Hegerfeld, Falko et al. 2023
2 Tight Bounds for Connectivity Problems Parameterized by Cutwidth Bojikian, Narek et al. 2023
3 Towards Exact Structural Thresholds for Parameterized Complexity Hegerfeld, Falko et al. 2022
4 Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space Hegerfeld, Falko et al. 2020
5 On Adaptive Algorithms for Maximum Matching Hegerfeld, Falko et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 5

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI