No. Title Author Year
1 A Constant-Factor Approximation for Weighted Bond Cover Kim, Eun Jung et al. 2021
2 Twin-width III: Max Independent Set, Min Dominating Set, and Coloring Bonnet, Édouard et al. 2021
3 Grundy Coloring & Friends, Half-Graphs, Bicliques Aboulker, Pierre et al. 2020
4 Grundy Distinguishes Treewidth from Pathwidth Belmonte, Rémy et al. 2020
5 Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion Ahn, Jungho et al. 2020
6 Token Sliding on Split Graphs Belmonte, Rémy et al. 2019
7 Data-Compression for Parametrized Counting Problems on Sparse Graphs Kim, Eun Jung et al. 2018
8 Finding Branch-Decompositions of Matroids, Hypergraphs, and More Jeong, Jisu et al. 2018
9 New Results on Directed Edge Dominating Set Belmonte, Rémy et al. 2018
10 QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Bonnet, Édouard et al. 2018
11 A Polynomial Kernel for Block Graph Deletion Kim, Eun Jung et al. 2015
12 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion Kanté, Mamadou Moustapha et al. 2015
13 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
14 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 14


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