researcher

Magnus Wahlström

44 papers hereh-index 231.9k citations81 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author2
middle author9
last author33

Across the 44 of 44 papers where every author was matched, so the position is known.

fields

cs.DS29
cs.CC7
cs.DM3
math.CO2
cs.CG1
cs.CR1

same name

Magnus Wahlström — 1 paper
Magnus Wahlström — 1 paper, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20092026

most citedCalculation of Discrepancy Measures and Applications

58 citations · 151 across the 35 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Kernelization for list $H$ -coloring for graphs with small vertex cover

Marta Piecyk, Astrid Pieterse, Paweł Rzążewski +1

For a fixed graph $H$ , in the List $H$ -Coloring problem, we are given a graph $G$ along with list $L (v) \subseteq V (H)$ for every $v \in V (G)$ , and we have to determine if there ex…

math.CO2016★ 5 cited

Odd Properly Colored Cycles in Edge-Colored Graphs

Gregory Gutin, Bin Sheng, Magnus Wahlström

It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digrap…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Kernelization for list H-coloring for graphs with small vertex cover

Odd Properly Colored Cycles in Edge-Colored Graphs

Kernelization for list $H$ -coloring for graphs with small vertex cover