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


DROPS-Home | Fulltext Search | Imprint Published by LZI