Stable gonality is computable. - Ragnar Groot Koerkamp; Marieke van der Wegen (Discret. Math. Theor. Comput. Sci., 2019)

Parameterized Complexity of Scheduling Chains of Jobs with Delays. - Hans L. Bodlaender; Marieke van der Wegen (IPEC, 2020)

Computing graph gonality is hard. - Dion Gijswijt; Harry Smit; Marieke van der Wegen (Discret. Appl. Math., 2020)

Recognizing hyperelliptic graphs in polynomial time. - Jelco M. Bodewes; Hans L. Bodlaender; Gunther Cornelissen; Marieke van der Wegen (Theor. Comput. Sci., 2020)

Stable Divisorial Gonality is in NP. - Hans L. Bodlaender; Marieke van der Wegen; Tom C. van der Zanden (Theory Comput. Syst., 2021)

Algorithms for the rainbow vertex coloring problem on graph classes. - Paloma T. Lima; Erik Jan van Leeuwen; Marieke van der Wegen (Theor. Comput. Sci., 2021)

Problems Hard for Treewidth but Easy for Stable Gonality. - Hans L. Bodlaender; Gunther Cornelissen; Marieke van der Wegen (WG, 2022)

Discrete and metric divisorial gonality can be different. - Josse van Dobben de Bruyn; Harry Smit; Marieke van der Wegen (J. Comb. Theory A, 2022)