Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Ojas
Last name:	Parekh
DBLP:	14/2080
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 27  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article André Berger, Ojas Parekh. Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems.	Algorithmica 2012, Volume 62	(0)	2012
	Journal article Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley. Approximation Algorithms for	Algorithmica 2011, Volume 59	(0)	2011
	Conference paper Jochen Könemann, Ojas Parekh, Danny Segev. A Unified Approach to Approximating Partial Covering Problems.	Algorithmica 2011, Volume 59	(0)	2011
	Conference paper Ojas Parekh. Iterative Packing for Demand and Hypergraph Matching.	Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings 2011	(0)	2011
	Conference paper James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang. Constraint processing in relational database systems: from theory to implementation.	Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010 2010	(0)	2010
	Conference paper Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh. Compacting cuts: A new linear formulation for minimum cut.	ACM Transactions on Algorithms 2008, Volume 5	(0)	2009
	Conference paper Jochen Könemann, Ojas Parekh, David Pritchard. Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.	Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers 2009	(0)	2008
	Conference paper André Berger, Ojas Parekh. Linear Time Algorithms for Generalized Edge Dominating Set Problems.	Algorithmica 2008, Volume 50	(0)	2008
	Conference paper Ojas Parekh, Danny Segev. Path Hitting in Acyclic Graphs.	Algorithmica 2008, Volume 52	(0)	2008
	Conference paper Ojas Parekh. Approximation algorithms for partially covering with edges.	Theor. Comput. Sci. 2008, Volume 400	(0)	2008

Show item 1 to 10 of 27  

Your query returned 27 matches in the database.