Magnus Wahlström

2.0k total citations
49 papers, 510 citations indexed

About

Magnus Wahlström is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Magnus Wahlström has authored 49 papers receiving a total of 510 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in Magnus Wahlström's work include Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (28 papers) and Optimization and Search Problems (7 papers). Magnus Wahlström is often cited by papers focused on Advanced Graph Theory Research (36 papers), Complexity and Algorithms in Graphs (28 papers) and Optimization and Search Problems (7 papers). Magnus Wahlström collaborates with scholars based in United Kingdom, Germany and Poland. Magnus Wahlström's co-authors include Stefan Kratsch, Gregory Gutin, Peter Jönsson, Marcin Pilipczuk, Michael Gnewuch, Mark Jones, Yoichi Iwata, Yuichi Yoshida, Anders Yeo and Michał Pilipczuk and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Numerical Analysis and SIAM Journal on Computing.

In The Last Decade

Magnus Wahlström

44 papers receiving 455 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Magnus Wahlström United Kingdom 14 384 135 96 62 32 49 510
Andreas Björklund Sweden 12 497 1.3× 187 1.4× 125 1.3× 105 1.7× 54 1.7× 35 668
Samuel Fiorini Belgium 14 399 1.0× 127 0.9× 119 1.2× 56 0.9× 113 3.5× 70 630
Stefan Kratsch Germany 15 553 1.4× 188 1.4× 110 1.1× 84 1.4× 54 1.7× 56 672
Stasys Jukna Germany 9 397 1.0× 111 0.8× 245 2.6× 76 1.2× 87 2.7× 42 571
Ingo Althöfer Germany 9 277 0.7× 146 1.1× 145 1.5× 40 0.6× 90 2.8× 38 545
Pascal Schweitzer Germany 11 207 0.5× 140 1.0× 86 0.9× 51 0.8× 40 1.3× 38 415
Uri N. Peled United States 14 423 1.1× 165 1.2× 94 1.0× 130 2.1× 110 3.4× 47 707
Hiromu Ariyoshi Japan 4 268 0.7× 109 0.8× 98 1.0× 57 0.9× 62 1.9× 13 436
Toshihiro Fujito Japan 10 287 0.7× 193 1.4× 45 0.5× 22 0.4× 37 1.2× 25 386
Yuval Filmus Israel 10 157 0.4× 78 0.6× 122 1.3× 59 1.0× 37 1.2× 53 300

Countries citing papers authored by Magnus Wahlström

Since Specialization
Citations

This map shows the geographic impact of Magnus Wahlström's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Magnus Wahlström with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Magnus Wahlström more than expected).

Fields of papers citing papers by Magnus Wahlström

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Magnus Wahlström. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Magnus Wahlström. The network helps show where Magnus Wahlström may publish in the future.

Co-authorship network of co-authors of Magnus Wahlström

This figure shows the co-authorship network connecting the top 25 collaborators of Magnus Wahlström. A scholar is included among the top collaborators of Magnus Wahlström based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Magnus Wahlström. Magnus Wahlström is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kim, Eun Jung, Stefan Kratsch, Marcin Pilipczuk, & Magnus Wahlström. (2024). Flow-augmentation I: Directed graphs. Journal of the ACM. 72(1). 1–38.
2.
Kim, Eun Jung, et al.. (2024). On Weighted Graph Separation Problems and Flow Augmentation. SIAM Journal on Discrete Mathematics. 38(1). 170–189. 1 indexed citations
3.
Wahlström, Magnus, et al.. (2021). The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. KTH Publication Database DiVA (KTH Royal Institute of Technology). 14(1). 1–54.
4.
Kratsch, Stefan & Magnus Wahlström. (2020). Representative Sets and Irrelevant Vertices. Journal of the ACM. 67(3). 1–50. 13 indexed citations
5.
Gutin, Gregory, Felix Reidl, Magnus Wahlström, & Meirav Zehavi. (2018). Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. Journal of Computer and System Sciences. 95. 69–85. 3 indexed citations
6.
Cygan, Marek, Fedor V. Fomin, Danny Hermelin, & Magnus Wahlström. (2017). Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
7.
Gutin, Gregory, Magnus Wahlström, & Anders Yeo. (2016). Rural postman parameterized by the number of components of required edges. Journal of Computer and System Sciences. 83(1). 121–131. 5 indexed citations
8.
Cygan, Marek, Holger Dell, Daniel Lokshtanov, et al.. (2016). On Problems as Hard as CNF-SAT. ACM Transactions on Algorithms. 12(3). 1–24. 30 indexed citations
9.
Wahlström, Magnus, et al.. (2016). The power of primitive positive definitions with polynomially many variables. Journal of Logic and Computation. exw005–exw005. 7 indexed citations
10.
Gutin, Gregory, et al.. (2016). Chinese Postman Problem on edge-colored multigraphs. Discrete Applied Mathematics. 217. 196–202. 12 indexed citations
11.
Iwata, Yoichi, Magnus Wahlström, & Yuichi Yoshida. (2016). Half-integrality, LP-branching, and FPT Algorithms. SIAM Journal on Computing. 45(4). 1377–1411. 22 indexed citations
12.
Kratsch, Stefan, Dániel Marx, & Magnus Wahlström. (2016). Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. 8(1). 1–28. 3 indexed citations
13.
Gutin, Gregory, Stefan Kratsch, & Magnus Wahlström. (2015). Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica. 75(2). 383–402. 3 indexed citations
14.
Wahlström, Magnus. (2014). Half-integrality, LP-branching and FPT algorithms. arXiv (Cornell University). 1762–1781. 17 indexed citations
15.
Gutin, Gregory, Magnus Wahlström, & Anders Yeo. (2013). Parameterized Rural Postman and Conjoining Bipartite Matching Problems.. arXiv (Cornell University). 3 indexed citations
16.
Kratsch, Stefan & Magnus Wahlström. (2013). Two edge modification problems without polynomial kernels. Discrete Optimization. 10(3). 193–199. 19 indexed citations
17.
Kratsch, Stefan & Magnus Wahlström. (2012). Representative Sets and Irrelevant Vertices: New Tools for Kernelization. 450–459. 37 indexed citations
18.
Giannopoulos, Panos, et al.. (2011). Hardness of discrepancy computation and ε-net verification in high dimension. Journal of Complexity. 28(2). 162–176. 13 indexed citations
19.
Doerr, Benjamin, Michael Gnewuch, & Magnus Wahlström. (2010). Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. Journal of Complexity. 26(5). 490–507. 10 indexed citations
20.
Jönsson, Peter, et al.. (2004). Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science. 332(1-3). 265–291. 43 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Andreas Björklund Breakdown of academic impact, for papers by Samuel Fiorini Breakdown of academic impact, for papers by Stefan Kratsch Breakdown of academic impact, for papers by Stasys Jukna Breakdown of academic impact, for papers by Ingo Althöfer Breakdown of academic impact, for papers by Pascal Schweitzer Breakdown of academic impact, for papers by Uri N. Peled Breakdown of academic impact, for papers by Hiromu Ariyoshi Breakdown of academic impact, for papers by Toshihiro Fujito Breakdown of academic impact, for papers by Yuval Filmus
Rankless by CCL
2026