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