[1] | Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 253-259, 1998. [ bib | .ps.gz ] |
[2] | Avrim Blum, Goran Konjevod, R. Ravi, and Santosh Vempala. Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 100-105, 1998. [ bib | .ps.gz ] |
[3] | 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 ] |
[4] | 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 ] |
[5] | Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, and David C. Torney. Algorithms for optimizing production DNA sequencing. In Proceedings of the 11thAnnual ACM-SIAM Symposium on Discrete Algorithms, pages 399-408, 2000. [ bib | .ps.gz ] |
[6] | 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 ] |
[7] | Goran Konjevod and R. Ravi. An approximation algorithm for the covering Steiner problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 338-344, 2000. [ bib | .ps.gz ] |
[8] | Goran Konjevod, Sven O. Krumke, and Madhav V. Marathe. Budget constrained minimum cost connected medians. In Proceedings of the 26th WG, volume 1928 of Lecture Notes in Computer Science, pages 267-278, 2000. [ bib | .ps.gz ] |
[9] | 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 ] |
[10] | 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 ] |
[11] | 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 ] |
[12] | 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 ] |
[13] | 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 ] |
[14] | 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 ] |
[15] | Goran Konjevod, Soohyun Oh, and Andréa W. Richa. Finding most sustainable paths in networks with time-dependent edge reliabilities. In Proceedings of the 5th LATIN, volume 2286 of Lecture Notes in Computer Science, pages 435-450, 2002. [ bib | .ps.gz ] |
[16] | Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, and Madhav V. Marathe. Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the transims router. In Proceedings of the 10th ESA, volume 2461 of Lecture Notes in Computer Science, pages 126-138, 2002. [ bib | .pdf ] |
[17] | Sandeep K. S. Gupta, Goran Konjevod, and Georgios Varsamopoulos. A theoretical study of optimization techniques used in registration area based location management: models and online algorithms. In Proceedings of the 6th DIAL-M, pages 72-79, 2002. [ bib | .ps.gz ] |
[18] | 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 ] |
[19] | Krishnan Srinivasan, Karam S. Chatha, and Goran Konjevod. Linear programming based techniques for synthesis of network-on-chip architectures. In Proceedings of the 22nd ICCD, pages 422-429, 2004. [ bib | .pdf ] |
[20] | Rida A. Bazzi and Goran Konjevod. Erratum: Efficient verification for provably secure storage and secret sharing in systems where half the servers are faulty. 2004. [ bib | .pdf ] |
[21] | Rida A. Bazzi and Goran Konjevod. Efficient verification for provably secure storage and secret sharing in systems where half the servers are faulty. In Proceedings of the 18th DISC, volume 3274 of Lecture Notes in Computer Science, pages 420-434, 2004. [ bib | .pdf ] |
[22] | 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 ] |
[23] | 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 ] |
[24] | Rida A. Bazzi and Goran Konjevod. On the establishment of distinct identities in overlay networks. In Proceedings of the 24th PODC, pages 312-320, 2005. [ bib | .ps.gz ] |
[25] | 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 ] |
[26] | 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 ] |
[27] | Goran Konjevod. Directed Steiner trees, linear programs and randomized rounding. Manuscript, 8 pages, 2005. [ bib | .ps.gz ] |
[28] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. On sampling in higher-dimensional peer-to-peer systems. In Proceedings of the 9th LATIN, volume 3887 of Lecture Notes in Computer Science, pages 641-652, 2006. [ bib | .pdf ] |
[29] | 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 ] |
[30] | 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 ] |
[31] | Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, and Ke Li. Simulating impact of light rail on urban growth in phoenix: an application of urbansim modeling environment. In Proceedings of the 7th Annual International Conference on Digital Government Research, DG.O 2006, pages 135-141, 2006. [ bib ] |
[32] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. In Proceedings of the 25th PODC, pages 198-207, 2006. [ bib | .ps.gz ] |
[33] | T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, and Andréa W. Richa. A tight lower bound for Steiner point removal problem on trees. In Proceedings of the APPROX, volume 4110 of Lecture Notes in Computer Science, pages 70-81, 2006. [ bib | .pdf ] |
[34] | 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 ] |
[35] | 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 ] |
[36] | 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 ] |
[37] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 939-948, 2007. [ bib | .ps.gz ] |
[38] | Chris Ostler, Karam S. Chatha, and Goran Konjevod. Application throughput maximization on network processor architectures. In Proceedings of ASP-DAC, 2007. [ bib | .pdf ] |
[39] | 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 ] |
[40] | Tejaswi Gowda, Sarma B. K. Vrudhula, and Goran Konjevod. A non-ilp based threshold logic synthesis methodology. In Proceedings of the International Worshop on Logic Synthesis (IWLS), 2007. [ bib | .pdf ] |
[41] | Tejaswi Gowda, Sarma B. K. Vrudhula, and Goran Konjevod. Combinational equivalence checking for threshold logic circuits. In ACM Great Lakes Symposium on VLSI, pages 102-107, 2007. [ bib | .pdf ] |
[42] | Tejaswi Gowda, Samuel Leshner, Sarma B. K. Vrudhula, and Goran Konjevod. Synthesis of threshold logic circuits using tree matching. In Proceedings of the 18th European Conference on Circuit Theory and Design, 2007. [ bib | .pdf ] |
[43] | Goran Konjevod, Andrea Richa, Donglin Xia, and Hai Yu. Compact routing with slack in low doubling dimension. In Proceedings of the 26th PODC, pages 71-80, 2007. [ bib | DOI | .pdf ] |
[44] | Sushu Zhang, Karam S. Chatha, and Goran Konjevod. Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. In ISLPED '07: Proceedings of the 2007 international symposium on Low power electronics and design, pages 225-230, 2007. [ bib | DOI | .pdf ] |
[45] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In Proceedings of the 27th PODC, page 417, 2008. Brief announcement. [ bib ] |
[46] | Goran Konjevod. Separators (Leighton-Rao). In Ming-Yang Kao, editor, Encyclopedia of Algorithms, pages 815-818. 2008. [ bib | .pdf ] |
[47] | Christopher L. Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, and Dorothea Wagner. Engineering label-constrained shortest-path algorithms. In Proceedings of AAIM, pages 27-37, 2008. [ bib ] |
[48] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In Proceedings of the 22nd DISC, volume 5218 of Lecture Notes in Computer Science, pages 379-393, 2008. [ bib | .pdf ] |
[49] | 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 ] |
[50] | 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 ] |
[51] | 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 ] |
[52] | Goran Konjevod. Integer programming models for flat origami. In Robert J. Lang, editor, Origami 4, Proceedings of 4OSME: 4th International Conference on Origami Science, Mathematics and Education, pages 207-216. 2009. [ bib | www: | .pdf ] |
[53] | Sushu Zhang, Karam S. Chatha, and Goran Konjevod. Near optimal battery-aware energy management. In ISLPED, pages 249-254, 2009. [ bib ] |
[54] | Goran Konjevod and Ana Maria Kuprešanin. Notation for a class of paperfolded models. In Proceedings of the 12th Annual Bridges Conference, Banff, pages 47-54, 2009. [ bib | .pdf ] |
[55] | Charles Colbourn, Peyman Nayeri, and Goran Konjevod. Randomized postoptimization of covering arrays. In Proceedings of IWOCA, pages 408-419, 2009. [ bib | .pdf ] |
[56] | Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe, and Dorothea Wagner. Engineering label-constrained shortest-path algorithms. In Camil Demetrescu, Andrew Goldberg, and David S. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pages 309-318. AMS and DIMACS, 2009. [ bib ] |
[57] | Subhrajit Guhathakurta, Yoshi Kobayashi, Mookesh Patel, Janet Holston, Tim Lant, John Crittenden, Ke Li, Goran Konjevod, and Karthikeya Date. Digital phoenix project: A multidimensional journey through time. In Gerhard Steinebach, Subhrajit Guhathakurta, and Hans Hagen, editors, Visualizing Sustainable Planning, pages 159-184. Springer, 2009. [ bib ] |
[58] | Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Folding a better checkerboard. In ISAAC, pages 1074-1083, 2009. [ bib ] |
[59] | Goran Konjevod, Andréa W. Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. Invited for publication in special issue of ACM Transactions on Algorithms dedicated to best papers of SODA 2007; combination of papers from PODC 2006 and SODA 2007; submitted, 2007. [ bib | .pdf ] |
This file was generated by bibtex2html 1.91.