| Publication | Date of Publication | Type |
|---|
| Bounding generalized coloring numbers of planar graphs using coin models | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147357 | 2024-01-15 | Paper |
| A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics | 2023-12-15 | Paper |
| Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089672 | 2023-11-13 | Paper |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 2023-10-31 | Paper |
| Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time | 2023-10-31 | Paper |
| Competitive Algorithms for Generalized k -Server in Uniform Metrics | 2023-10-23 | Paper |
| Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space | 2023-08-10 | Paper |
| Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space | 2022-12-21 | Paper |
| Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices | 2022-10-19 | Paper |
| On the fine-grained parameterized complexity of partial scheduling to minimize the makespan | 2022-08-03 | Paper |
| On the parameterized complexity of the connected flow and many visits TSP problem | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075820 | 2022-05-11 | Paper |
| Computing the Chromatic Number Using Graph Decompositions via Matrix Rank | 2021-08-04 | Paper |
| Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces | 2021-05-03 | Paper |
| Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time | 2021-02-02 | Paper |
| Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication | 2021-01-19 | Paper |
| Detecting and counting small patterns in planar graphs in subexponential parameterized time | 2021-01-19 | Paper |
| Hamiltonicity below Dirac's condition | 2020-02-24 | Paper |
| Computing the chromatic number using graph decompositions via matrix rank | 2019-10-18 | Paper |
| Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces | 2019-10-15 | Paper |
| New tools and connections for exponential-time approximation | 2019-09-10 | Paper |
| More consequences of falsifying SETH and the orthogonal vectors conjecture | 2019-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743488 | 2019-05-10 | Paper |
| Hamiltonicity below Dirac's condition | 2019-02-05 | Paper |
| Fast Hamiltonicity Checking Via Bases of Perfect Matchings | 2018-12-06 | Paper |
| On directed feedback vertex set parameterized by treewidth | 2018-11-22 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Fast Zeta Transforms for Lattices with Few Irreducibles | 2018-10-30 | Paper |
| Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems | 2018-10-11 | Paper |
| Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs | 2018-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607947 | 2018-03-15 | Paper |
| A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606306 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606341 | 2018-03-02 | Paper |
| Dense Subset Sum may be the hardest | 2018-01-24 | Paper |
| Subexponential Time Algorithms for Embedding H-Minor Free Graphs | 2017-12-19 | Paper |
| Faster space-efficient algorithms for subset sum and k-sum | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954983 | 2017-01-24 | Paper |
| A short note on Merlin-Arthur protocols for subset sum | 2016-11-23 | Paper |
| Subexponential Time Algorithms for Finding Small Tree and Path Decompositions | 2015-11-19 | Paper |
| Minimizing Rosenthal potential in multicast games | 2015-09-04 | Paper |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth | 2015-06-09 | Paper |
| Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions | 2015-05-04 | Paper |
| Saving space by algebraization | 2014-08-13 | Paper |
| Fast Hamiltonicity Checking Via Bases of Perfect Matchings | 2014-08-07 | Paper |
| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 2014-07-30 | Paper |
| Inclusion/exclusion meets measure and conquer | 2014-07-03 | Paper |
| Speeding Up Dynamic Programming with Representative Sets | 2013-12-10 | Paper |
| Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth | 2013-08-06 | Paper |
| Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems | 2013-05-16 | Paper |
| Homomorphic Hashing for Sparse Coefficient Extraction | 2013-01-07 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2013-01-04 | Paper |
| Minimizing Rosenthal Potential in Multicast Games | 2012-11-01 | Paper |
| Reducing a Target Interval to a Few Exact Queries | 2012-09-25 | Paper |
| Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting | 2010-12-07 | Paper |
| Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time | 2010-11-16 | Paper |
| Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs | 2010-11-16 | Paper |
| A Parameterized Algorithm for Chordal Sandwich | 2010-05-28 | Paper |
| Inclusion/Exclusion Meets Measure and Conquer | 2009-10-29 | Paper |
| Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems | 2009-07-14 | Paper |
