| Publication | Date of Publication | Type |
|---|
Improved approximation algorithms for index coding
IEEE Transactions on Information Theory | 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
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Hardness of linear index coding on perturbed instances
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
| A fixed-parameter algorithm for the Kneser problem | 2024-06-24 | Paper |
On finding constrained independent sets in cycles
Algorithmica | 2024-04-02 | Paper |
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
SIAM Journal on Computing | 2024-03-19 | Paper |
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Local orthogonality dimension
Journal of Graph Theory | 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
Journal of Computer and System Sciences | 2023-03-10 | Paper |
The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications
Theory of Computing | 2023-01-11 | Paper |
Approximating the orthogonality dimension of graphs and hypergraphs
Chicago Journal of Theoretical Computer Science | 2023-01-06 | Paper |
The binary rank of circulant block matrices
Linear Algebra and its Applications | 2022-11-08 | Paper |
The complexity of finding fair independent sets in cycles
Computational Complexity | 2022-10-21 | Paper |
scientific article; zbMATH DE number 7561683 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Upper bounds on the Boolean rank of Kronecker products
Discrete Applied Mathematics | 2022-06-21 | Paper |
On the subspace choosability in graphs
The Electronic Journal of Combinatorics | 2022-05-12 | Paper |
The Binary Rank of Circulant Block Matrices
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-03-24 | Paper |
| On minrank and forbidden subgraphs | 2021-08-04 | Paper |
On minrank and the Lovász theta-function
(available as arXiv preprint) | 2021-08-04 | Paper |
Task-Based Solutions to Embedded Index Coding
IEEE Transactions on Information Theory | 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
(available as arXiv preprint) | 2020-02-20 | Paper |
\(H\)-wise independence
Chicago Journal of Theoretical Computer Science | 2020-01-29 | Paper |
On minrank and forbidden subgraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
On minrank and forbidden subgraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
The list-decoding size of Fourier-sparse Boolean functions
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Topological bounds on the dimension of orthogonal representations of graphs
European Journal of Combinatorics | 2019-08-30 | Paper |
On the lattice isomorphism problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
(available as arXiv preprint) | 2019-06-12 | Paper |
| Linear index coding via semidefinite programming | 2019-05-10 | Paper |
Sum-free sets of integers with a forbidden sum
SIAM Journal on Discrete Mathematics | 2019-03-11 | Paper |
Symmetric complete sum-free sets in cyclic groups
Israel Journal of Mathematics | 2018-11-13 | Paper |
Dioid partitions of groups
European Journal of Combinatorics | 2018-08-24 | Paper |
The restricted isometry property of subsampled Fourier matrices
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On Minrank and the Lov\'asz Theta Function
(available as arXiv preprint) | 2018-02-12 | Paper |
The list-decoding size of Fourier-sparse Boolean functions
(available as arXiv preprint) | 2018-01-24 | Paper |
Symmetric complete sum-free sets in cyclic groups
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Sunflowers and testing triangle-freeness of functions
Computational Complexity | 2017-10-18 | Paper |
The restricted isometry property of subsampled Fourier matrices
Lecture Notes in Mathematics | 2017-07-13 | Paper |
Sunflowers and testing triangle-freeness of functions
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
\(H\)-wise independence
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound | 2017-01-04 | Paper |
The remote set problem on lattices
Computational Complexity | 2015-07-08 | Paper |
On the Lattice Isomorphism Problem
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Linear index coding via semidefinite programming
Combinatorics, Probability and Computing | 2014-04-16 | Paper |
The Euclidean distortion of flat tori
Journal of Topology and Analysis | 2013-06-27 | Paper |
The remote set problem on lattices
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Theory of Computing | 2012-09-27 | Paper |
On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy
Theory of Computing | 2011-05-24 | Paper |
The Euclidean Distortion of Flat Tori
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
A note on the distribution of the distance from a lattice
Discrete & Computational Geometry | 2009-03-24 | Paper |
| scientific article; zbMATH DE number 5485482 (Why is no real title available?) | 2009-01-05 | Paper |
Nearly Orthogonal Sets over Finite Fields
(available as arXiv preprint) | N/A | Paper |
Larger Nearly Orthogonal Sets over Finite Fields
(available as arXiv preprint) | N/A | Paper |
