Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. - Bart M. P. Jansen; Bart van der Steenhoven (IPEC, 2023)

Simply Realising an Imprecise Polyline is NP-hard. - Thijs van der Horst; Tim Ophelders; Bart van der Steenhoven (CoRR, 2023)