No. Title Author Year
1 The Complexity of Promise SAT on Non-Boolean Domains Brandts, Alex et al. 2020
2 Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints Knop, Dusan et al. 2019
3 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
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 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
7 Tight Lower Bounds for the Complexity of Multicoloring Bonamy, Marthe et al. 2017
8 On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs Pilipczuk, Michal et al. 2016
9 Homomorphism Reconfiguration via Homotopy Wrochna, Marcin 2015
Current Page :
Number of result pages: 1
Number of documents: 9


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