| Publication | Date of Publication | Type |
|---|
| Improved approximation algorithms for index coding | 2025-01-23 | Paper |
| On finding constrained independent sets in cycles | 2024-11-14 | Paper |
| Improved NP-hardness of approximation for orthogonality dimension and minrank | 2024-10-08 | Paper |
| On the binary and Boolean rank of regular matrices | 2024-08-06 | Paper |
| Minimizing the alphabet size in codes with restricted error sets | 2024-07-23 | Paper |
| Hardness of linear index coding on perturbed instances | 2024-07-22 | Paper |
| A fixed-parameter algorithm for the Kneser problem | 2024-06-24 | Paper |
| On finding constrained independent sets in cycles | 2024-04-02 | Paper |
| Fixed-Parameter Algorithms for the Kneser and Schrijver Problems | 2024-03-19 | Paper |
| Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank | 2023-11-29 | Paper |
| Local orthogonality dimension | 2023-10-09 | Paper |
| The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications | 2023-07-12 | Paper |
| On the binary and Boolean rank of regular matrices | 2023-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5060749 | 2023-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5870293 | 2023-01-06 | Paper |
| The binary rank of circulant block matrices | 2022-11-08 | Paper |
| The complexity of finding fair independent sets in cycles | 2022-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092401 | 2022-07-21 | Paper |
| Upper bounds on the Boolean rank of Kronecker products | 2022-06-21 | Paper |
| On the subspace choosability in graphs | 2022-05-12 | Paper |
| The Binary Rank of Circulant Block Matrices | 2022-04-19 | Paper |
| A Fixed-Parameter Algorithm for the Kneser Problem | 2022-04-14 | Paper |
| On the Binary and Boolean Rank of Regular Matrices | 2022-03-24 | Paper |
| On minrank and forbidden subgraphs | 2021-08-04 | Paper |
| On minrank and the Lovász theta-function | 2021-08-04 | Paper |
| Task-Based Solutions to Embedded Index Coding | 2020-12-04 | Paper |
| Minimizing the alphabet size of erasure codes with restricted decoding sets | 2020-05-14 | Paper |
| The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications | 2020-02-20 | Paper |
| \(H\)-wise independence | 2020-01-29 | Paper |
| On minrank and forbidden subgraphs | 2019-12-16 | Paper |
| The list-decoding size of Fourier-sparse Boolean functions | 2019-12-06 | Paper |
| Topological bounds on the dimension of orthogonal representations of graphs | 2019-08-30 | Paper |
| On the lattice isomorphism problem | 2019-06-20 | Paper |
| Approximating the Orthogonality Dimension of Graphs and Hypergraphs | 2019-06-12 | Paper |
| Linear index coding via semidefinite programming | 2019-05-10 | Paper |
| Sum-free sets of integers with a forbidden sum | 2019-03-11 | Paper |
| Symmetric complete sum-free sets in cyclic groups | 2018-11-13 | Paper |
| Dioid partitions of groups | 2018-08-24 | Paper |
| The restricted isometry property of subsampled Fourier matrices | 2018-07-16 | Paper |
| On Minrank and the Lov\'asz Theta Function | 2018-02-12 | Paper |
| The list-decoding size of Fourier-sparse Boolean functions | 2018-01-24 | Paper |
| Symmetric complete sum-free sets in cyclic groups | 2018-01-18 | Paper |
| Sunflowers and testing triangle-freeness of functions | 2017-10-18 | Paper |
| The Restricted Isometry Property of Subsampled Fourier Matrices | 2017-07-13 | Paper |
| Sunflowers and testing triangle-freeness of functions | 2017-05-19 | Paper |
| \(H\)-wise independence | 2017-05-16 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
| The remote set problem on lattices | 2015-07-08 | Paper |
| On the Lattice Isomorphism Problem | 2014-05-06 | Paper |
| Linear index coding via semidefinite programming | 2014-04-16 | Paper |
| The Restricted Isometry Property of Subsampled Fourier Matrices | 2013-06-27 | Paper |
| The remote set problem on lattices | 2012-11-02 | Paper |
| Tensor-based hardness of the shortest vector problem to within almost polynomial factors | 2012-09-27 | Paper |
| On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy | 2011-05-24 | Paper |
| The Euclidean Distortion of Flat Tori | 2010-09-10 | Paper |
| A note on the distribution of the distance from a lattice | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549646 | 2009-01-05 | Paper |
| Nearly Orthogonal Sets over Finite Fields | N/A | Paper |
| Larger Nearly Orthogonal Sets over Finite Fields | N/A | Paper |
