Dion Gijswijt

27 papers A 1C 1Misc 1Journal 24
YearRankTypeTitle / Venue / Authors
2026 J jnl
Exploiting symmetries in optimal quantum circuit design.
Discret. Optim.
Frank de Meijer, Dion Gijswijt, Renata Sotirov
2025 J jnl
Semidefinite lower bounds for covering codes.
CoRR
Dion Gijswijt, Sven C. Polak
2024 J jnl
Automorphism Groups of Cayley Graphs Generated by General Transposition Sets.
Electron. J. Comb.
Dion Gijswijt, Frank de Meijer
2024 J jnl
Automorphism groups of Cayley graphs generated by general transposition sets.
CoRR
Dion Gijswijt, Frank de Meijer
2024 J jnl
Near-Term n to k Distillation Protocols Using Graph Codes.
IEEE J. Sel. Areas Commun.
Kenneth Goodenough, Sébastian de Bone, Vaishnavi L. Addala, Stefan Krastanov, Sarah Jansen, Dion Gijswijt, David Elkouss
2023 J jnl
Blocking sets, minimal codes and trifferent codes.
CoRR
Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi
2023 J jnl
On the Size of Subsets of $\mathbb{F}_q^n$ Avoiding Solutions to Linear Systems with Repeated Columns.
Electron. J. Comb.
Josse van Dobben de Bruyn, Dion Gijswijt
2022 J jnl
Constructing tree decompositions of graphs with bounded gonality.
J. Comb. Optim.
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2022 J jnl
Enumerating all bilocal Clifford distillation protocols through symmetry reduction.
Quantum
Sarah Jansen, Kenneth Goodenough, Sébastian de Bone, Dion Gijswijt, David Elkouss
2021 A conf
Achieving Sybil-Proofness in Distributed Work Systems.
AAMAS
Alexander Stannat, Can Umut Ileri, Dion Gijswijt, Johan Pouwelse
2021 J jnl
Integer packing sets form a well-quasi-ordering.
Oper. Res. Lett.
Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu
2020 J jnl
Computing graph gonality is hard.
Discret. Appl. Math.
Dion Gijswijt, Harry Smit, Marieke van der Wegen
2020 Misc conf
Constructing Tree Decompositions of Graphs with Bounded Gonality.
COCOON
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2020 J jnl
Constructing Tree Decompositions of Graphs with Bounded Gonality.
CoRR
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2018 J jnl
Parallel Machine Scheduling with a Single Resource per Job.
CoRR
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
2015 J jnl
Approximation algorithms for hard capacitated k-facility location problems.
Eur. J. Oper. Res.
Karen I. Aardal, Pieter L. van den Berg, Dion Gijswijt, Shanfei Li
2013 J jnl
An algorithm for weighted fractional matroid matching.
J. Comb. Theory B
Dion Gijswijt, Gyula Pap
2013 J jnl
Approximation algorithms for the capacitated k-facility location problems.
CoRR
Dion Gijswijt, Shanfei Li
2012 J jnl
Polyhedra with the Integer Carathéodory Property.
J. Comb. Theory B
Dion Gijswijt, Guus Regts
2012 J jnl
Semidefinite Code Bounds Based on Quadruple Distances.
IEEE Trans. Inf. Theory
Dion Gijswijt, Hans D. Mittelmann, Alexander Schrijver
2012 J jnl
Violating the Shannon capacity of metric graphs with entanglement
CoRR
Jop Briët, Harry Buhrman, Dion Gijswijt
2007 J jnl
Clique partitioning of interval graphs with submodular costs on the cliques.
RAIRO Oper. Res.
Dion Gijswijt, Vincent Jost, Maurice Queyranne
2006 J jnl
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming.
J. Comb. Theory A
Dion Gijswijt, Alexander Schrijver, Hajime Tanaka
2005 J jnl
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices.
SIAM J. Discret. Math.
Dion Gijswijt
2004 C conf
On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices.
CTW
Dion Gijswijt
2004 J jnl
On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices.
Electron. Notes Discret. Math.
Dion Gijswijt
2003 J jnl
On the b-Stable Set Polytope of Graphs without Bad K
SIAM J. Discret. Math.
Dion Gijswijt, Alexander Schrijver