No. Title Author Year
1 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size Jansen, Bart M. P. et al. 2023
2 Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large Jacob, Ashwin et al. 2023
3 Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth Włodarczyk, Michał 2023
4 On the Hardness of Compressing Weights Jansen, Bart M. P. et al. 2021
5 Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size Donkers, Huib et al. 2021
6 Optimal Polynomial-Time Compression for Boolean Max CSP Jansen, Bart M. P. et al. 2020
7 Parameterized Inapproximability for Steiner Orientation by Gap Amplification Włodarczyk, Michał 2020
Current Page :
Number of result pages: 1
Number of documents: 7


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