pith. sign in

Magnus Wahlstr\"om

Identifiers

  • name variant Magnus Wahlstr\"om 0.60 · backfill

Papers (23)

  1. Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances cs.DM · 2026 · author #5
  2. Optimal FPT-Approximability for Modular Linear Equations cs.DS · 2026 · author #5
  3. Multi-budgeted directed cuts cs.DS · 2018 · author #5
  4. Alternative parameterizations of Metric Dimension cs.DS · 2018 · author #4
  5. Parameterized Algorithms for Zero Extension and Metric Labelling Problems cs.DS · 2018 · author #2
  6. Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? cs.DS · 2018 · author #2
  7. Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra cs.CC · 2017 · author #2
  8. Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials cs.DS · 2017 · author #3
  9. Path-contractions, edge deletions and connectivity preservation cs.DS · 2017 · author #4
  10. $k$-Distinct In- and Out-Branchings in Digraphs cs.DS · 2016 · author #3
  11. Odd Properly Colored Cycles in Edge-Colored Graphs math.CO · 2016 · author #3
  12. Chinese Postman Problem on Edge-Colored Multigraphs cs.DS · 2015 · author #4
  13. Directed multicut is W[1]-hard, even for four terminal pairs cs.DS · 2015 · author #2
  14. Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem cs.CC · 2014 · author #3
  15. Half-integrality, LP-branching and FPT Algorithms cs.DS · 2013 · author #2
  16. Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem cs.DS · 2013 · author #1
  17. Fixed-parameter tractability of multicut in directed acyclic graphs cs.DS · 2012 · author #4
  18. Representative sets and irrelevant vertices: New tools for kernelization cs.DS · 2011 · author #2
  19. Clique cover and graph separation: New incompressibility results cs.DS · 2011 · author #5
  20. Hierarchies of Inefficient Kernelizability cs.CC · 2011 · author #4
  21. Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal cs.DS · 2011 · author #2
  22. Hardness of discrepancy computation and epsilon-net verification in high dimension cs.CG · 2011 · author #3
  23. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements cs.DS · 2010 · author #3

Mentions

  • 1310.2841 #2 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1301.1517 #1 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1202.5749 #4 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1111.2195 #2 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1111.0570 #5 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1110.0976 #4 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1107.3068 #2 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 1103.4503 #3 · backfill · confidence 0.70 Magnus Wahlstr\"om
  • 2605.19055 #5 · arxiv_oai · confidence 0.70 Magnus Wahlstr\"om
  • 1007.0372 #3 · backfill · confidence 0.70 Magnus Wahlstr\"om

Frequent Coauthors