No. Title Author Year
1 Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms Bonnet, Édouard et al. 2018
2 On the Parameterized Complexity of Red-Blue Points Separation Bonnet, Édouard et al. 2018
3 Orthogonal Terrain Guarding is NP-complete Bonnet, Édouard et al. 2018
4 QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Bonnet, Édouard et al. 2018
5 An Approximation Algorithm for the Art Gallery Problem Bonnet, Édouard et al. 2017
6 Complexity of Token Swapping and its Variants Bonnet, Édouard et al. 2017
7 Fine-Grained Complexity of Coloring Unit Disks and Balls Biró, Csaba et al. 2017
8 The Parameterized Complexity of Positional Games Bonnet, Édouard et al. 2017
9 Fixed-Parameter Approximability of Boolean MinCSPs Bonnet, Édouard et al. 2016
10 Parameterized Hardness of Art Gallery Problems Bonnet, Édouard et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 12


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