No. Title Author Year
1 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
2 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
3 Exponential Time Paradigms Through the Polynomial Time Lens Drucker, Andrew et al. 2016
4 Finding Large Set Covers Faster via the Representation Method Nederlof, Jesper 2016
5 Subexponential Time Algorithms for Embedding H-Minor Free Graphs Bodlaender, Hans L. et al. 2016
6 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 6


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