No. Title Author Year
1 Detours in Directed Graphs Fomin, Fedor V. et al. 2022
2 Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems Kanesh, Lawqueen et al. 2022
3 A Polynomial Kernel for Bipartite Permutation Vertex Deletion Kanesh, Lawqueen et al. 2021
4 A Polynomial Kernel for Deletion to Ptolemaic Graphs Agrawal, Akanksha et al. 2021
5 An ETH-Tight Algorithm for Multi-Team Formation Lokshtanov, Daniel et al. 2021
6 An FPT Algorithm for Elimination Distance to Bounded Degree Graphs Agrawal, Akanksha et al. 2021
7 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
8 ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space Fomin, Fedor V. et al. 2021
9 Exploiting Dense Structures in Parameterized Complexity Lochet, William et al. 2021
10 k-Distinct Branchings Admits a Polynomial Kernel Bang-Jensen, Jørgen et al. 2021
11 A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion Lokshtanov, Daniel et al. 2020
12 A Polynomial Kernel for Paw-Free Editing Eiben, Eduard et al. 2020
13 Approximation in (Poly-) Logarithmic Space Biswas, Arindam et al. 2020
14 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
15 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
16 Fault Tolerant Subgraphs with Applications in Kernelization Lochet, William et al. 2020
17 Improved FPT Algorithms for Deletion to Forest-Like Structures Gowda, Kishen N. et al. 2020
18 On the (Parameterized) Complexity of Almost Stable Marriage Gupta, Sushmita et al. 2020
19 On the Parameterized Approximability of Contraction to Classes of Chordal Graphs Gunda, Spoorthy et al. 2020
20 On the Parameterized Complexity of Deletion to ℋ-Free Strong Components Neogi, Rian et al. 2020
21 On the Parameterized Complexity of Grid Contraction Saurabh, Saket et al. 2020
22 On the Parameterized Complexity of Maximum Degree Contraction Problem Saurabh, Saket et al. 2020
23 Optimal Output Sensitive Fault Tolerant Cuts Banerjee, Niranka et al. 2020
24 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
25 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
26 Parameterized Complexity of Feedback Vertex Sets on Hypergraphs Choudhary, Pratibha et al. 2020
27 Quick Separation in Chordal and Split Graphs Misra, Pranabendu et al. 2020
28 The Parameterized Complexity of Guarding Almost Convex Polygons Agrawal, Akanksha et al. 2020
29 A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem Lokshtanov, Daniel et al. 2019
30 Approximate Counting of k-Paths: Deterministic and in Polynomial Space Björklund, Andreas et al. 2019
Current Page :
Number of result pages: 4
Number of documents: 98

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