No. Title Author Year
1 Complexity of the Steiner Network Problem with Respect to the Number of Terminals Eiben, Eduard et al. 2019
2 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
3 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
4 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
5 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
6 On the Parameterized Complexity of [1,j]-Domination Problems Alambardar Meybodi, Mohsen et al. 2018
7 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
8 Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Lokshtanov, Daniel et al. 2018
9 Communication Complexity of Pairs of Graph Families with Applications Kolay, Sudeshna et al. 2017
10 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 21


DROPS-Home | Imprint | Privacy Published by LZI