Algorithms for the universal and a priori TSP. - Frans Schalekamp; David B. Shmoys (Oper. Res. Lett., 2008)

Rank Aggregation: Together We're Strong. - Frans Schalekamp; Anke van Zuylen (ALENEX, 2009)

On the Integrality Gap of the Subtour LP for the 1,2-TSP - Jiawei Qian; Frans Schalekamp; David P. Williamson; Anke van Zuylen (CoRR, 2011)

A proof of the Boyd-Carr conjecture. - Frans Schalekamp; David P. Williamson; Anke van Zuylen (SODA, 2012)

Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane. - Henry Lin; Frans Schalekamp (SPAA, 2012)

On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane - Henry Lin; Frans Schalekamp (CoRR, 2012)

Clustering with or without the approximation. - Frans Schalekamp; Michael Yu; Anke van Zuylen (J. Comb. Optim., 2013)

Scheduling over Scenarios on Two Machines. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (COCOON, 2014)

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (CoRR, 2014)

Popular ranking. - Anke van Zuylen; Frans Schalekamp; David P. Williamson (Discret. Appl. Math., 2014)

2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. - Frans Schalekamp; David P. Williamson; Anke van Zuylen (Math. Oper. Res., 2014)

On the integrality gap of the subtour LP for the 1, 2-TSP. - Jiawei Qian; Frans Schalekamp; David P. Williamson; Anke van Zuylen (Math. Program., 2015)

Split scheduling with uniform setup times. - Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Víctor Verdugo; Anke van Zuylen (J. Sched., 2015)

A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. - Frans Schalekamp; Anke van Zuylen; Suzanne van der Ster (ICALP, 2016)

Optimally Discriminative Choice Sets in Discrete Choice Models: Application to Data-Driven Test Design. - Igor Labutov; Frans Schalekamp; Kelvin Luu; Hod Lipson; Christoph Studer (KDD, 2016)

Flow-based scheme for time-constrained data gathering in wireless sensor networks. - Khaled Almiani; Anastasios Viglas; Frans Schalekamp; Reza Abrishambaf (Int. J. Wirel. Mob. Comput., 2016)

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (Inf. Process. Lett., 2016)

Minimizing worst-case and average-case makespan over scenarios. - Esteban Feuerstein; Alberto Marchetti-Spaccamela; Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (J. Sched., 2017)

Layers and matroids for the traveling salesman's paths. - Frans Schalekamp; András Sebö; Vera Traub; Anke van Zuylen (Oper. Res. Lett., 2018)

GILP: An Interactive Tool for Visualizing the Simplex Algorithm. - Henry W. Robbins; Samuel C. Gutekunst; Frans Schalekamp; David B. Shmoys; David P. Williamson (CoRR, 2022)

A duality based 2-approximation algorithm for maximum agreement forest. - Neil Olver; Frans Schalekamp; Suzanne van der Ster; Leen Stougie; Anke van Zuylen (Math. Program., 2023)