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


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