Robert D. Carr, Goran Konjevod, Danny Greg Little, Venkatesh Natarajan, and
Ojas D. Parekh.
Compacting cuts: a new linear formulation for minimum cut.
*ACM Transactions on Algorithms*, 5:27:1-27:16, 2009.
Special issue dedicated to best papers of SODA 2007.
[ bib |
.pdf ]

Krisnan Srinivasan, Karam S. Chatha, and Goran Konjevod.
Application specific network-on-chip design with guaranteed quality
approximation algorithms.
In *Proceedings of ASP-DAC*, 2007.
[ bib |
.pdf ]

Robert D. Carr, Goran Konjevod, Danny Greg Little, Venkatesh Natarajan, and
Ojas D. Parekh.
Compacting cuts: a new linear formulation for minimum cut.
In *Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete
Algorithms*, 2007.
[ bib |
.ps.gz ]

Robert D. Carr, William E. Hart, Harvey J. Greenberg, Goran Konjevod, Erik
Lauer, Henry Lin, Tod Morrison, and Cynthia A. Phillips.
Robust optimization of contaminant sensor placement for community
water systems.
*Math. Programming, Ser. B*, 107(1-2):337-356, 2006.
Special issue on Robust Optimization.
[ bib |
.pdf ]

Goran Konjevod. Directed Steiner trees, linear programs and randomized rounding. Manuscript, 8 pages, 2005. [ bib | .ps.gz ]

Krishnan Srinivasan, Karam S. Chatha, and Goran Konjevod.
An automated technique for topology and route generation of
application specific on-chip interconnection networks.
In *Proceedings of the ICCAD*, 2005.
[ bib |
.pdf ]

Robert D. Carr and Goran Konjevod.
Polyhedral combinatorics.
In Harvey Greenberg, editor, *Tutorials on emerging methodologies
and applications in Operations Research*, chapter 2, pages (2-1)-(2-48).
Springer, 2004.
[ bib |
.pdf ]

Jochen Könemann, Goran Konjevod, Ojas Parekh, and Amitabh Sinha.
Improved approximations for tour and tree covers.
*Algorithmica*, 38(3):441-449, 2003.
[ bib |
.pdf ]

Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, and
Amitabh Sinha.
On the integrality gap of a natural formulation of the single-sink
buy-at-bulk network design problem.
In *Proceedings of the 8th IPCO*, pages 170-184, 2001.
[ bib |
.ps.gz ]

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, and Ojas Parekh.
A 2(1)/(10)-approximation algorithm for a generalization of the
weighted edge-dominating set problem.
*J. Comb. Optim.*, 5(3):317-326, 2001.
[ bib |
.ps.gz ]

Jochen Könemann, Goran Konjevod, Ojas Parekh, and Amitabh Sinha.
Improved approximations for tour and tree covers.
In *Proceedings of the 3rd Approx*, volume 1913 of *Lecture
Notes in Computer Science*, pages 184-193, 2000.
[ bib |
.ps.gz ]

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, and Ojas Parekh.
A 2(1)/(10)-approximation algorithm for a generalization of the
weighted edge-dominating set problem.
In *Proceedings of the 8th ESA*, volume 1879 of *Lecture
Notes in Computer Science*, pages 132-142, 2000.
[ bib |
.ps.gz ]

Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav V. Marathe.
On the red-blue set cover problem.
In *Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 345-353, 2000.
[ bib |
.ps.gz ]

*This file was generated by
bibtex2html 1.91.*