No. Title Author Year
1 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
2 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
3 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
4 Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Barbero, Florian et al. 2017
5 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
6 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
7 On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk) Pilipczuk, Michal 2017
8 Optimizing Tree Decompositions in MSO Bojanczyk, Mikolaj et al. 2017
9 Tight Lower Bounds for the Complexity of Multicoloring Bonamy, Marthe et al. 2017
10 Hardness of Approximation for H-Free Edge Modification Problems Bliznets, Ivan et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 20


DROPS-Home | Fulltext Search | Imprint Published by LZI