On the b-Stable Set Polytope of Graphs without Bad K4. - Dion Gijswijt; Alexander Schrijver (SIAM J. Discret. Math., 2003)

On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices. - Dion Gijswijt (CTW, 2004)

On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices. - Dion Gijswijt (Electron. Notes Discret. Math., 2004)

Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices. - Dion Gijswijt (SIAM J. Discret. Math., 2005)

New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. - Dion Gijswijt; Alexander Schrijver; Hajime Tanaka 001 (J. Comb. Theory A, 2006)

Clique partitioning of interval graphs with submodular costs on the cliques. - Dion Gijswijt; Vincent Jost; Maurice Queyranne (RAIRO Oper. Res., 2007)

Violating the Shannon capacity of metric graphs with entanglement - Jop Briët; Harry Buhrman; Dion Gijswijt (CoRR, 2012)

Polyhedra with the Integer Carathéodory Property. - Dion Gijswijt; Guus Regts (J. Comb. Theory B, 2012)

Semidefinite Code Bounds Based on Quadruple Distances. - Dion Gijswijt; Hans D. Mittelmann; Alexander Schrijver (IEEE Trans. Inf. Theory, 2012)

Approximation algorithms for the capacitated k-facility location problems. - Dion Gijswijt; Shanfei Li (CoRR, 2013)

An algorithm for weighted fractional matroid matching. - Dion Gijswijt; Gyula Pap (J. Comb. Theory B, 2013)

Approximation algorithms for hard capacitated k-facility location problems. - Karen I. Aardal; Pieter L. van den Berg; Dion Gijswijt; Shanfei Li (Eur. J. Oper. Res., 2015)

Parallel Machine Scheduling with a Single Resource per Job. - Teun Janssen; Céline M. F. Swennenhuis; Abdoul Bitar; Thomas Bosman; Dion Gijswijt; Leo van Iersel; Stéphane Dauzère-Pérès; Claude Yugma (CoRR, 2018)

Computing graph gonality is hard. - Dion Gijswijt; Harry Smit; Marieke van der Wegen (Discret. Appl. Math., 2020)

Achieving Sybil-Proofness in Distributed Work Systems. - Alexander Stannat; Can Umut Ileri; Dion Gijswijt; Johan Pouwelse (AAMAS, 2021)

Integer packing sets form a well-quasi-ordering. - Alberto Del Pia; Dion Gijswijt; Jeff T. Linderoth; Haoran Zhu (Oper. Res. Lett., 2021)

Constructing tree decompositions of graphs with bounded gonality. - Hans L. Bodlaender; Josse van Dobben de Bruyn; Dion Gijswijt; Harry Smit (J. Comb. Optim., 2022)

Enumerating all bilocal Clifford distillation protocols through symmetry reduction. - Sarah Jansen; Kenneth Goodenough; Sébastian de Bone; Dion Gijswijt; David Elkouss (Quantum, 2022)

On the Size of Subsets of $ mathbb{F}_q^n$ Avoiding Solutions to Linear Systems with Repeated Columns. - Josse van Dobben de Bruyn; Dion Gijswijt (Electron. J. Comb., 2023)

Blocking sets, minimal codes and trifferent codes. - Anurag Bishnoi; Jozefien D'haeseleer; Dion Gijswijt; Aditya Potukuchi (CoRR, 2023)

Automorphism Groups of Cayley Graphs Generated by General Transposition Sets. - Dion Gijswijt; Frank de Meijer (Electron. J. Comb., 2024)

Near-Term n to k Distillation Protocols Using Graph Codes. - Kenneth Goodenough; Sébastian de Bone; Vaishnavi L. Addala; Stefan Krastanov; Sarah Jansen; Dion Gijswijt; David Elkouss (IEEE J. Sel. Areas Commun., 2024)

Semidefinite lower bounds for covering codes. - Dion Gijswijt; Sven C. Polak (CoRR, 2025)