The following pages link to Dion C. Gijswijt (Q420720):
Displaying 28 items.
- Characterizing partition functions of the vertex model (Q420721) (← links)
- An algorithm for weighted fractional matroid matching (Q463292) (← links)
- (Q509699) (redirect page) (← links)
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression (Q509700) (← links)
- Polyhedra with the integer Carathéodory property (Q765190) (← links)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- Treewidth is a lower bound on graph gonality (Q2200865) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- On the constant in a transference inequality for the vector-valued Fourier transform (Q2806876) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- (Q3370099) (← links)
- (Q3428601) (← links)
- On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices (Q3439149) (← links)
- On the <i>b</i>-Stable Set Polytope of Graphs without Bad <i>K</i><sub>4</sub> (Q4443105) (← links)
- (Q4602256) (← links)
- (Q4603221) (← links)
- Violating the Shannon capacity of metric graphs with entanglement (Q5170983) (← links)
- Semidefinite Code Bounds Based on Quadruple Distances (Q5271940) (← links)
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices (Q5470794) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918255) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918526) (← links)
- Excluding affine configurations over a finite field (Q6386554) (← links)
- Exploiting Symmetries in Optimal Quantum Circuit Design (Q6517562) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6519713) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6614182) (← links)
