| Computing graph gonality is hard D Gijswijt, H Smit, M van der Wegen Discrete Applied Mathematics 287, 134-149, 2020 | 21 | 2020 |
| 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 | 20 | 2022 |
| 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 | 16 | 2021 |
| Parameterized complexity of scheduling chains of jobs with delays HL Bodlaender, M van der Wegen arXiv preprint arXiv:2007.09023, 2020 | 16 | 2020 |
| Recognizing hyperelliptic graphs in polynomial time JM Bodewes, HL Bodlaender, G Cornelissen, M van der Wegen Theoretical Computer Science 815, 121-146, 2020 | 13 | 2020 |
| 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 | 7 | 2022 |
| Stable gonality is computable RG Koerkamp, M van der Wegen Discrete Mathematics & Theoretical Computer Science 21, 2019 | 6 | 2019 |
| Stable divisorial gonality is in NP HL Bodlaender, M van der Wegen, TC van der Zanden Theory of Computing Systems 65 (2), 428-440, 2021 | 4 | 2021 |
| Stable gonality of graphs M van der Wegen | 4 | 2017 |
| 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 | 3 | 2019 |
| Computing graph gonality is hard D Gijswijt, H Smit, M van der Wegen arXiv preprint arXiv:1504.06713, 2015 | 2 | 2015 |
| Complexity of Graph Problems: Gonality, Colouring and Scheduling M van der Wegen | | 2021 |
| Complexity of Graph Problems: Gonality, Colouring and Scheduling M Wegen Utrecht University, 2021 | | 2021 |
| LIPIcs, Volume 180, IPEC 2020, Complete Volume}} Y Cao, M Pilipczuk, A Agrawal, MS Ramanujan, HL Bodlaender, ... 15th International Symposium on Parameterized and Exact Computation (IPEC …, 2020 | | 2020 |
| 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) A Agrawal, MS Ramanujan, J Bang-Jensen, E Eiben, G Gutin, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |
| 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 | | |
