No. Title Author Year
1 (In)approximability of Maximum Minimal FVS Dublois, Louis et al. 2020
2 Grundy Distinguishes Treewidth from Pathwidth Belmonte, Rémy et al. 2020
3 New Algorithms for Mixed Dominating Set Dublois, Louis et al. 2020
4 Token Sliding on Split Graphs Belmonte, Rémy et al. 2019
5 Finer Tight Bounds for Coloring on Clique-Width Lampis, Michael 2018
6 How Bad is the Freedom to Flood-It? Belmonte, Rémy et al. 2018
7 Multistage Matchings Bampis, Evripidis et al. 2018
8 New Results on Directed Edge Dominating Set Belmonte, Rémy et al. 2018
9 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
10 Parameterized (Approximate) Defective Coloring Belmonte, Rémy et al. 2018
11 Parameterized Orientable Deletion Hanaka, Tesshu et al. 2018
12 Treewidth with a Quantifier Alternation Revisited Lampis, Michael et al. 2018
13 Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center Katsikarelis, Ioannis et al. 2017
14 Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse Fotakis, Dimitris et al. 2016
15 Time-Approximation Trade-offs for Inapproximable Problems Bonnet, Édouard et al. 2016
16 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
17 Periodic Metro Scheduling Bampas, Evangelos et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 17


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