No. Title Author Year
1 An Exact Algorithm for Knot-Free Vertex Deletion Ramanujan, M. S. et al. 2022
2 Detours in Directed Graphs Fomin, Fedor V. et al. 2022
3 Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems Kanesh, Lawqueen et al. 2022
4 Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets Abhinav, Ankit et al. 2022
5 Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles Kumar, Neeraj et al. 2022
6 True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs Bandyapadhyay, Sayan et al. 2022
7 A Polynomial Kernel for Bipartite Permutation Vertex Deletion Kanesh, Lawqueen et al. 2021
8 A Polynomial Kernel for Deletion to Ptolemaic Graphs Agrawal, Akanksha et al. 2021
9 An ETH-Tight Algorithm for Multi-Team Formation Lokshtanov, Daniel et al. 2021
10 An FPT Algorithm for Elimination Distance to Bounded Degree Graphs Agrawal, Akanksha et al. 2021
11 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
12 ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space Fomin, Fedor V. et al. 2021
13 Exploiting Dense Structures in Parameterized Complexity Lochet, William et al. 2021
14 k-Distinct Branchings Admits a Polynomial Kernel Bang-Jensen, Jørgen et al. 2021
15 A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion Lokshtanov, Daniel et al. 2020
16 A Polynomial Kernel for Paw-Free Editing Eiben, Eduard et al. 2020
17 Approximation in (Poly-) Logarithmic Space Biswas, Arindam et al. 2020
18 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
19 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
20 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
21 Improved FPT Algorithms for Deletion to Forest-Like Structures Gowda, Kishen N. et al. 2020
22 On the (Parameterized) Complexity of Almost Stable Marriage Gupta, Sushmita et al. 2020
23 On the Parameterized Approximability of Contraction to Classes of Chordal Graphs Gunda, Spoorthy et al. 2020
24 On the Parameterized Complexity of Deletion to ℋ-Free Strong Components Neogi, Rian et al. 2020
25 On the Parameterized Complexity of Grid Contraction Saurabh, Saket et al. 2020
26 On the Parameterized Complexity of Maximum Degree Contraction Problem Saurabh, Saket et al. 2020
27 Optimal Output Sensitive Fault Tolerant Cuts Banerjee, Niranka et al. 2020
28 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
29 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
30 Parameterized Complexity of Feedback Vertex Sets on Hypergraphs Choudhary, Pratibha et al. 2020
Current Page :
Number of result pages: 4
Number of documents: 102


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