Vertex Ranking with Capacity. - Ruben van der Zwaan (SOFSEM, 2010)

How to Cut a Graph into Many Pieces. - Ruben van der Zwaan; André Berger; Alexander Grigoriev (TAMC, 2011)

Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. - André Berger; Heiko Röglin; Ruben van der Zwaan (SEA, 2011)

Reducing a Target Interval to a Few Exact Queries. - Jesper Nederlof; Erik Jan van Leeuwen; Ruben van der Zwaan (MFCS, 2012)

Dynamic pricing problems with elastic demand. - Sebastián Marbán; Ruben van der Zwaan; Alexander Grigoriev; Benjamin Hiller; Tjark Vredeveld (Oper. Res. Lett., 2012)

A Branch and Price Procedure for the Container Premarshalling Problem. - Martijn van Brink; Ruben van der Zwaan (ESA, 2014)

Approximating Real-Time Scheduling on Identical Machines. - Nikhil Bansal 001; Cyriel Rutten; Suzanne van der Ster; Tjark Vredeveld; Ruben van der Zwaan (LATIN, 2014)

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. - Nikhil Bansal 001; Tjark Vredeveld; Ruben van der Zwaan (LATIN, 2014)

Preemptive and non-preemptive generalized min sum set cover. - Sungjin Im; Maxim Sviridenko; Ruben van der Zwaan (Math. Program., 2014)

Complexity and approximability of the k-way vertex cut. - André Berger; Alexander Grigoriev; Ruben van der Zwaan (Networks, 2014)

Scheduling unit-length jobs with precedence constraints of small height. - André Berger; Alexander Grigoriev; Pinar Heggernes; Ruben van der Zwaan (Oper. Res. Lett., 2014)

Internet routing between autonomous systems: Fast algorithms for path trading. - André Berger; Heiko Röglin; Ruben van der Zwaan (Discret. Appl. Math., 2015)

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. - Nikhil Bansal 001; Tim Oosterwijk; Tjark Vredeveld; Ruben van der Zwaan (Algorithmica, 2016)

Minimum Latency Submodular Cover. - Sungjin Im; Viswanath Nagarajan; Ruben van der Zwaan (ACM Trans. Algorithms, 2016)