No. Title Author Year
1 First-Order Interpretations of Bounded Expansion Classes Gajarský, Jakub et al. 2018
2 Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs Pilipczuk, Michal et al. 2018
3 Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking Pilipczuk, Michal et al. 2017
4 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
5 Edge Bipartization Faster Than 2^k Pilipczuk, Marcin et al. 2017
6 Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs Barbero, Florian et al. 2017
7 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
8 Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs Eickmeyer, Kord et al. 2017
9 On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk) Pilipczuk, Michal 2017
10 Optimizing Tree Decompositions in MSO Bojanczyk, Mikolaj et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 22


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