Faculty
|
Ojas Parekh
Assistant Professor
|
Office hours
- Tuesday: 3:00pm - 5:00pm
- Thursday: 2:30pm - 4:00pm
- and by appointment
Research
- Approximation Algorithms, Combinatorial Optimization, Polyhedral Combinatorics, Mathematical Programming, Combinatorial Scientific Computing
Recent publications
- Compacting cuts: a new linear formulation for minimum cut with R. Carr, G. Konjevod, G. Little, and V. Natarajan; Appears in the proceedings of the Symposium on Discrete Algorithms, 2007, pp. 43-52; Invited for publication in a special issue of the ACM Transactions of Algorithms
- A Unified Approach to Approximating Partial Covering Problems with J. Könemann and D. Segev; Appears in the proceedings of the European Symposium on Algorithms, 2006, pp. 468-479; Invited for publication in a special issue of Algorithmica
Education
- Ph.D. (2002) Carnegie Mellon University (Algorithms, Combinatorics, and Optimization)
- M.S. (1999) Carnegie Mellon University (Algorithms, Combinatorics, and Optimization)
- B.S. (1997) Georgia Institute of Technology (Discrete Mathematics)
Activities
- Program committees: Latin American Theoretical Informatics (LATIN '08), IEEE International Parallel & Distributed Processing Symposium (IPDPS '08)
- Member: ACM, SIAM
|
