Center for Computing Research (CCR)

Center for Computing Research

Ojas D. Parekh

[photo not uploaded] Ojas D. Parekh
Discrete Math & Optimization
Phone: 505/844-0287
Fax: 505/844-4728

Mailing address:
Sandia National Laboratories
P.O. Box 5800, MS 1326
Albuquerque, NM

I came to Sandia in 2010 after a stint as a computer science professor at Emory University in Atlanta, my home town.  I was formally trained as a theoretical computer scientist (i.e., a poorly-disguised mathematician) as part of Carnegie Mellon's interdisciplinary Algorithms, Combinatorics, and Optimization program; however, I am happy to get my hands dirty, bruised, or worse trying new things.  

My expertise is in applying mathematical techniques from theoretical computer science and operations research to design algorithms for problems inspired by real-world applications on graphs and complex networks.  Recently I have also ventured into quantum information and algorithms.


  • [2014-Present] Principal Member of Technical Staff, Sandia National Labs
  • [2010-2013] Senior Member of Techincal Staff, Sandia National Labs
  • [2003-2009] Assistant Professor of Computer Science, MathCS Department, Emory University
  • [2002-2003] Postdoc, Sandia National Labs
  • [1997-2002] Ph.D. in Algorithms, Combinatorics, and Optimization, Carnegie Mellon University
  • [1995-1997] B.S. in Discrete Mathematics, Georgia Tech


Selected Publications & Presentations

  • Caskurlu, Bugra, Vahan Mkrtchyan, Ojas D. Parekh, "Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ," Journal Article, SIAM Journal on Discrete Mathematics, Accepted/Published March 2017.
  • Mkrtchyan, Vahan, Ojas D. Parekh, Danny Segev, K Subramani, "The Approximability of Partial Vertex Covers in Trees," Presentation, 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), January 2017.
  • Parekh, Ojas D., Cynthia A. Phillips, Meghan Galiardi, Conrad D. James, James Bradley Aimone, "Constant Depth and Subcubic Size Threshold Circuits for Matrix Multiplication," Poster, 5th Neuro Inspired Computational Elements Workshop (NICE 2017), March 2017.
  • Parekh, Ojas D., Ciaran Ryan-Anderson, "Investigating the quantum approximate optimization algorithm's advantage over classical algorithms," Presentation, 19th Annual Southwest Quantum Information and Technology Workshop, February 2017.
  • Phillips, Cynthia A., Ojas D. Parekh, Craig Michael Vineyard, Conrad D. James, James Bradley Aimone, "Studying Adaptive Learning through Game-Theoretic Modeling," Presentation, 5th Neuro Inspired Computational Elements Workshop (NICE 2017) , March 2017.
  • Severa, William Mark, Ojas D. Parekh, Conrad D. James, James Bradley Aimone, "A Combinatorial Model for Dentate Gyrus Sparse Coding," Journal Article, Neural Computation, Vol. 29, No. 1, pp. 94–117, Accepted/Published January 2017.
  • Fekete, Sandor, Kan Huang, Joseph S.B. Mitchell, Ojas D. Parekh, Cynthia A. Phillips, "Geometric hitting set for segments of few orientations," Conference Paper, Workshop on Approximation and Online Algorithms, September 2015.
  • Brost, Randy C., William C. McLendon, Ojas D. Parekh, Mark Daniel Rintoul, David R. Strip, Diane Myung kyung Woodbridge, "A computational framework for ontologically storing and analyzing very large overhead image sets," Conference Paper, 3rd ACM SIGSPATIAL International Workshop on Analytics for Big GeoSpatial Data (BigSpatial), November 2014.
  • Parekh, Ojas, David Pritchard, "Generalized Hypergraph Matching via Iterated Packing and Local Ratio," Conference Paper, 12th Workshop on Approximation and Online Algorithms, September 2014.
  • Parekh, Ojas D., "Benchmarking quantum annealing for community detection on synthetic social networks," Presentation, 3rd Workshop in Adiabatic Quantum Computing, June 2014.
  • Parekh, Ojas D., "Unearthing planted solutions in quantum-annealing-inspired Ising problems," Presentation, Quantum Optimization Workshop at the Fields Institute, September 2014.
  • Carr, Robert, Harvey Greenberg, Ojas Parekh, Cynthia Phillips, "Towards certificates for integer programming computations," Presentation, 2011 DOE Applied Mathematics PI meeting, October 2011.
  • Parekh, Ojas D., "Iterative Packing for Demand and Hypergraph Matching," Conference Paper, 15th Annual Conference on Integer Programming and Combinatorial Optimization [peer-reviewed], June 2011.
  • Carr, Robert D, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh, "Compacting cuts: a new formulation for minimum cut," Conference Paper, SIAM Symposium on Discrete Algorithms p. 43-52, invited submission to ACM Transactions on Algorithms, January 2007.
  • Carr, Robert D., Ojas Parekh, "A 1/2-Integral Relaxation for the A-Matching Problem," Journal Article, Operation Research Letters, Accepted/Published April 2006.

Awards & Recognition

  • Parekh, Ojas D., Andrew J Landahl, Jonathan Edward Moussa, Luke Shulenburger, Jeremy D Wendt, Employee Recognition Award, Employee Recognition Award, Sandia National Laboratories, Team award for Enceladus: Quantum Computer Benchmarking, April 11, 2016.
  • Brost, Randolph, William C. McLendon, Ojas D. Parekh, Mark Daniel Rintoul, David R. Strip, Diane Woodbridge, Best Paper/Poster, Best Paper Award, 3rd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data (BigSpatial-2014), November 4, 2014.