| Publication | Date of Publication | Type |
|---|
Semidefinite approximations for bicliques and biindependent pairs
(available as arXiv preprint) | N/A | Paper |
Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
(available as arXiv preprint) | 2026-01-01 | Paper |
Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
(available as arXiv preprint) | 2026-01-01 | Paper |
Lean-verified lower bounds for the Shannon capacity of odd cycles
(available as arXiv preprint) | 2026-01-01 | Paper |
The maximum cardinality of trifferent codes with lengths 5 and 6
Examples and Counterexamples | 2025-09-04 | Paper |
Semidefinite approximations for bicliques and bi-independent pairs
Mathematics of Operations Research | 2025-02-21 | Paper |
A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings
(available as arXiv preprint) | 2025-01-01 | Paper |
New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
| Approximate pricing in networks: How to boost the betweenness and revenue of a node | 2023-02-03 | Paper |
Symmetry reduction to optimize a graph-based polynomial from queueing theory
SIAM Journal on Applied Algebra and Geometry | 2022-06-08 | Paper |
| The maximum cardinality of trifferent codes with lengths 5 and 6 | 2022-01-18 | Paper |
| New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity | 2020-05-06 | Paper |
New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity
(available as arXiv preprint) | 2020-01-01 | Paper |
Semidefinite programming bounds for Lee codes
Discrete Mathematics | 2019-07-18 | Paper |
Semidefinite programming bounds for Lee codes
Discrete Mathematics | 2019-07-18 | Paper |
Uniqueness of codes using semidefinite programming
Designs, Codes and Cryptography | 2019-06-27 | Paper |
Sum-perfect graphs
Discrete Applied Mathematics | 2019-03-28 | Paper |
Sum-perfect graphs
Discrete Applied Mathematics | 2019-03-28 | Paper |
New lower bound on the Shannon capacity of \(C_7\) from circular graphs
Information Processing Letters | 2019-01-18 | Paper |
Semidefinite Programming Bounds for Constant-Weight Codes
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
On the chromatic number of a subgraph of the Kneser graph
(available as arXiv preprint) | 2018-10-11 | Paper |
New nonbinary code bounds based on divisibility arguments
Designs, Codes and Cryptography | 2018-04-10 | Paper |
Semidefinite bounds for nonbinary codes based on quadruples
Designs, Codes and Cryptography | 2017-07-21 | Paper |
| Improved upper bound on A(18,8) | 2016-12-07 | Paper |
WITHDRAWN: Improved upper bound on A(18,8)
(available as arXiv preprint) | 2016-01-01 | Paper |
