The following pages link to Magnus Wahlström (Q309798):
Displaying 50 items.
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Counting models for 2SAT and 3SAT formulae (Q1770390) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- Clique Cover and Graph Separation: New Incompressibility Results (Q2843253) (← links)
- A Completeness Theory for Polynomial (Turing) Kernelization (Q2867084) (← links)
- A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting (Q2903013) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (Q2946020) (← links)
- (Q2957518) (← links)
- Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem (Q2957896) (← links)
- Euler Digraphs (Q3120436) (← links)
- The power of primitive positive definitions with polynomially many variables (Q3133171) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples (Q3405445) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements (Q3558348) (← links)
- Preprocessing of Min Ones Problems: A Dichotomy (Q3587416) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams (Q3656849) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs (Q4575662) (← links)
- LP-branching algorithms based on biased graphs (Q4575845) (← links)
- Exact algorithms for finding minimum transversals in rank-3 hypergraphs (Q4736814) (← links)
- (Q4808676) (← links)
- Compression via Matroids (Q4962154) (← links)
- On Problems as Hard as CNF-SAT (Q4962605) (← links)
- (Q5002776) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Randomized Contractions Meet Lean Decompositions (Q5028343) (← links)
- <i>r</i> -Simple <i>k</i> -Path and Related Problems Parameterized by <i>k</i> / <i>r</i> (Q5028347) (← links)
- Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064) (← links)
