31 citations · 125 across the 37 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Problems hard for treewidth but easy for stable gonality
Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
We show that some natural problems that are XNLP-hard (which implies W[t]-hardness for all t) when parameterized by pathwidth or treewidth, become FPT when parameterized by stable…
cs.DS2017
Recognizing hyperelliptic graphs in polynomial time
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen +1
Recently, a new set of multigraph parameters was defined, called "gonalities". Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number…