☰

Goran Konjevod - Publications

Affiliations: 
Computer Science Arizona State University, Tempe, AZ, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

17 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Konjevod G, Richa AW, Xia D. Scale-free compact routing schemes in networks of low doubling dimension Acm Transactions On Algorithms. 12. DOI: 10.1145/2876055  0.364
2011 Konjevod G, Richa AW, Xia D, Zhou L. Randomized compact routing in decomposable metrics Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 351-352. DOI: 10.1145/1993806.1993879  0.378
2010 Bakun O, Konjevod G. Adaptive decentralized routing in small-world networks Proceedings - Ieee Infocom. DOI: 10.1109/INFCOMW.2010.5466704  0.409
2010 Cárdenas-Haro JA, Konjevod G. Detecting Sybil nodes in static and dynamic networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6427: 894-917. DOI: 10.1007/978-3-642-16949-6_15  0.322
2008 Konjevod G, Richa AW, Xia D. Dynamic routing and location services in metrics of low doubling dimension Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5218: 379-393. DOI: 10.1007/978-3-540-87779-0_26  0.367
2008 Barrett C, Bisset K, Holzer M, Konjevod G, Marathe M, Wagner D. Engineering label-constrained shortest-path algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5034: 27-37. DOI: 10.1007/978-3-540-68880-8_5  0.304
2007 Carr RD, Konjevod G, Little G, Natarajan V, Parekh O. Compacting cuts: A new linear formulation for minimum cut Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 43-52. DOI: 10.1145/1541885.1541888  0.341
2007 Konjevod G, Richa AW, Xia D, Yu H. Compact routing with slack in low doubling dimension Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 71-80. DOI: 10.1145/1281100.1281113  0.34
2007 Bazzi RA, Konjevod G. On the establishment of distinct identities in overlay networks Distributed Computing. 19: 267-287. DOI: 10.1007/s00446-006-0012-y  0.314
2006 Konjevod G, Richa AW, Xia D. Optimal-stretch name-independent compact routing in doubling metrics Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2006: 198-207.  0.321
2005 Oh S, Huh Y, Kulapala B, Konjevod G, Richa AW, Reisslein M. A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media Ieee Transactions On Broadcasting. 51: 200-215. DOI: 10.1109/Tbc.2005.847643  0.313
2005 Bazzi RA, Konjevod G. On the establishment of distinct identifies in overlay networks Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 24: 312-320. DOI: 10.1007/S00446-006-0012-Y  0.389
2002 Konjevod G, Ravi R, Srinivasan A. Approximation Algorithms for the Covering Steiner Problem Random Structures and Algorithms. 20: 465-482. DOI: 10.1002/Rsa.10038  0.309
2002 Konjevod G, Oh S, Richa AW. Finding most sustainable paths in networks with time-dependent edge reliabilities Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2286: 435-450.  0.391
2001 Konjevod G, Ravi R, Salman FS. On approximating planar metrics by tree metrics Information Processing Letters. 80: 213-219. DOI: 10.1016/S0020-0190(01)00161-2  0.346
2001 Garg N, Khandekar R, Konjevod G, Ravi R, Salman FS, Sinha A. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2081: 170-184.  0.325
2000 Konjevod G, Krumke SO, Marathe M. Budget constrained minimum cost connected medians Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1928: 267-278. DOI: 10.1016/J.Jda.2004.04.006  0.417
Show low-probability matches.