No. Title Author Year
1 An FPT Algorithm for Elimination Distance to Bounded Degree Graphs Agrawal, Akanksha et al. 2021
2 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
3 A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion Lokshtanov, Daniel et al. 2020
4 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
5 Improved FPT Algorithms for Deletion to Forest-Like Structures Gowda, Kishen N. et al. 2020
6 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
7 On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets Lokshtanov, Daniel et al. 2020
8 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
9 Parameterized Complexity of Feedback Vertex Sets on Hypergraphs Choudhary, Pratibha et al. 2020
10 Quick Separation in Chordal and Split Graphs Misra, Pranabendu et al. 2020
11 Structural Parameterizations with Modulator Oblivion Jacob, Ashwin et al. 2020
12 Complexity of the Steiner Network Problem with Respect to the Number of Terminals Eiben, Eduard et al. 2019
13 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
14 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
15 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
16 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
17 On the Parameterized Complexity of [1,j]-Domination Problems Alambardar Meybodi, Mohsen et al. 2018
18 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
19 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
20 Communication Complexity of Pairs of Graph Families with Applications Kolay, Sudeshna et al. 2017
21 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
22 Editing to Connected f-Degree Graph Fomin, Fedor V. et al. 2016
23 Fréchet Distance Between a Line and Avatar Point Set Banik, Aritra et al. 2016
24 Parameterized Algorithms for List K-Cycle Panolan, Fahad et al. 2016
25 Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs Kolay, Sudeshna et al. 2016
26 Simultaneous Feedback Edge Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
27 Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems Fomin, Fedor et al. 2016
28 B-Chromatic Number: Beyond NP-Hardness Panolan, Fahad et al. 2015
29 Finding Even Subgraphs Even Faster Goyal, Prachi et al. 2015
30 Parameterized Algorithms for Deletion to (r,ell)-Graphs Kolay, Sudeshna et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 32


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