No. Title Author Year
1 Determining a Slater Winner Is Complete for Parallel Access to NP Lampis, Michael 2022
2 Hedonic Games and Treewidth Revisited Hanaka, Tesshu et al. 2022
3 Digraph Coloring and Distance to Acyclicity Harutyunyan, Ararat et al. 2021
4 Filling Crosswords Is Very Hard Gourvès, Laurent et al. 2021
5 Fine-Grained Meta-Theorems for Vertex Integrity Lampis, Michael et al. 2021
6 Minimum Stable Cut and Treewidth Lampis, Michael 2021
7 (In)approximability of Maximum Minimal FVS Dublois, Louis et al. 2020
8 Grundy Distinguishes Treewidth from Pathwidth Belmonte, Rémy et al. 2020
9 New Algorithms for Mixed Dominating Set Dublois, Louis et al. 2020
10 Token Sliding on Split Graphs Belmonte, Rémy et al. 2019
11 Finer Tight Bounds for Coloring on Clique-Width Lampis, Michael 2018
12 How Bad is the Freedom to Flood-It? Belmonte, Rémy et al. 2018
13 Multistage Matchings Bampis, Evripidis et al. 2018
14 New Results on Directed Edge Dominating Set Belmonte, Rémy et al. 2018
15 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
16 Parameterized (Approximate) Defective Coloring Belmonte, Rémy et al. 2018
17 Parameterized Orientable Deletion Hanaka, Tesshu et al. 2018
18 Treewidth with a Quantifier Alternation Revisited Lampis, Michael et al. 2018
19 Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center Katsikarelis, Ioannis et al. 2017
20 Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse Fotakis, Dimitris et al. 2016
21 Time-Approximation Trade-offs for Inapproximable Problems Bonnet, Édouard et al. 2016
22 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
23 Periodic Metro Scheduling Bampas, Evangelos et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 23

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