| A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics | 0 | 0.34 | 2021 |
| Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space | 0 | 0.34 | 2021 |
| A Gap-ETH-Tight Approximation Scheme for Euclidean TSP | 0 | 0.34 | 2021 |
| On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. | 0 | 0.34 | 2021 |
| Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors | 0 | 0.34 | 2021 |
| On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. | 0 | 0.34 | 2020 |
| Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces | 0 | 0.34 | 2020 |
| Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space | 0 | 0.34 | 2020 |
| Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication | 0 | 0.34 | 2020 |
| Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. | 0 | 0.34 | 2020 |
| Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time. | 0 | 0.34 | 2020 |
| Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time. | 0 | 0.34 | 2019 |
| Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time. | 0 | 0.34 | 2019 |
| Equal-Subset-Sum Faster Than the Meet-in-the-Middle. | 0 | 0.34 | 2019 |
| Hamiltonicity Below Dirac'S Condition | 0 | 0.34 | 2019 |
| Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. | 1 | 0.36 | 2019 |
| More consequences of falsifying SETH and the orthogonal vectors conjecture. | 3 | 0.38 | 2018 |
| On Directed Feedback Vertex Set parameterized by treewidth. | 0 | 0.34 | 2018 |
| A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. | 0 | 0.34 | 2018 |
| Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. | 0 | 0.34 | 2018 |
| Competitive Algorithms for Generalized k-Server in Uniform Metrics. | 0 | 0.34 | 2018 |
| A short note on Merlin-Arthur protocols for subset sum. | 0 | 0.34 | 2017 |
| New Tools and Connections for Exponential-time Approximation. | 1 | 0.35 | 2017 |
| Faster space-efficient algorithms for subset sum and k-sum. | 1 | 0.36 | 2017 |
| Fast Zeta Transforms for Lattices with Few Irreducibles. | 0 | 0.34 | 2016 |
| Subexponential time algorithms for finding small tree and path decompositions | 4 | 0.41 | 2016 |
| Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. | 0 | 0.34 | 2016 |
| Exponential Time Paradigms Through the Polynomial Time Lens. | 0 | 0.34 | 2016 |
| Dense Subset Sum May Be the Hardest. | 0 | 0.34 | 2016 |
| Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. | 0 | 0.34 | 2016 |
| Finding Large Set Covers Faster via the Representation Method. | 0 | 0.34 | 2016 |
| Subexponential Time Algorithms for Embedding H-Minor Free Graphs. | 3 | 0.39 | 2016 |
| Subset Sum in the Absence of Concentration. | 2 | 0.38 | 2015 |
| Dense Subset Sum may be the hardest | 0 | 0.34 | 2015 |
| Inclusion/Exclusion Meets Measure and Conquer. | 14 | 0.61 | 2014 |
| Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions | 2 | 0.40 | 2013 |
| Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. | 21 | 0.81 | 2013 |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth | 34 | 1.12 | 2013 |
| Fast zeta transforms for lattices with few irreducibles | 2 | 0.38 | 2012 |
| Reducing a target interval to a few exact queries | 7 | 0.48 | 2012 |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2 | 0.37 | 2012 |
| Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time | 8 | 0.59 | 2012 |
| On Problems as Hard as CNF-SAT | 29 | 1.00 | 2012 |
| Homomorphic hashing for sparse coefficient extraction | 7 | 0.50 | 2012 |
| Minimizing rosenthal potential in multicast games | 0 | 0.34 | 2012 |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 48 | 1.28 | 2011 |
| Saving space by algebraization | 32 | 1.34 | 2010 |
| Generalized graph clustering: recognizing (p, q)-cluster graphs | 4 | 0.44 | 2010 |
| Inclusion/Exclusion Branching For Partial Dominating Set And Set Splitting | 6 | 0.53 | 2010 |
| Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems | 51 | 1.73 | 2009 |
