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

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