From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. - Jochen Könemann; Stefano Leonardi 001; Guido Schäfer; Stefan H. M. van Zwam (ICALP, 2005)

New Korkin–Zolotarev Inequalities. - Rudi Pendavingh; Stefan H. M. van Zwam (SIAM J. Optim., 2007)

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. - Jochen Könemann; Stefano Leonardi 001; Guido Schäfer; Stefan H. M. van Zwam (SIAM J. Comput., 2008)

Lifts of matroid representations over partial fields. - Rudi Pendavingh; Stefan H. M. van Zwam (J. Comb. Theory B, 2010)

Confinement of matroid representations to subsets of partial fields. - Rudi Pendavingh; Stefan H. M. van Zwam (J. Comb. Theory B, 2010)

The excluded minors for near-regular matroids. - Rhiannon Hall; Dillon Mayhew; Stefan H. M. van Zwam (Eur. J. Comb., 2011)

An Obstacle to a Decomposition Theorem for Near-Regular Matroids. - Dillon Mayhew; Geoff Whittle; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2011)

Stability, fragility, and Rotaʼs Conjecture. - Dillon Mayhew; Geoff Whittle; Stefan H. M. van Zwam (J. Comb. Theory B, 2012)

The structure of graphs with a vital linkage of order 2. - Dillon Mayhew; Geoff Whittle; Stefan H. M. van Zwam (J. Graph Theory, 2012)

On the relative importance of excluded minors. - Rhiannon Hall; Dillon Mayhew; Stefan H. M. van Zwam (Adv. Appl. Math., 2013)

Skew partial fields, multilinear representations of matroids, and a matrix tree theorem. - Rudi Pendavingh; Stefan H. M. van Zwam (Adv. Appl. Math., 2013)

Intertwining Connectivities in Representable Matroids. - Tony Huynh; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2014)

Fan-Extensions in Fragile Matroids. - Carolyn Chun; Deborah Chun; Dillon Mayhew; Stefan H. M. van Zwam (Electron. J. Comb., 2015)

The maximum-likelihood decoding threshold for graphic codes. - Peter Nelson; Stefan H. M. van Zwam (CoRR, 2015)

Matroid 3-connectivity and branch width. - Jim Geelen; Stefan H. M. van Zwam (J. Comb. Theory B, 2015)

Matroids Representable Over Fields With a Common Subfield. - Peter Nelson; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2015)

On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes. - Peter Nelson; Stefan H. M. van Zwam (IEEE Trans. Inf. Theory, 2015)

The Structure of U2, 5, U3, 5-Fragile Matroids. - Ben Clark; Dillon Mayhew; Stefan H. M. van Zwam; Geoff Whittle (SIAM J. Discret. Math., 2016)

The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs. - Peter Nelson; Stefan H. M. van Zwam (IEEE Trans. Inf. Theory, 2016)

Templates for Binary Matroids. - Kevin Grace 001; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2017)

Relaxations of GF(4)-Representable Matroids. - Ben Clark; James G. Oxley; Stefan H. M. van Zwam (Electron. J. Comb., 2018)

The Highly Connected Even-Cycle and Even-Cut Matroids. - Kevin Grace 001; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2019)

On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids. - Ben Clark; Kevin Grace 001; James G. Oxley; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2021)

Learn to Create Neighborhoods in Real-World Vehicle Routing Problem. - Willem Feijen; Koen Dekker; Stefan H. M. van Zwam (LOD (1), 2024)