The Stackelberg Kidney Exchange Problem is Σ2p-complete. - Bart Smeulders; Danny Blom; Frits C. R. Spieksma (CoRR, 2020)

Filling a theatre in times of corona. - Danny Blom; Rudi Pendavingh; Frits C. R. Spieksma (CoRR, 2020)

Rejection-proof Kidney Exchange Mechanisms. - Danny Blom; Bart Smeulders; Frits C. R. Spieksma (CoRR, 2022)

Filling a Theater During the COVID-19 Pandemic. - Danny Blom; Rudi Pendavingh; Frits C. R. Spieksma (INFORMS J. Appl. Anal., 2022)

Approximation Algorithms for k-Scenario Matching. - Danny Blom; Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Bart Smeulders (WAOA, 2024)

Rejection-proof mechanisms for multi-agent kidney exchange. - Danny Blom; Bart Smeulders; Frits C. R. Spieksma (Games Econ. Behav., 2024)

Identifying optimal strategies in kidney exchange games is $ varSigma _2^p$-complete. - Bart Smeulders; Danny Blom; Frits C. R. Spieksma (Math. Program., 2024)

Cutting Plane Approaches for the Robust Kidney Exchange Problem. - Danny Blom; Christopher Hojny; Bart Smeulders (Comput. Oper. Res., 2024)