No. Title Author Year
1 A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions Kangas, Kustaa et al. 2019
2 Counting Connected Subgraphs with Maximum-Degree-Aware Sieving Björklund, Andreas et al. 2018
3 Dense Subset Sum May Be the Hardest Austrin, Per et al. 2016
4 Subset Sum in the Absence of Concentration Austrin, Per et al. 2015
5 08431 Open Problems -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
6 Trimmed Moebius Inversion and Graphs of Bounded Degree Björklund, Andreas et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 6


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