Ojas Parekh

Discrete Math & Optimization

Author profile picture

Discrete Math & Optimization

odparek@sandia.gov

(505) 844-0287

Sandia National Laboratories, New Mexico
P.O. Box 5800
Albuquerque, NM 87185-1326

Biography

I am a theoretical computer scientist who enjoys applying mathematical techniques to practically motivated interdisciplinary problems. I have worked in a variety of fields including discrete optimization, combinatorics, combinatorial scientific computing, and most recently, quantum and neuromorphic computing. A recent passion is helping shape the emerging fields of quantum approximation algorithms and quantum discrete optimization.  

I direct the Department of Energy’s Fundamental Algorithmic Research for Quantum Computing (FAR-QC) project, a multi-institutional effort tasked with designing novel quantum algorithms to realize resource advantages over classical computation, especially for optimization, simulation, and machine learning.

Experience

  • 2014-Present Principal Member of Technical Staff, Sandia National Labs
  • 2010-2013 Senior Member of Technical Staff, Sandia National Labs
  • 2003-2009 Assistant Professor of Computer Science, Math CS 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

Publications

John Smith, Aaron Hill, Leah Reeder, Brian Franke, Richard Lehoucq, Ojas Parekh, William Severa, James Aimone, (2022). Neuromorphic scaling advantages for energy-efficient random walk computations Nature Electronics https://doi.org/10.1038/s41928-021-00705-7 Publication ID: 80181

Ojas Parekh, Yipu Wang, Yang Ho, Cynthia Phillips, Ali Pinar, James Aimone, William Severa, (2021). Neuromorphic Graph Algorithms https://doi.org/10.2172/1829422 Publication ID: 76679

Ojas Parekh, Kevin Thompson, (2021). Beating random assignment for approximating quantum 2-local hamiltonian problems Leibniz International Proceedings in Informatics, LIPIcs https://doi.org/10.2172/1884207 Publication ID: 75371

James Aimone, Yang Ho, Ojas Parekh, Cynthia Phillips, Ali Pinar, William Severa, Yipu Wang, (2021). Provable advantages for graph algorithms in spiking neural networks Annual ACM Symposium on Parallelism in Algorithms and Architectures https://doi.org/10.1145/3409964.3461813 Publication ID: 78648

Ojas Parekh, Kevin Thompson, (2021). Application of the level-2 quantum lasserre hierarchy in quantum approximation algorithms Leibniz International Proceedings in Informatics, LIPIcs https://doi.org/10.2172/1884683 Publication ID: 78977

Ojas Parekh, Jessica Thompson, (2021). Outperforming QAOA on MaxCut with Fast Classical Hyperplane Rounding Algorithms https://doi.org/10.2172/1882084 Publication ID: 79547

James Aimone, Yang Ho, Ojas Parekh, Cynthia Phillips, Ali Pinar, William Severa, Yipu Wang, (2021). Provable Advantages for Graph Algorithms in Spiking Neural Networks https://doi.org/10.2172/1890920 Publication ID: 78930

Ojas Parekh, (2021). CIS External Review Lightning Presentation: Neuromorphic Graph Algorithms https://www.osti.gov/servlets/purl/1856083 Publication ID: 77677

Mohamed Ebeida, Ahmed Abdelkader, Nina Amenta, Drew Kouri, Ojas Parekh, Cynthia Phillips, Nickolas Winovich, (2020). Novel Geometric Operations for Linear Programming https://doi.org/10.2172/1813669 Publication ID: 71776

John Smith, William Severa, Aaron Hill, leah reeder, Ojas Parekh, Brian Franke, Richard Lehoucq, James Aimone, (2020). Solving a steady-state pde using spiking networks and neuromorphic hardware https://doi.org/10.1145/3407197.3407202 Publication ID: 74507

James Aimone, Yang Ho, Ojas Parekh, Cynthia Phillips, Ali Pinar, William Severa, Yipu Wang, (2020). Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths https://www.osti.gov/servlets/purl/1814114 Publication ID: 74560

Sean Hallgren, Eunou Lee, Ojas Parekh, (2020). An approximation algorithm for the MAX-2-local hamiltonian problem Leibniz International Proceedings in Informatics, LIPIcs https://www.osti.gov/servlets/purl/1847599 Publication ID: 77248

John Smith, William Severa, Aaron Hill, Leah Reeder, Brian Franke, Richard Lehoucq, Ojas Parekh, James Aimone, (2020). Solving a steady-state PDE using spiking networks and neuromorphic hardware ACM International Conference Proceeding Series https://doi.org/10.1145/3407197.3407202 Publication ID: 74065

James Aimone, Yang Ho, Ojas Parekh, Cynthia Phillips, Ali Pinar, William Severa, Yipu Wang, (2020). Brief Announcement: Provable neuromorphic advantages for computing constrained shortest paths https://www.osti.gov/servlets/purl/1808434 Publication ID: 74074

Saoóndor Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph Mitchell, Ojas Parekh, Cynthia Phillips, (2020). Probing a Set of Trajectories to Maximize Captured Information Leibniz International Proceedings in Informatics, LIPIcs https://www.osti.gov/servlets/purl/1778662 Publication ID: 73277

Ojas Parekh, (2020). Fundamental Algorithmic Research for Quantum Computing (FAR-QC): Project Overview https://www.osti.gov/servlets/purl/1882061 Publication ID: 73011

Ojas Parekh, (2020). Quantum Optimization and Learning and Simulation (QOALAS): Project Overview https://www.osti.gov/servlets/purl/1884115 Publication ID: 73012

John Smith, James Aimone, Brian Franke, Aaron Hill, Richard Lehoucq, Ojas Parekh, Leah Reeder, William Severa, (2020). Solving IPDEs on Spiking Neuromorphic Hardware https://www.osti.gov/servlets/purl/1761032 Publication ID: 70692

Jaimie Stephens, Ojas Parekh, William Bolden, (2020). A Hybrid Quantum Optimization Algorithm Incorporating Classical Heuristics https://www.osti.gov/servlets/purl/1761890 Publication ID: 70788

Ojas Parekh, (2019). Almost optimal classical algorithms for a quantum generalization of Max Cut https://www.osti.gov/servlets/purl/1643365 Publication ID: 66940

Sevag Gharibian, Ojas Parekh, (2019). Almost optimal classical approximation algorithms for a quantum generalization of max-cut Leibniz International Proceedings in Informatics, LIPIcs https://www.osti.gov/servlets/purl/1642618 Publication ID: 65388

James Aimone, Ojas Parekh, Cynthia Phillips, Ali Pinar, William Severa, Helen Xu, (2019). Dynamic Programming with Spiking Neural Computing https://doi.org/10.1145/3354265.3354285 Publication ID: 70516

Ojas Parekh, (2019). Quantum Approaches for Discrete Optimization https://www.osti.gov/servlets/purl/1641667 Publication ID: 70517

James Aimone, Ali Pinar, Ojas Parekh, William Severa, Cynthia Phillips, Helen Xu, (2019). Dynamic programming with spiking neural computing ACM International Conference Proceeding Series https://doi.org/10.1145/3354265.3354285 Publication ID: 70018

Jaimie Stephens, Ciaran Ryan-Anderson, William Bolden, Ojas Parekh, (2019). Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems https://www.osti.gov/servlets/purl/1598932 Publication ID: 65622

Ojas Parekh, Ciaran Ryan-Anderson, Sevag Gharibian, (2019). Quantum Optimization and Approximation Algorithms https://doi.org/10.2172/1492737 Publication ID: 64463

Ojas Parekh, (2019). Quantum Approaches for Discrete Optimization https://www.osti.gov/servlets/purl/1595905 Publication ID: 64464

William Severa, Richard Lehoucq, Ojas Parekh, James Aimone, (2018). Spiking Neural Algorithms for Markov Process Random Walk Proceedings of the International Joint Conference on Neural Networks https://doi.org/10.1109/IJCNN.2018.8489628 Publication ID: 61822

Stephen Verzi, Fredrick Rothganger, Ojas Parekh, Tu Quach, Nadine Miner, Craig Vineyard, Conrad James, James Aimone, (2018). Computing with spikes: The advantage of fine-grained timing Neural Computation https://doi.org/10.1162/neco_a_01113 Publication ID: 63758

Mohan Sarovar, Ojas Parekh, Rolando Somma, Yigit Subasi, Mekena Metcalf, Jonathan Moussa, Yuan Su, Andrew Childs, Sevag Gharibian, Ciaran Ryan-Anderson, Aniruddha Bapat, Stephan Jordan, (2018). Quantum Optimization and Learning and Simulation https://www.osti.gov/servlets/purl/1592311 Publication ID: 59036

James Aimone, Aaron Hill, Richard Lehoucq, Ojas Parekh, Leah Reeder, William Severa, (2018). Neural Algorithms for Low Power Implementation of Partial Differential Equations https://doi.org/10.2172/1474253 Publication ID: 59070

Jaimie Stephens, Ojas Parekh, Ciaran Ryan-Anderson, (2018). Quantum Approximate Optimization Algorithm (QAOA) on Constrained Optimization Problems https://www.osti.gov/servlets/purl/1577041 Publication ID: 63577

James Aimone, Aaron Hill, Richard Lehoucq, Ojas Parekh, William Severa, (2018). Neuromorphic Hardware Implementation of Spiking Algorithms for Markov Random Walks https://www.osti.gov/servlets/purl/1582258 Publication ID: 63837

Ojas Parekh, Conrad James, Cynthia Phillips, James Aimone, (2018). Constant-depth and subcubic-size threshold circuits for matrix multiplication Annual ACM Symposium on Parallelism in Algorithms and Architectures https://www.osti.gov/servlets/purl/1425316 Publication ID: 55164

William Severa, Richard Lehoucq, Ojas Parekh, James Aimone, (2018). Spiking Neural Algorithms for Markov Process Random Walk https://doi.org/10.1109/IJCNN.2018.8489628 Publication ID: 62925

Bert Debusschere, Khachik Sargsyan, Ojas Parekh, (2018). Quantum Annealing Approaches for Building Sparse Surrogate Models in Uncertainty Quantification https://www.osti.gov/servlets/purl/1806634 Publication ID: 63222

Ojas Parekh, (2018). Quantum Optimization Algorithms https://www.osti.gov/servlets/purl/1526360 Publication ID: 62546

Ojas Parekh, Cynthia Phillips, Conrad James, James Aimone, (2018). Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication https://doi.org/10.1145/3210377.3210410 Publication ID: 62239

Ojas Parekh, Cynthia Phillips, Vladlena Powers, Nourhan Sakr, Cliff Stein, (2018). A Scheduling Problem Motivated by Cybersecurity and Adaptive Machine Learning https://www.osti.gov/servlets/purl/1511904 Publication ID: 61936

Sándor Fekete, Kan Huang, Joseph Mitchell, Ojas Parekh, Cynthia Phillips, (2018). Geometric Hitting Set for Segments of Few Orientations Theory of Computing Systems https://doi.org/10.1007/s00224-016-9744-7 Publication ID: 48400

Sevag Gharibian, Ojas Parekh, Ciaran Ryan-Anderson, (2017). Approximate Constraint Satisfaction in the Quantum Setting https://www.osti.gov/servlets/purl/1468312 Publication ID: 58222

Ciaran Ryan-Anderson, Andrew Landahl, Ojas Parekh, Noah Jacobson, Yang Jiao, (2017). Quantum Algorithms Architecture and Error Correction https://www.osti.gov/servlets/purl/1468314 Publication ID: 58226

James Aimone, Ojas Parekh, William Severa, (2017). Neural computing for scientific computing applications ACM International Conference Proceeding Series https://doi.org/10.1145/3183584.3183618 Publication ID: 54293

Ojas Parekh, Ciaran Ryan-Anderson, (2017). Quantum Approximation Algorithms https://www.osti.gov/servlets/purl/1507515 Publication ID: 57433

James Aimone, William Severa, Ojas Parekh, (2017). Neural Computing for Scientific Computing Applications: https://doi.org/10.1145/3183584.3183618 Publication ID: 57522

Craig Vineyard, Ojas Parekh, Cynthia Phillips, James Aimone, Conrad James, Craig Vineyard, Craig Vineyard, (2017). Adaptive Learning Theory https://www.osti.gov/servlets/purl/1367220 Publication ID: 56382

Ciaran Ryan-Anderson, Ojas Parekh, Yang Jiao, (2017). Investigating the Quantum Approximate Optimization Algorithm?s Advantage over Classical Algorithms https://www.osti.gov/servlets/purl/1505903 Publication ID: 54937

Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani, (2017). The Approximability of Partial Vertex Covers in Trees SOFSEM 2017: Theory and Practice of Computer Science https://doi.org/10.1007/978-3-319-51963-0_27 Publication ID: 42756

William Severa, Ojas Parekh, Conrad James, James Aimone, (2017). A combinatorial model for dentate gyrus sparse coding Neural Computation https://doi.org/10.1162/NECO_a_00905 Publication ID: 51741

William Severa, Kristofor Carlson, Ojas Parekh, Craig Vineyard, James Aimone, (2016). Can we be formal in assessing the strengths and weaknesses of neural architectures? A case study using a spiking cross-correlation algorithm https://www.osti.gov/servlets/purl/1413431 Publication ID: 48137

William Severa, Ojas Parekh, Kristofor Carlson, Conrad James, James Aimone, (2016). Spiking network algorithms for scientific computing 2016 IEEE International Conference on Rebooting Computing, ICRC 2016 – Conference Proceedings https://doi.org/10.1109/ICRC.2016.7738681 Publication ID: 47206

William Severa, Kristofor Carlson, Ojas Parekh, Craig Vineyard, James Aimone, (2016). Can we be formal in assessing the strengths and weaknesses of neural architectures? A case study using a spiking cross-correlation algorithm https://www.osti.gov/servlets/purl/1410236 Publication ID: 47882

William Severa, Ojas Parekh, Conrad James, James Aimone, (2016). Formalizing Function within the Hippocampal Trisynaptic Circuit https://www.osti.gov/servlets/purl/1408291 Publication ID: 47646

William Severa, Ojas Parekh, Kristofor Carlson, Conrad James, James Aimone, (2016). Spiking Network Algorithms for Scientific Computing https://doi.org/10.1109/ICRC.2016.7738681 Publication ID: 51273

Matthew Marinella, Sapan Agarwal, Steven Plimpton, Albert Talin, Farid El Gabaly Marquez, Elliot Fuller, David Hughart, Ojas Parekh, Erik Debenedictis, Ronald Goeke, Alexander Hsia, James Aimone, Conrad James, (2016). Emerging Technologies for the Acceleration of Neuromorphic Algorithms https://www.osti.gov/servlets/purl/1505271 Publication ID: 51075

Ojas Parekh, Jeremy Wendt, Luke Shulenburger, Andrew Landahl, Jonathan Moussa, John Aidun, (2016). Benchmarking Near-‐term Adiabatic Quantum Computation https://www.osti.gov/servlets/purl/1368864 Publication ID: 50257

Ojas Parekh, (2016). Presentation for IARPA Quantum Enhanced Optimization Proposers’ Day https://www.osti.gov/servlets/purl/1368767 Publication ID: 50149

Matthew Marinella, Sapan Agarwal, David Hughart, Steven Plimpton, Ojas Parekh, Tu Quach, Erik Debenedictis, Ronald Goeke, Alexander Hsia, James Aimone, Conrad James, (2016). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars https://www.osti.gov/servlets/purl/1365322 Publication ID: 49686

Sapan Agarwal, Ojas Parekh, Tu Quach, Erik Debenedictis, Conrad James, Matthew Marinella, James Aimone, (2016). Energy Scaling Advantages of Resistive Memory Crossbar Based Computation https://www.osti.gov/servlets/purl/1422171 Publication ID: 48959

William Severa, Ojas Parekh, Conrad James, James Aimone, (2016). A Combinatorial Model of Dentate Gyrus Sparse Coding and Pattern Separation [PowerPoint] https://www.osti.gov/servlets/purl/1346453 Publication ID: 48713

Sapan Agarwal, Steven Plimpton, Ojas Parekh, Alexander Hsia, Tu Quach, David Hughart, Isaac Richter, Erik Debenedictis, Conrad James, James Aimone, Matthew Marinella, (2016). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars https://www.osti.gov/servlets/purl/1346466 Publication ID: 48730

William Severa, Ojas Parekh, Conrad James, James Aimone, (2016). A Combinatorial Model of Dentate Gyrus Sparse Coding and Pattern Separation [Poster] https://www.osti.gov/servlets/purl/1345889 Publication ID: 48635

Sapan Agarwal, Tu Quach, Ojas Parekh, Alexander Hsia, Erik Debenedictis, Conrad James, Matthew Marinella, James Aimone, (2016). Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding Frontiers in Neuroscience https://doi.org/10.3389/fnins.2015.00484 Publication ID: 46410

Peter Maunz, Jonathan Sterk, Daniel Lobser, Ojas Parekh, Ciaran Ryan-Anderson, (2016). Quantum Graph Analysis https://doi.org/10.2172/1235806 Publication ID: 46733

Matthew Marinella, Sapan Agarwal, David Hughart, Steven Plimpton, Ojas Parekh, Tu Quach, Erik Debenedictis, Ronald Goeke, Alexander Hsia, James Aimone, Conrad James, (2015). Acceleration of Neural Algorithms using Nanoelectronic Resistive Memory Crossbars https://www.osti.gov/servlets/purl/1336275 Publication ID: 41847

James Aimone, Ojas Parekh, William Severa, (2015). A Sparse Coding Model of the Hippocampal Dentate Gyrus https://www.osti.gov/servlets/purl/1337917 Publication ID: 42156

Sapan Agarwal, Ojas Parekh, Tu Quach, Conrad James, James Aimone, Matthew Marinella, (2015). The energy scaling advantages of RRAM crossbars 2015 4th Berkeley Symposium on Energy Efficient Electronic Systems, E3S 2015 – Proceedings https://www.osti.gov/servlets/purl/1261043 Publication ID: 44154

William Severa, Ojas Parekh, Conrad James, James Aimone, (2015). Finding Triangles and Tracking Particles: Using Spiking Neural Networks for Pattern Identification Algorithms https://www.osti.gov/servlets/purl/1333797 Publication ID: 41734

Sandor Fekete, Kan Huang, Joseph Mitchell, Ojas Parekh, Cynthia Phillips, (2015). Geometric hitting set for segments of few orientations https://doi.org/10.1007/978-3-319-28684-6_13 Publication ID: 46186

Sapan Agarwal, Ojas Parekh, Tu Quach, Conrad James, James Aimone, Matthew Marinella, (2015). The Energy Scaling Advantages of RRAM Crossbars https://doi.org/10.1109/E3S.2015.7336818 Publication ID: 45841

Ojas Parekh, Jeremy Wendt, Luke Shulenburger, Andrew Landahl, Jonathan Moussa, John Aidun, (2015). Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis https://doi.org/10.2172/1459086 Publication ID: 43094

Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani, (2015). On Bipartite Graphs Trees and Their Partial Vertex Covers https://www.osti.gov/servlets/purl/1427215 Publication ID: 42757

Ojas Parekh, (2015). Benchmarking quantum annealing for complex network analysis on synthetic social networks https://www.osti.gov/servlets/purl/1245916 Publication ID: 42520

Randolph Brost, Michelle Carroll, William McLendon, Ojas Parekh, David Strip, Mark Rintoul, Diane Woodbridge, (2015). Image-Based Algorithms – Semantic Graph Algorithms https://www.osti.gov/servlets/purl/1245931 Publication ID: 42743

Robert Carr, Ojas Parekh, (2015). A 2-edge-connected spanning subgraph problem https://www.osti.gov/servlets/purl/1240334 Publication ID: 42289

Ojas Parekh, Robert Carr, (2015). Unearthing planted solutions in quantum-annealing-inspired Ising problems https://www.osti.gov/servlets/purl/1504578 Publication ID: 42187

Ojas Parekh, David Pritchard, (2015). Generalized hypergraph matching via iterated packing and local ratio Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) https://doi.org/10.1007/978-3-319-18263-6_18 Publication ID: 38403

Sándor Fekete, Kan Huang, Joseph Mitchell, Ojas Parekh, Cynthia Phillips, (2015). Geometric hitting set for segments of few orientations Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) https://doi.org/10.1007/978-3-319-28684-6_13 Publication ID: 45477

Randolph Brost, Mark Rintoul, William McLendon, David Strip, Ojas Parekh, Diane Woodbridge, (2014). A computational framework for ontologically storing and analyzing very large overhead image sets Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, BigSpatial 2014 https://www.osti.gov/servlets/purl/1315002 Publication ID: 38276

Randolph Brost, William McLendon, Ojas Parekh, Mark Rintoul, David Strip, Diane Woodbridge, (2014). A Computational Framework for Ontologically Storing and Analyzing Very Large Overhead Image Sets https://doi.org/10.1145/2676536.2676537 Publication ID: 39289

Ojas Parekh, (2014). Benchmarking quantum annealing for community detection on synthetic social networks https://www.osti.gov/servlets/purl/1314564 Publication ID: 38374

Randolph Brost, William McLendon, Ojas Parekh, Mark Rintoul, Diane Woodbridge, (2014). Temporal Analysis and Change Detection via Geospatial-Temporal Semantic Graphs https://www.osti.gov/servlets/purl/1141170 Publication ID: 37272

Randolph Brost, William McLendon, Ojas Parekh, Mark Rintoul, Diane Woodbridge, (2014). Facility Search in Remote Sensing Data Using Geospatial Semantic Graphs https://www.osti.gov/servlets/purl/1141268 Publication ID: 37273

Mark Rintoul, Jean-Paul Watson, William McLendon, Ojas Parekh, (2014). Encoding and analyzing aerial imagery using geospatial semantic graphs https://doi.org/10.2172/1204099 Publication ID: 37291

Ojas Parekh, John Aidun, Irene Dubicka, Andrew Landahl, Luke Shulenburger, Chris Tigges, Jeremy Wendt, (2013). Evaluating Near-Term Adiabatic Quantum Computing https://doi.org/10.2172/1465512 Publication ID: 31686

Cynthia Phillips, Ojas Parekh, John Siirola, Jean-Paul Watson, (2013). Hierarchical Parallel MIP https://www.osti.gov/servlets/purl/1106679 Publication ID: 34984

Ojas Parekh, Cynthia Phillips, John Siirola, Jean-Paul Watson, (2013). PICO’s New Hierarchical Branch-and Bound System for Massively Parallel Integer Programming https://www.osti.gov/servlets/purl/1106949 Publication ID: 35032

Jonathan Sterk, Robin Blume-Kohout, Ojas Parekh, Peter Maunz, Chris Tigges, Matthew Blain, Richard Colbaugh, Cort Johnson, (2013). Quantum Graph Analysis with Trapped Yb Ion Qubits https://www.osti.gov/servlets/purl/1145353 Publication ID: 32567

Ojas Parekh, (2012). Let Your Users Do the Ranking https://www.osti.gov/servlets/purl/1647932 Publication ID: 29809

Ojas Parekh, Cynthia Phillips, John Siirola, Jean-Paul Watson, (2012). PICO’s new hierarchical branch-and-bound system for massively parallel integer programming https://www.osti.gov/biblio/1061056 Publication ID: 29665

Genetha Gray, William Hart, Patricia Hough, Ojas Parekh, Cynthia Phillips, John Siirola, Laura Swiler, Jean-Paul Watson, (2012). Optimization of large-scale heterogeneous system-of-systems models https://doi.org/10.2172/1034869 Publication ID: 26013

Robert Carr, Ojas Parekh, (2011). A 2-edge-connected spanning subgraph problem https://www.osti.gov/servlets/purl/1106816 Publication ID: 25024

Robert Carr, Ojas Parekh, (2011). Approximating a capacitated 2-edge-connected spanning subgraph problem Operations Research Letters https://www.osti.gov/biblio/1106938 Publication ID: 24400

Robert Carr, Cynthia Phillips, Ojas Parekh, (2011). Towards Certficates for Integer Programming Computations https://www.osti.gov/servlets/purl/1106366 Publication ID: 24188

Robert Carr, Ojas Parekh, (2011). Approximating a 2-edge-connected subgraph problem https://www.osti.gov/servlets/purl/1106512 Publication ID: 24190

Ojas Parekh, (2011). Iterative packing for demand matching and sparse packing https://www.osti.gov/servlets/purl/1141090 Publication ID: 23212

Ojas Parekh, (2010). Iterative packing for demand matching and sparse packing https://www.osti.gov/biblio/1032921 Publication ID: 20820

Erik Boman, Erik Boman, Ojas Parekh, (2003). Combinatorial and algorithmic aspects of the null spaces of symmetric H-matrices https://www.osti.gov/biblio/993896 Publication ID: 2369

Showing Results. Show More Publications