| 2026 | ICALP | Visibility Queries in Simple Polygons. | Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla, Yakov Nekrich, Eunjin Oh, Andr van Renssen, Frank Staals, Haitao Wang, Jie Xue |
| 2026 | ICALP | Incremental k-Lowest Planes and Planar k-Nearest Neighbor with Optimal Query Time. | John Iacono, Yakov Nekrich, Martin P. Seybold |
| 2025 | SODA | Top- | Gonzalo Navarro, Yakov Nekrich |
| 2023 | COCOON | Sum-of-Local-Effects Data Structures for Separable Graphs. | Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh |
| 2023 | SODA | 4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. | Yakov Nekrich, Saladi Rahul |
| 2022 | ISAAC | External-Memory Dictionaries with Worst-Case Update Cost. | Rathish Das, John Iacono, Yakov Nekrich |
| 2021 | SODA | New Data Structures for Orthogonal Range Reporting and Range Minima Queries. | Yakov Nekrich |
| 2021 | STOC | Dynamic planar point location in optimal time. | Yakov Nekrich |
| 2020 | CPM | Text Indexing and Searching in Sublinear Time. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2020 | ESA | Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing. | Younan Gao, Meng He, Yakov Nekrich |
| 2020 | ISAAC | Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. | Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu |
| 2020 | SODA | Better Data Structures for Colored Orthogonal Range Reporting. | Timothy M. Chan, Yakov Nekrich |
| 2019 | DCC | Space-Efficient Computation of the Burrows-Wheeler Transform. | Jos Fuentes-Seplveda, Gonzalo Navarro, Yakov Nekrich |
| 2019 | ICDT | Categorical Range Reporting with Frequencies. | Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan |
| 2019 | ISAAC | On Approximate Range Mode and Range Selection. | Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund |
| 2019 | WADS | Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. | Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid |
| 2018 | COCOON | A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. | Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan |
| 2018 | ESA | Dynamic Trees with Almost-Optimal Access Cost. | Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2018 | ICALP | Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. | Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis |
| 2017 | ISAAC | Succinct Color Searching in One Dimension. | Hicham El-Zein, J. Ian Munro, Yakov Nekrich |
| 2017 | ISAAC | Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2017 | SODA | Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2015 | ALENEX | A Data-Aware FM-index. | Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu |
| 2015 | ESA | Compressed Data Structures for Dynamic Sequences. | J. Ian Munro, Yakov Nekrich |
| 2015 | FOCS | Towards an Optimal Method for Dynamic Planar Point Location. | Timothy M. Chan, Yakov Nekrich |
| 2015 | PODS | Dynamic Data Structures for Document Collections and Graphs. | J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter |
| 2014 | DCC | A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. | Hongwei Huo, Longgang Chen, Jeffrey Scott Vitter, Yakov Nekrich |
| 2014 | LATIN | LZ77-Based Self-indexing with Faster Pattern Matching. | Travis Gagie, Pawel Gawrychowski, Juha Krkkinen, Yakov Nekrich, Simon J. Puglisi |
| 2014 | MFCS | Document Retrieval with One Wildcard. | Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan |
| 2014 | PODS | Categorical range maxima queries. | Manish Patil, Sharma V. Thankachan, Rahul Shah, Yakov Nekrich, Jeffrey Scott Vitter |
| 2014 | STACS | Space-Efficient String Indexing for Wildcard Pattern Matching. | Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter |
| 2014 | SPIRE | Fast Construction of Wavelet Trees. | J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter |
| 2013 | ESA | Optimal Color Range Reporting in One Dimension. | Yakov Nekrich, Jeffrey Scott Vitter |
| 2013 | ICALP | Full-Fledged Real-Time Indexing for Constant Size Alphabets. | Gregory Kucherov, Yakov Nekrich |
| 2013 | SODA | Optimal Dynamic Sequence Representations. | Gonzalo Navarro, Yakov Nekrich |
| 2013 | SPIRE | Minimal Discriminating Words Problem Revisited. | Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya |
| 2012 | CPM | Cross-Document Pattern Matching. | Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya |
| 2012 | LATA | A Faster Grammar-Based Self-index. | Travis Gagie, Pawel Gawrychowski, Juha Krkkinen, Yakov Nekrich, Simon J. Puglisi |
| 2012 | PODS | Space-efficient range reporting for categorical data. | Yakov Nekrich |
| 2012 | SODA | Top- | Gonzalo Navarro, Yakov Nekrich |
| 2012 | SPIRE | Computing Discriminating and Generic Words. | Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya |
| 2011 | ISAAC | A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time. | Yakov Nekrich |
| 2011 | ISAAC | External Memory Orthogonal Range Reporting with Fast Updates. | Yakov Nekrich |
| 2011 | SODA | Top-K Color Queries for Document Retrieval. | Marek Karpinski, Yakov Nekrich |
| 2011 | WADS | A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. | Yakov Nekrich |
| 2010 | ISAAC | Alphabet Partitioning for Compressed Rank/Select and Applications. | Jrmy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich |
| 2010 | ISAAC | Dynamic Range Reporting in External Memory. | Yakov Nekrich |
| 2010 | SOFSEM | Fast and Compact Prefix Codes. | Travis Gagie, Gonzalo Navarro, Yakov Nekrich |
| 2009 | COCOON | Space Efficient Multi-dimensional Range Reporting. | Marek Karpinski, Yakov Nekrich |
| 2009 | DCC | Low-Memory Adaptive Prefix Coding. | Travis Gagie, Marek Karpinski, Yakov Nekrich |
| 2009 | ISAAC | Data Structures for Approximate Orthogonal Range Counting. | Yakov Nekrich |
| 2009 | WADS | Worst-Case Optimal Adaptive Prefix Coding. | Travis Gagie, Yakov Nekrich |
| 2008 | LATIN | I/O-Efficient Point Location in a Set of Rectangles. | Yakov Nekrich |
| 2007 | DCC | An Efficient Implementation of Adaptive Prefix Coding. | Yakov Nekrich |
| 2007 | ISAAC | External Memory Range Reporting on a Grid. | Yakov Nekrich |
| 2007 | WADS | Orthogonal Range Searching in Linear and Almost-Linear Space. | Yakov Nekrich |
| 2006 | ISIT | A Fast Algorithm for Adaptive Prefix Coding. | Marek Karpinski, Yakov Nekrich |
| 2005 | DCC | Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. | Marek Karpinski, Yakov Nekrich |
| 2005 | ESA | Predecessor Queries in Constant Time?. | Marek Karpinski, Yakov Nekrich |
| 2002 | ICALP | Approximating Huffman Codes in Parallel. | Piotr Berman, Marek Karpinski, Yakov Nekrich |
| 2000 | DCC | Decoding of Canonical Huffman Codes with Look-Up Tables. | Yakov Nekrich |