E-LIB Suche - Ergebnisse für: Gijswijt, Dion

1

Near-Term n to k Distillation Protocols Using Graph Codes:

Goodenough, Kenneth ; de Bone, Sébastian ; Addala, Vaishnavi...
IEEE Journal on Selected Areas in Communications. 42 (2024) 7 - p. 1830-1849 , 2024

Link: https://doi.org/10.1109/..

2

Blocking sets, minimal codes and trifferent codes:

Bishnoi, Anurag ; D'haeseleer, Jozefien ; Gijswijt, Dion.
Journal of the London Mathematical Society. 109 (2024) 6 - p. , 2024

Link: https://doi.org/10.1112/..

3

Enumerating all bilocal Clifford distillation protocols thr..:

Jansen, Sarah ; Goodenough, Kenneth ; de Bone, Sébastian..
Quantum. 6 (2022) - p. 715 , 2022

Link: https://doi.org/10.22331..

4

Constructing tree decompositions of graphs with bounded gon..:

Bodlaender, Hans L. ; van Dobben de Bruyn, Josse ; Gijswijt, Dion.
Journal of Combinatorial Optimization. 44 (2021) 4 - p. 2681-2699 , 2021

Link: https://doi.org/10.1007/..

5

Integer packing sets form a well-quasi-ordering:

Del Pia, Alberto ; Gijswijt, Dion ; Linderoth, Jeff.
Operations Research Letters. 49 (2021) 2 - p. 226-230 , 2021

Link: https://doi.org/10.1016/..

6

Achieving Sybil-Proofness in Distributed Work Systems:

, In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems,

Stannat, Alexander ; Umut Ileri, Can ; Gijswijt, Dion. - p. 1263-1271 , 2021

Link: https://dl.acm.org/doi/1..

7

Computing graph gonality is hard:

Gijswijt, Dion ; Smit, Harry ; van der Wegen, Marieke
Discrete Applied Mathematics. 287 (2020) - p. 134-149 , 2020

Link: https://doi.org/10.1016/..

8

Constructing Tree Decompositions of Graphs with Bounded Gon..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Bodlaender, Hans L. ; van Dobben de Bruyn, Josse ; Gijswijt, Dion. - p. 384-396 , 2020

Link: https://doi.org/10.1007/..

9

On large subsets of${\mathrm{\mathbb{F}}}_{\mathrm{q}}^{\ma..:

Ellenberg, Jordan S. ; Gijswijt, Dion
Annals of Mathematics. 185 (2017) 1 - p. 339-343 , 2017

Link: http://www.jstor.org/sta..

10

Approximation algorithms for hard capacitated k-facility lo..:

Aardal, Karen ; van den Berg, Pieter L. ; Gijswijt, Dion.
European Journal of Operational Research. 242 (2015) 2 - p. 358-368 , 2015

Link: https://doi.org/10.1016/..

11

An algorithm for weighted fractional matroid matching:

Gijswijt, Dion ; Pap, Gyula
Journal of Combinatorial Theory, Series B. 103 (2013) 4 - p. 509-520 , 2013

Link: https://doi.org/10.1016/..

12

Violating the Shannon capacity of metric graphs withentangl..:

Briët, Jop ; Buhrman, Harry ; Gijswijt, Dion
Proceedings of the National Academy of Sciences of the United States of America. 110 (2013) 48 - p. 19227-19651 , 2013

Link: https://www.jstor.org/st..

13

Polyhedra with the Integer Carathéodory Property:

Gijswijt, Dion ; Regts, Guus
Journal of Combinatorial Theory, Series B. 102 (2012) 1 - p. 62-70 , 2012

Link: https://doi.org/10.1016/..

14

Violating the Shannon capacity of metric graphs with entang..:

Briët, Jop ; Buhrman, Harry ; Gijswijt, Dion
Proceedings of the National Academy of Sciences. 110 (2012) 48 - p. 19227-19232 , 2012

Link: https://doi.org/10.1073/..

15

New upper bounds for nonbinary codes based on the Terwillig..:

Gijswijt, Dion ; Schrijver, Alexander ; Tanaka, Hajime
Journal of Combinatorial Theory, Series A. 113 (2006) 8 - p. 1719-1731 , 2006

Link: https://doi.org/10.1016/..