The following pages link to Jesper Nederlof (Q344518):
Displaying 50 items.
- A short note on Merlin-Arthur protocols for subset sum (Q344519) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space (Q2110607) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Hamiltonicity below Dirac's condition (Q2301533) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- On the parameterized complexity of the connected flow and many visits TSP problem (Q2672424) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Saving space by algebraization (Q2875160) (← links)
- Reducing a Target Interval to a Few Exact Queries (Q2912770) (← links)
- (Q2954983) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs (Q3057623) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Minimizing Rosenthal Potential in Multicast Games (Q3167040) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
- A Parameterized Algorithm for Chordal Sandwich (Q3562997) (← links)
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (Q3638075) (← links)
- Inclusion/Exclusion Meets Measure and Conquer (Q3639274) (← links)
- Fast Hamiltonicity Checking Via Bases of Perfect Matchings (Q4561499) (← links)
- Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs (Q4566709) (← links)
- Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141) (← links)
- Dense Subset Sum may be the hardest (Q4601865) (← links)
- (Q4606306) (← links)
- (Q4606341) (← links)
- (Q4607947) (← links)
- A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank (Q4607957) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q4899040) (← links)
- Homomorphic Hashing for Sparse Coefficient Extraction (Q4899249) (← links)
- Fast Zeta Transforms for Lattices with Few Irreducibles (Q4962203) (← links)
- On Problems as Hard as CNF-SAT (Q4962605) (← links)
- Faster space-efficient algorithms for subset sum and k-sum (Q4977972) (← links)
- Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- (Q5075820) (← links)
- Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (Q5144895) (← links)
- Detecting and counting small patterns in planar graphs in subexponential parameterized time (Q5145013) (← links)
- Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i>*(2.7<sup><i>k</i></sup>) Time (Q5146829) (← links)
- More consequences of falsifying SETH and the orthogonal vectors conjecture (Q5230294) (← links)
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561) (← links)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962) (← links)
- (Q5743488) (← links)
