Magnus Wahlström
- Representative sets and irrelevant vertices: New tools for kernelization
2011/11/09 by Stefan Kratsch, Magnus Wahlström, Kratsch, Stefan +1 · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory
- Half-integrality, LP-branching and FPT Algorithms
2013/10/10 by Yoichi Iwata, Iwata, Yoichi, Magnus Wahlström +3 · 4 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
- Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
2013/01/08 by Magnus Wahlström, Wahlström, Magnus · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods
- Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
2022/07/15 by Eun Jung Kim, Stefan Kratsch, Kim, Eun Jung +5 · 4 citations
Computer Science · #Constraint Satisfaction and Optimization #Formal Methods in Verification #semigroups and automata theory
- Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
2011/07/15 by Stefan Kratsch, Magnus Wahlström, Kratsch, Stefan +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Advanced Graph Theory Research
- Parameterized Two-Player Nash Equilibrium
2010/06/10 by Danny Hermelin, Hermelin, Danny, Chien‐Chung Huang +5 · 1 citation
Decision Sciences · Economics, Econometrics and Finance · #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems
- Clique cover and graph separation: New incompressibility results
2011/11/02 by Marek Cygan, Stefan Kratsch, Cygan, Marek +7 · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Optimization and Search Problems
- Fixed-parameter tractability of multicut in directed acyclic graphs
2012/02/26 by Stefan Kratsch, Kratsch, Stefan, Marcin Pilipczuk +5 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Protein Degradation and Inhibitors
- On the parameterized complexity of symmetric directed multicut
2022/08/18 by Eduard Eiben, Eiben, Eduard, Clément Rambaud +3 · 1 citation
Computer Science · #68Q27 #68R10 #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.2 #semigroups and automata theory