| 2026 | ESA | A 0.8395-Approximation Algorithm for the EPR Problem. | Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, Lennart Sinjorgo, James Sud |
| 2025 | ESA | Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings. | Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud |
| 2024 | ICALP | An Improved Quantum Max Cut Approximation via Maximum Matching. | Eunou Lee, Ojas Parekh |
| 2024 | STOC | Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model. | John Kallaugher, Ojas Parekh, Nadezhda Voronova |
| 2023 | SODA | Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. | Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, John Wright |
| 2022 | FOCS | The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. | John Kallaugher, Ojas Parekh |
| 2021 | ESA | Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. | Ojas Parekh, Kevin Thompson |
| 2021 | ICALP | Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. | Ojas Parekh, Kevin Thompson |
| 2021 | SPAA | Provable Advantages for Graph Algorithms in Spiking Neural Networks. | James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang |
| 2020 | SPAA | Provable Neuromorphic Advantages for Computing Shortest Paths. | James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang |
| 2018 | IJCNN | Spiking Neural Algorithms for Markov Process Random Walk. | William Severa, Rich Lehoucq, Ojas Parekh, James B. Aimone |
| 2018 | SPAA | Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. | Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone |
| 2017 | SOFSEM | The Approximability of Partial Vertex Covers in Trees. | Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani |
| 2015 | WAOA | Geometric Hitting Set for Segments of Few Orientations. | Sndor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips |
| 2014 | WAOA | Generalized Hypergraph Matching via Iterated Packing and Local Ratio. | Ojas Parekh, David Pritchard |
| 2011 | IPCO | Iterative Packing for Demand and Hypergraph Matching. | Ojas Parekh |
| 2010 | SAC | Constraint processing in relational database systems: from theory to implementation. | James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang |
| 2008 | WAOA | Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. | Jochen Knemann, Ojas Parekh, David Pritchard |
| 2007 | SODA | Compacting cuts: a new linear formulation for minimum cut. | Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh |
| 2006 | ESA | A Unified Approach to Approximating Partial Covering Problems. | Jochen Knemann, Ojas Parekh, Danny Segev |
| 2006 | ESA | Path Hitting in Acyclic Graphs. | Ojas Parekh, Danny Segev |
| 2005 | SPAA | Finding effective support-tree preconditioners. | Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo |
| 2005 | WADS | Linear Time Algorithms for Generalized Edge Dominating Set Problems. | Andr Berger, Ojas Parekh |
| 2002 | ESA | Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. | Eduardo Sany Laber, Ojas Parekh, R. Ravi |
| 2002 | SODA | Edge dominating and hypomatchable sets. | Ojas Parekh |
| 2000 | ESA | A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. | Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh |