No. Title Author Year
1 Parameterized (Approximate) Defective Coloring Belmonte, Rémy et al. 2018
2 Treewidth with a Quantifier Alternation Revisited Lampis, Michael et al. 2018
3 Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth Marx, Dániel et al. 2016
4 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
5 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5


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