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

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