| 2026 | WALCOM | Disjoint Tours and the Price of Diversity. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2025 | ATMOS | Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study. | Christopher Hojny, Frits C. R. Spieksma, Sten Wessel |
| 2025 | ISAAC | Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2024 | WALCOM | Stable and Dynamic Minimum Cuts. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2023 | ISAAC | Finding Diverse Minimum s-t Cuts. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2022 | ISAAC | Package Delivery Using Drones with Restricted Movement Areas. | Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma |
| 2021 | CPAIOR | The Traveling Social Golfer Problem: The Case of the Volleyball Nations League. | Roel Lambers, Laurent Rothuizen, Frits C. R. Spieksma |
| 2020 | COCOON | Approximation Algorithms for Car-Sharing Problems. | Kelin Luo, Frits C. R. Spieksma |
| 2018 | ISAAC | Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. | Annette M. C. Ficker, Thomas Erlebach, Mats Mihalk, Frits C. R. Spieksma |
| 2016 | IPCO | Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. | Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma |
| 2016 | WAOA | Balanced Optimization with Vector Costs. | Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2014 | ATMOS | Mathematical programming models for scheduling locks in sequence. | Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma |
| 2012 | WALCOM | Approximating the Multi-level Bottleneck Assignment Problem. | Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma |
| 2012 | WAOA | Approximation Algorithms for the Wafer to Wafer Integration Problem. | Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma |
| 2011 | ATMOS | The Lockmaster's problem. | Sofie Coene, Frits C. R. Spieksma |
| 2010 | AAIM | Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. | Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma |
| 2010 | ATMOS | Heuristics for the Traveling Repairman Problem with Profits. | Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen |
| 2010 | SODA | The Focus of Attention Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2009 | WAOA | Between a Rock and a Hard Place: The Two-to-One Assignment Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2004 | ESA | Approximation of Rectangle Stabbing and Interval Stabbing Problems. | Sofia Kovaleva, Frits C. R. Spieksma |
| 2003 | CIAC | Approximation of a Retrieval Problem for Parallel Disks. | Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma |
| 2001 | ISAAC | Approximation of a Geometric Set Covering Problem. | Sofia Kovaleva, Frits C. R. Spieksma |
| 2000 | ISAAC | Simple Algorithms for a Weighted Interval Selection Problem. | Thomas Erlebach, Frits C. R. Spieksma |
| 1997 | SODA | Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. | S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma |
| 1995 | IPCO | Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. | Yves Crama, Frits C. R. Spieksma |
| 1993 | IPCO | A general class of greedily solvable linear programs. | Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella |