No. Title Author Year
1 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
2 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
3 On the Parameterized Complexity of [1,j]-Domination Problems Alambardar Meybodi, Mohsen et al. 2018
4 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
5 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
6 Communication Complexity of Pairs of Graph Families with Applications Kolay, Sudeshna et al. 2017
7 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
8 Editing to Connected f-Degree Graph Fomin, Fedor V. et al. 2016
9 Fréchet Distance Between a Line and Avatar Point Set Banik, Aritra et al. 2016
10 Parameterized Algorithms for List K-Cycle Panolan, Fahad et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 18


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