| Enumerating all bilocal Clifford distillation protocols through symmetry reduction, with S. Jansen, K. Goodenough, S. de Bone, D. Elkouss, Quantum 6 (2022) | arXiv DOI |
| Achieving sybil-proofness in distributed work systems, with A. Stannat, C.U. Lieri, J. Pouwelse, AAMAS'21 (2021) | PDF DOI |
| Integer packing sets form a well-quasi-ordering, with A. Del Pia, J. Linderoth, H. Zu, OR Letters 49(2) (2021) | arXiv DOI |
| Constructing tree decompositions of graphs with bounded gonality, with H.L. Bodlaender, J. van Dobben de Bruyn, H. Smit, International Computing and Combinatorics Conference (2020) | arXiv DOI |
| Treewidth is a lower bound on graph gonality, with J. van Dobben de Bruyn, Algebraic Combinatorics vol 3.4 (2020) | arXiv DOI |
| Computing graph gonality is hard, with H. Smit, M. van der Wegen, Discrete Applied Mathematics vol 287 (2020) | arXiv DOI |
| On large subsets of (Fq)n with no three-term arithmetic progression, with J.S. Ellenberg, D. Gijswijt, Annals of Mathematics, vol 185 (2017) | arXiv DOI |
| On the constant in a transference inequality for the vector-valued Fourier transform, with J. van Neerven, AJMAA 13.1 (2016) | arXiv Pub |
| Approximation Algorithms for Hard Capacitated k-facility Location Problems, with K. Aardal, P. van den Berg, S. Li, European Journal of Operational Research 242.2 (2015) | arXiv DOI |
| An algorithm for weighted fractional matroid matching, with Gy. Pap, Journal of Combinatorial Theory, series B 103 (2013) | arXiv DOI |
| Violating the Shannon capacity of metric graphs with entanglement, with J. Briët, H. Buhrman, PNAS 110.48 (2013) | arXiv DOI |
| Polyhedra with the integer Caratheodory property, with G. Regts, Journal of Combinatorial Theory, Series B 102 (2012) | arXiv DOI |
| Characterizing partition functions of the vertex model, with J. Draisma, L. Lovász, G. Regts, A. Schrijver, Journal of Algebra 350 (2012) | arXiv DOI |
| Invariant semidefinite programs, with C. Bachoc, A. Schrijver, F. Vallentin, in: Handbook on Semidefinite, Conic and Polynomial Optimization (M.F. Anjos, J.B. Lasserre, eds.), 2012 | arXiv DOI |
| Semidefinite code bounds based on quadruple distances, with H.D. Mittelmann, A. Schrijver, IEEE Transactions on Information Theory 58 (2012) | arXiv DOI |
| Clique partitioning of interval graphs with submodular costs on the cliques, with V. Jost, M. Queyranne, RAIRO 41 (3) (2007) | DOI |
| A Slow-Growing Sequence Defined by an Unusual Recurrence, with F.J. van de Bult, J.P. Linderman, N.J.A. Sloane, A.R. Wilks, Journal of integer sequences 10 (1) (2007) | arXiv PID |
| New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, with A. Schrijver, H. Tanaka, Journal of Comb. Theory, Series A 113 (8) (2006) | PDF DOI |
| Integer decomposition for polyhedra defined by nearly totally unimodular matrices, SIAM Journal on Discrete Mathematics 19.3 (2005) | PDF DOI |
| A combinatorial identity arising from cobordism theory, with P. Moree, Acta Math. Univ. Comenian. (N.S.) 74.2 (2005) | arXiv PDF |
| On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices, Electron. Notes Discrete Math., 17 (2004) | PDF DOI |
.
| On the b-stable set polytope of graphs without bad K4, with A. Schrijver, SIAM Journal on Discrete Mathematics 16.3 (2003) | PDF DOI |
The following manuscripts have been largely absorbed by other papers and will not be published.
