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


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