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 ]

Henry A. Kierstead and Goran Konjevod. Coloring number and on-line Ramsey theory for graphs and hypergraphs. Combinatorica, 29(1):49-64, 2009. [ bib | .ps.gz ]

Karam S. Chatha, Krishnan Srinivasan, and Goran Konjevod. Automated techniques for synthesis of application-specific network-on-chip architectures. IEEE Trans. on CAD of Integrated Circuits and Systems, 27(8):1425-1438, 2008. [ bib ]

Rida A. Bazzi and Goran Konjevod. On the establishment of distinct identities in overlay networks. Distributed Computing, 19(4):267-287, 2007. Special issue with best papers of PODC 2005. [ bib | .pdf ]

Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, and Ke Li. Simulating impact of light rail on urban growth in Phoenix: an application of the UrbanSim modeling environment. Journal of Urban Technology, pages 91-111, 2006. [ bib | .pdf ]

Krishnan Srinivasan, Karam S. Chatha, and Goran Konjevod. Linear-programming-based techniques for synthesis of network-on-chip architectures. IEEE Trans. VLSI Syst., 14(4):407-420, 2006. [ bib | .pdf ]

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 ]

Soohyun Oh, Yo Huh, Beshlan Kulapala, Goran Konjevod, Andréa W. Richa, and Martin Reisslein. A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media. IEEE Transactions on Broadcasting, 51(2):200-215, 2005. [ bib | .pdf ]

Goran Konjevod, Sven O. Krumke, and Madhav V. Marathe. Budget constrained minimum cost connected medians. J. Discrete Algorithms, 2(4):453-469, 2004. [ bib | .ps.gz ]

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 ]

Goran Konjevod, R. Ravi, and Aravind Srinivasan. Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms, 20(3):465-482, 2002. [ bib | .ps.gz ]

Goran Konjevod, R. Ravi, and F. Sibel Salman. On approximating planar metrics by tree metrics. Information Processing Letters, 80(4):213-219, 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 ]

Avrim Blum, Goran Konjevod, R. Ravi, and Santosh Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci., 235(1):25-42, 2000. [ bib | .ps.gz ]

Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms, 37:66-84, 2000. [ bib | .ps.gz ]

This file was generated by bibtex2html 1.91.