No. Title Author Year
1 On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan Nederlof, Jesper et al. 2020
2 Equal-Subset-Sum Faster Than the Meet-in-the-Middle Mucha, Marcin et al. 2019
3 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
4 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
5 Exponential Time Paradigms Through the Polynomial Time Lens Drucker, Andrew et al. 2016
6 Finding Large Set Covers Faster via the Representation Method Nederlof, Jesper 2016
7 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
8 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 8

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