No. Title Author Year
1 Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth Marx, Dániel et al. 2016
2 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
3 Complexity and Approximability of Parameterized MAX-CSPs Dell, Holger et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 3


DROPS-Home | Fulltext Search | Imprint Published by LZI