| 2026 | MFCS | Kernelization Bounds for Constrained Coloring. | Ishay Haviv |
| 2026 | MFCS | Setwise Distinguishable Permutations. | Ishay Haviv |
| 2025 | MFCS | New Hardness Results for Low-Rank Matrix Completion. | Dror Chawin, Ishay Haviv |
| 2023 | ICALP | On Finding Constrained Independent Sets in Cycles. | Ishay Haviv |
| 2023 | STACS | Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. | Dror Chawin, Ishay Haviv |
| 2022 | ICALP | A Fixed-Parameter Algorithm for the Kneser Problem. | Ishay Haviv |
| 2022 | MFCS | On the Binary and Boolean Rank of Regular Matrices. | Ishay Haviv, Michal Parnas |
| 2021 | LAGOS | Upper Bounds on the Boolean Rank of Kronecker Products. | Ishay Haviv, Michal Parnas |
| 2020 | ISIT | Minimizing the alphabet size of erasure codes with restricted decoding sets. | Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson |
| 2019 | MFCS | Approximating the Orthogonality Dimension of Graphs and Hypergraphs. | Ishay Haviv |
| 2017 | ISIT | Non-linear cyclic codes that attain the Gilbert-Varshamov bound. | Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi |
| 2016 | SODA | The Restricted Isometry Property of Subsampled Fourier Matrices. | Ishay Haviv, Oded Regev |
| 2014 | SODA | On the Lattice Isomorphism Problem. | Ishay Haviv, Oded Regev |
| 2012 | ISIT | On linear index coding for random graphs. | Ishay Haviv, Michael Langberg |
| 2012 | SODA | Linear index coding via semidefinite programming. | Eden Chlamtac, Ishay Haviv |
| 2011 | ISIT | Beating the Gilbert-Varshamov bound for online channels. | Ishay Haviv, Michael Langberg |
| 2008 | FOCS | Rounding Parallel Repetitions of Unique Games. | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
| 2007 | STOC | Tensor-based hardness of the shortest vector problem to within almost polynomial factors. | Ishay Haviv, Oded Regev |