


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Magnus Wahlström
Royal Holloway, University of London, UK
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 150 matches
- 2024
- Eun Jung Kim
, Tomás Masarík
, Marcin Pilipczuk
, Roohani Sharma, Magnus Wahlström
:
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38(1): 170-189 (2024) - Eun Jung Kim
, Stefan Kratsch
, Marcin Pilipczuk
, Magnus Wahlström
:
Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms 20(2): 12 (2024) - George Osipov, Marcin Pilipczuk, Magnus Wahlström:
Parameterized Complexity of MinCSP over the Point Algebra. ESA 2024: 93:1-93:15 - Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. SODA 2024: 377-423 - Magnus Wahlström:
Representative set statements for delta-matroids and the Mader delta-matroid. SODA 2024: 780-810 - Tomohiro Koana, Magnus Wahlström:
Faster algorithms on linear delta-matroids. CoRR abs/2402.11596 (2024) - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR abs/2410.09932 (2024) - 2023
- Carl Einarson
, Gregory Z. Gutin, Bart M. P. Jansen
, Diptapriyo Majumdar
, Magnus Wahlström
:
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133: 23-40 (2023) - Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
:
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940(Part): 222-230 (2023) - George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. ESA 2023: 86:1-86:17 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA 2023: 3218-3228 - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. SODA 2023: 3179-3217 - Neeldhara Misra
, Magnus Wahlström
:
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands. LIPIcs 285, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-305-8 [contents] - Eduard Eiben, Tomohiro Koana, Magnus Wahlström:
Determinantal Sieving. CoRR abs/2304.02091 (2023) - George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. CoRR abs/2305.11131 (2023) - Magnus Wahlström:
Representative set statements for delta-matroids and the Mader delta-matroid. CoRR abs/2306.03605 (2023) - 2022
- Jørgen Bang-Jensen
, Eduard Eiben, Gregory Z. Gutin
, Magnus Wahlström, Anders Yeo
:
Component Order Connectivity in Directed Graphs. Algorithmica 84(9): 2767-2784 (2022) - Lukasz Kowalik
, Shaohua Li
, Wojciech Nadara
, Marcin Smulewicz
, Magnus Wahlström
:
Many-visits TSP revisited. J. Comput. Syst. Sci. 124: 112-128 (2022) - Magnus Wahlström:
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms 18(2): 15:1-15:19 (2022) - Victor Lagerkvist, Magnus Wahlström:
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14(1): 2:1-2:54 (2022) - Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC 2022: 11:1-11:17 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. STOC 2022: 938-947 - Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR abs/2207.07422 (2022) - Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. CoRR abs/2208.02732 (2022) - Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the parameterized complexity of symmetric directed multicut. CoRR abs/2208.09017 (2022) - Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On weighted graph separation problems and flow-augmentation. CoRR abs/2208.14841 (2022) - 2021
- Gregory Z. Gutin, Diptapriyo Majumdar
, Sebastian Ordyniak
, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021) - Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - Gregory Z. Gutin, Magnus Wahlström
, Meirav Zehavi:
r-Simple k-Path and Related Problems Parameterized by k/r. ACM Trans. Algorithms 17(1): 10:1-10:64 (2021) - Zhiyang He
, Jason Li, Magnus Wahlström:
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA 2021: 52:1-52:14
skipping 120 more matches
loading more results
failed to load more results, please try again later

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-14 21:25 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint