Magnus Wahlström
Royal Holloway, University of London
H-index: 28
Europe-United Kingdom
Top articles of Magnus Wahlström
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Representative set statements for delta-matroids and the Mader delta-matroid | Magnus Wahlström | 2024 | |
On Weighted Graph Separation Problems and Flow Augmentation | SIAM Journal on Discrete Mathematics | Eun Jung Kim Tomáš Masařík Marcin Pilipczuk Roohani Sharma Magnus Wahlström | 2024/3/31 |
Determinantal sieving | Eduard Eiben Tomohiro Koana Magnus Wahlström | 2024 | |
Flow-augmentation II: Undirected graphs | ACM Transactions on Algorithms | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2024/3/13 |
Faster algorithms on linear delta-matroids | arXiv preprint arXiv:2402.11596 | Tomohiro Koana Magnus Wahlström | 2024/2/18 |
ACM Transactions on | ACM Transactions on | Edith Cohen Susanne Albers Glencora Borradaile Andrei A Bulatov Keren Censor-Hillel | 2023 |
p-edge/vertex-connected vertex cover: Parameterized and approximation algorithms | Journal of Computer and System Sciences | Carl Einarson Gregory Gutin Bart MP Jansen Diptapriyo Majumdar Magnus Wahlström | 2023/5/1 |
Preference swaps for the stable matching problem | Theoretical Computer Science | Eduard Eiben Gregory Gutin Philip R Neary Clément Rambaud Magnus Wahlström | 2023/1/9 |
LIPIcs, Volume 285, IPEC 2023, Complete Volume | Neeldhara Misra Magnus Wahlström | 2023 | |
Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) | Fauna norvegica | Torbjørn Ekrem Elisabeth Stur Kaare Aagaard | 2012/10/17 |
Almost consistent systems of linear equations | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov Magnus Wahlström | 2023 | |
18th International Symposium on Parameterized and Exact Computation | Neeldhara Misra Magnus Wahlström | 2023/12 | |
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2023 | |
Parameterized Complexity of Equality MinCSP | arXiv preprint arXiv:2305.11131 | George Osipov Magnus Wahlström | 2023/5/18 |
Component order connectivity in directed graphs | Algorithmica | Jørgen Bang-Jensen Eduard Eiben Gregory Gutin Magnus Wahlström Anders Yeo | 2022/9 |
On the parameterized complexity of symmetric directed multicut | arXiv preprint arXiv:2208.09017 | Eduard Eiben Clément Rambaud Magnus Wahlström | 2022/8/18 |
Directed flow-augmentation | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2022/6/9 | |
Quasipolynomial multicut-mimicking networks and kernels for multiway cut problems | ACM Transactions on Algorithms (TALG) | Magnus Wahlström | 2022/3/4 |
Many-visits TSP revisited | Journal of Computer and System Sciences | Łukasz Kowalik Shaohua Li Wojciech Nadara Marcin Smulewicz Magnus Wahlström | 2022 |
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems | ACM Transactions on Computation Theory (TOCT) | Victor Lagerkvist Magnus Wahlström | 2021/12/15 |
