Dion Gijswijt

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 12

Top Topics

Constant Factor Approximation

Approximation Algorithms

Complexity Bounds

Tree Decompositions

Top Venues

Oper. Res. Lett.

IEEE J. Sel. Areas Commun.

Publications

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