Follow
Marieke van der Wegen
Marieke van der Wegen
Verified email at uu.nl
Title
Cited by
Cited by
Year
Computing graph gonality is hard
D Gijswijt, H Smit, M van der Wegen
Discrete Applied Mathematics 287, 134-149, 2020
162020
Problems hard for treewidth but easy for stable gonality
HL Bodlaender, G Cornelissen, M van der Wegen
International Workshop on Graph-Theoretic Concepts in Computer Science, 84-97, 2022
142022
Recognizing hyperelliptic graphs in polynomial time
JM Bodewes, HL Bodlaender, G Cornelissen, M van der Wegen
Theoretical Computer Science 815, 121-146, 2020
132020
Parameterized complexity of scheduling chains of jobs with delays
HL Bodlaender, M van der Wegen
arXiv preprint arXiv:2007.09023, 2020
112020
Algorithms for the rainbow vertex coloring problem on graph classes
PT Lima, EJ van Leeuwen, M van der Wegen
Theoretical Computer Science 887, 122-142, 2021
102021
Stable gonality is computable
RG Koerkamp, M van der Wegen
Discrete Mathematics & Theoretical Computer Science 21, 2019
52019
Stable gonality of graphs
M van der Wegen
42017
Discrete and metric divisorial gonality can be different
JD de Bruyn, H Smit, M van der Wegen
Journal of Combinatorial Theory, Series A 189, 105619, 2022
32022
Stable divisorial gonality is in NP
HL Bodlaender, M van der Wegen, TC van der Zanden
Theory of Computing Systems 65, 428-440, 2021
32021
Stable divisorial gonality is in NP
HL Bodlaender, M van der Wegen, TC van der Zanden
International Conference on Current Trends in Theory and Practice of …, 2019
32019
Computing graph gonality is hard
D Gijswijt, H Smit, M van der Wegen
arXiv preprint arXiv:1504.06713, 2015
22015
Complexity of Graph Problems: Gonality, Colouring and Scheduling
M Wegen
Utrecht University, 2021
2021
Priemontbinding in kwadratische lichamen
M Wegen
2015
Recognizing Hyperelliptic Graphs in Polynomial Time
M van der Wegen
Graph-Theoretic Concepts in Computer Science LNCS 11159, 52, 0
The system can't perform the operation now. Try again later.
Articles 1–14