default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDion Gijswijt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]Dion Gijswijt, Frank de Meijer
:
Automorphism Groups of Cayley Graphs Generated by General Transposition Sets. Electron. J. Comb. 31(3) (2024)- [j15]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): 1830-1849 (2024) - 2023
- [j14]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) - 2022
- [j13]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): 2681-2699 (2022) - [j12]Sarah Jansen, Kenneth Goodenough, Sébastian de Bone, Dion Gijswijt, David Elkouss:
Enumerating all bilocal Clifford distillation protocols through symmetry reduction. Quantum 6: 715 (2022) - 2021
- [j11]Alberto Del Pia, Dion Gijswijt, Jeff T. Linderoth, Haoran Zhu:
Integer packing sets form a well-quasi-ordering. Oper. Res. Lett. 49(2): 226-230 (2021) - 2020
- [j10]Dion Gijswijt, Harry Smit, Marieke van der Wegen:
Computing graph gonality is hard. Discret. Appl. Math. 287: 134-149 (2020) - 2015
- [j9]Karen I. 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): 358-368 (2015) - 2013
- [j8]Dion Gijswijt, Gyula Pap:
An algorithm for weighted fractional matroid matching. J. Comb. Theory B 103(4): 509-520 (2013) - 2012
- [j7]Dion Gijswijt, Guus Regts:
Polyhedra with the Integer Carathéodory Property. J. Comb. Theory B 102(1): 62-70 (2012) - [j6]Dion Gijswijt, Hans D. Mittelmann, Alexander Schrijver:
Semidefinite Code Bounds Based on Quadruple Distances. IEEE Trans. Inf. Theory 58(5): 2697-2705 (2012) - 2007
- [j5]Dion Gijswijt, Vincent Jost, Maurice Queyranne:
Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO Oper. Res. 41(3): 275-287 (2007) - 2006
- [j4]Dion Gijswijt, Alexander Schrijver, Hajime Tanaka:
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory A 113(8): 1719-1731 (2006) - 2005
- [j3]Dion Gijswijt:
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices. SIAM J. Discret. Math. 19(3): 798-806 (2005) - 2004
- [j2]Dion Gijswijt:
On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices. Electron. Notes Discret. Math. 17: 175-178 (2004) - 2003
- [j1]Dion Gijswijt, Alexander Schrijver:
On the b-Stable Set Polytope of Graphs without Bad K4. SIAM J. Discret. Math. 16(3): 511-516 (2003)
Conference and Workshop Papers
- 2021
- [c3]Alexander Stannat, Can Umut Ileri, Dion Gijswijt, Johan Pouwelse:
Achieving Sybil-Proofness in Distributed Work Systems. AAMAS 2021: 1263-1271 - 2020
- [c2]Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing Tree Decompositions of Graphs with Bounded Gonality. COCOON 2020: 384-396 - 2004
- [c1]Dion Gijswijt:
On a Packet Scheduling Problem for Smart Antennas and Polyhedra Defined Circular-ones Matrices. CTW 2004: 157-159
Informal and Other Publications
- 2024
- [i6]Dion Gijswijt, Frank de Meijer:
Automorphism groups of Cayley graphs generated by general transposition sets. CoRR abs/2401.17860 (2024) - 2023
- [i5]Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt, Aditya Potukuchi:
Blocking sets, minimal codes and trifferent codes. CoRR abs/2301.09457 (2023) - 2020
- [i4]Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing Tree Decompositions of Graphs with Bounded Gonality. CoRR abs/2005.05569 (2020) - 2018
- [i3]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 abs/1809.05009 (2018) - 2013
- [i2]Dion Gijswijt, Shanfei Li:
Approximation algorithms for the capacitated k-facility location problems. CoRR abs/1311.4759 (2013) - 2012
- [i1]Jop Briët, Harry Buhrman, Dion Gijswijt:
Violating the Shannon capacity of metric graphs with entanglement. CoRR abs/1207.1779 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
