| Publication | Date of Publication | Type |
|---|
Polynomial-time approximation of independent set parameterized by treewidth
| 2025-01-06 | Paper |
A fine-grained classification of the complexity of evaluating the Tutte polynomial on integer points parameterized by treewidth and cutwidth
| 2025-01-06 | Paper |
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Parameterized problems complete for nondeterministic FPT time and logarithmic space
Information and Computation | 2024-10-08 | Paper |
Tight lower bounds for problems parameterized by rank-width
| 2024-10-08 | Paper |
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
| 2024-04-23 | Paper |
Isolation schemes for problems on decomposable graphs
| 2024-04-23 | Paper |
Bounding generalized coloring numbers of planar graphs using coin models
The Electronic Journal of Combinatorics | 2024-02-23 | Paper |
A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics
| 2024-01-15 | Paper |
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
SIAM Journal on Computing | 2023-12-15 | Paper |
Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
| 2023-11-13 | Paper |
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Competitive Algorithms for Generalized k -Server in Uniform Metrics
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
SIAM Journal on Discrete Mathematics | 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
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
Algorithmica | 2022-08-03 | Paper |
On the parameterized complexity of the connected flow and many visits TSP problem
| 2022-06-08 | Paper |
scientific article; zbMATH DE number 7525510 (Why is no real title available?)
| 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
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Detecting and counting small patterns in planar graphs in subexponential parameterized time
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Hamiltonicity below Dirac's condition
| 2020-02-24 | Paper |
Computing the chromatic number using graph decompositions via matrix rank
Theoretical Computer Science | 2019-10-18 | Paper |
Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
New tools and connections for exponential-time approximation
Algorithmica | 2019-09-10 | Paper |
More consequences of falsifying SETH and the orthogonal vectors conjecture
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fast zeta transforms for lattices with few irreducibles
| 2019-05-10 | Paper |
Hamiltonicity below Dirac's condition
| 2019-02-05 | Paper |
Fast Hamiltonicity checking via bases of perfect matchings
Journal of the ACM | 2018-12-06 | Paper |
On directed feedback vertex set parameterized by treewidth
| 2018-11-22 | Paper |
On problems as hard as CNF-SAT
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Fast Zeta Transforms for Lattices with Few Irreducibles
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
SIAM Journal on Computing | 2018-10-11 | Paper |
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
| 2018-03-15 | Paper |
Competitive algorithms for generalized \(k\)-server in uniform metrics
| 2018-03-15 | Paper |
Exponential time paradigms through the polynomial time lens
| 2018-03-02 | Paper |
Finding large set covers faster via the representation method
| 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
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Subset sum in the absence of concentration
| 2017-01-24 | Paper |
A short note on Merlin-Arthur protocols for subset sum
Information Processing Letters | 2016-11-23 | Paper |
Subexponential time algorithms for finding small tree and path decompositions
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Minimizing Rosenthal potential in multicast games
Theory of Computing Systems | 2015-09-04 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Information and Computation | 2015-06-09 | Paper |
Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
Algorithmica | 2015-05-04 | Paper |
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Fast Hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Inclusion/exclusion meets measure and conquer
Algorithmica | 2014-07-03 | Paper |
Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
Parameterized and Exact Computation | 2013-12-10 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Automata, Languages, and Programming | 2013-08-06 | Paper |
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
Algorithmica | 2013-05-16 | Paper |
Homomorphic hashing for sparse coefficient extraction
Parameterized and Exact Computation | 2013-01-07 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Minimizing Rosenthal potential in multicast games
Automata, Languages, and Programming | 2012-11-01 | Paper |
Reducing a target interval to a few exact queries
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Parameterized and Exact Computation | 2010-12-07 | Paper |
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
A parameterized algorithm for chordal sandwich
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Inclusion/Exclusion Meets Measure and Conquer
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
Automata, Languages and Programming | 2009-07-14 | Paper |
