Publications
2022
Scholarly publications
van Dobben de Bruyn, J., Smit, H., & van der Wegen, M. (2022). Discrete and metric divisorial gonality can be different. Journal of Combinatorial Theory. Series A, 189, [105619]. https://doi.org/10.1016/j.jcta.2022.105619
Bodlaender, H. L., Cornelissen, G., & Wegen, M. V. D. (2022). Problems Hard for Treewidth but Easy for Stable Gonality. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers (1 ed., pp. 84-97). (Lecture Notes in Computer Science; Vol. 13453). Springer Cham. https://doi.org/10.1007/978-3-031-15914-5_7
Bodlaender, H. L., Cornelissen, G., & Wegen, M. V. D. (2022). Problems hard for treewidth but easy for stable gonality. (pp. 1-44). arXiv. https://doi.org/10.48550/arXiv.2202.06838
2021
Scholarly publications
Lima, P. T., Leeuwen, E. J. V., & Wegen, M. V. D. (2021). Algorithms for the rainbow vertex coloring problem on graph classes. Theor. Comput. Sci., 887, 122-142. https://doi.org/10.1016/j.tcs.2021.07.009
van der Wegen, M. (2021). Complexity of Graph Problems: Gonality, Colouring and Scheduling. [Doctoral thesis 1 (Research UU / Graduation UU), Universiteit Utrecht]. Utrecht University. https://doi.org/10.33540/709
Bodlaender, H. L., van der Wegen, M., & van der Zanden, T. C. (2021). Stable Divisorial Gonality is in NP. Theory of Computing Systems, 65(2), 428–440. https://doi.org/10.1007/s00224-020-10019-4
2020
Scholarly publications
Bodlaender, H. L., & Wegen, M. V. D. (2020). Parameterized Complexity of Scheduling Chains of Jobs with Delays. In Y. Cao, & M. Pilipczuk (Eds.), 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) (pp. 4:1-4:15). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 180). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.IPEC.2020.4
Lima, P. T., van Leeuwen, E. J., & van der Wegen, M. (2020). Algorithms for the rainbow vertex coloring problem on graph classes. In J. Esparza, & D. Kral (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (pp. 63:1--63:13). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 170). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.63
Gijswijt, D., Smit, H., & van der Wegen, M. (2020). Computing graph gonality is hard. Discrete Applied Mathematics, 287, 134-149. https://doi.org/10.1016/j.dam.2020.08.013
Bodewes, J. M., Bodlaender, H. L., Cornelissen, G., & van der Wegen, M. (2020). Recognizing hyperelliptic graphs in polynomial time. Theoretical Computer Science, 815, 121-146. https://doi.org/10.1016/j.tcs.2020.02.013
2019
Scholarly publications
Groot Koerkamp, R., & van der Wegen, M. (2019). Stable gonality is computable. Discrete Mathematics and Theoretical Computer Science, 21(1). https://dmtcs.episciences.org/5557/pdf
Bodlaender, H. L., Wegen, M. V. D., & Zanden, T. C. V. D. (2019). Stable Divisorial Gonality is in NP. In B. Catania, R. Královič, J. Nawrocki, & G. Pighizzini (Eds.), SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (pp. 81-93). (Lecture Notes in Computer Science; Vol. 11376). Springer. https://doi.org/10.1007/978-3-030-10801-4_8
2018
Scholarly publications
Bodlaender, H. L., Wegen, M. V. D., & Zanden, T. C. V. D. (2018). Stable divisorial gonality is in NP. CoRR, [1808.06921]. http://arxiv.org/abs/1808.06921
Bodewes, J. M., Bodlaender, H. L., Cornelissen, G., & van der Wegen, M. (2018). Recognizing hyperelliptic graphs in polynomial time. In Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings (pp. 52-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11159 LNCS). Springer. https://doi.org/10.1007/978-3-030-00256-5_5
https://dspace.library.uu.nl/bitstream/handle/1874/373730/Recognizing_hyperelliptic_graphs_WG_versie_.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/373730/Recognizing_hyperelliptic_graphs_WG_versie_.pdf?sequence=2