The SCEAS System
| |||||||

## Search the dblp DataBase
Goran Konjevod:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
**Improved approximations for tour and tree covers.**[Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:184-193 [Conf] - Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa
**A Tight Lower Bound for the Steiner Point Removal Problem on Trees.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:70-81 [Conf] - Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, Ke Li
**Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment.**[Citation Graph (0, 0)][DBLP] DG.O, 2006, pp:135-141 [Conf] - Sandeep K. S. Gupta, Goran Konjevod, Georgios Varsamopoulos
**A theoretical study of optimization techniques used in registration area based location management: models and online algorithms.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2002, pp:72-79 [Conf] - Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe
**Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:126-138 [Conf] - Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
**A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:132-142 [Conf] - Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevod
**Combinational equivalence checking for threshold logic circuits.**[Citation Graph (0, 0)][DBLP] ACM Great Lakes Symposium on VLSI, 2007, pp:102-107 [Conf] - Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
**An automated technique for topology and route generation of application specific on-chip interconnection networks.**[Citation Graph (0, 0)][DBLP] ICCAD, 2005, pp:231-237 [Conf] - Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
**Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures.**[Citation Graph (0, 0)][DBLP] ICCD, 2004, pp:422-429 [Conf] - Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
**On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:170-184 [Conf] - Goran Konjevod, Soohyun Oh, Andréa W. Richa
**Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.**[Citation Graph (0, 0)][DBLP] LATIN, 2002, pp:435-450 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**On Sampling in Higher-Dimensional Peer-to-Peer Systems.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:641-652 [Conf] - Rida A. Bazzi, Goran Konjevod
**On the establishment of distinct identities in overlay networks.**[Citation Graph (0, 0)][DBLP] PODC, 2005, pp:312-320 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**Optimal-stretch name-independent compact routing in doubling metrics.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:198-207 [Conf] - Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe
**On the red-blue set cover problem.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:345-353 [Conf] - Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney
**Algorithms for optimizing production DNA sequencing.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:399-408 [Conf] - Naveen Garg, Goran Konjevod, R. Ravi
**A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:253-259 [Conf] - Goran Konjevod, R. Ravi
**An approximation algorithm for the covering Steiner problem.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:338-344 [Conf] - Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala
**Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:100-105 [Conf] - Rida A. Bazzi, Goran Konjevod
**Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.**[Citation Graph (0, 0)][DBLP] DISC, 2004, pp:420-434 [Conf] - Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
**Budget Constrained Minimum Cost Connected Medians.**[Citation Graph (0, 0)][DBLP] WG, 2000, pp:267-278 [Conf] - Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
**Improved Approximations for Tour and Tree Covers.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:38, n:3, pp:441-449 [Journal] - Goran Konjevod, R. Ravi, F. Sibel Salman
**On approximating planar metrics by tree metrics.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:213-219 [Journal] - Naveen Garg, Goran Konjevod, R. Ravi
**A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:37, n:1, pp:66-84 [Journal] - Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
**A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2001, v:5, n:3, pp:317-326 [Journal] - Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
**Budget constrained minimum cost connected medians.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2004, v:2, n:4, pp:453-469 [Journal] - Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips
**Robust optimization of contaminant sensor placement for community water systems.**[Citation Graph (0, 0)][DBLP] Math. Program., 2006, v:107, n:1-2, pp:337-356 [Journal] - Goran Konjevod, R. Ravi, Aravind Srinivasan
**Approximation algorithms for the covering Steiner problem.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:20, n:3, pp:465-482 [Journal] - Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala
**Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:1, pp:25-42 [Journal] - Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
**Linear-programming-based techniques for synthesis of network-on-chip architectures.**[Citation Graph (0, 0)][DBLP] IEEE Trans. VLSI Syst., 2006, v:14, n:4, pp:407-420 [Journal] - Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu
**Compact routing with slack in low doubling dimension.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:71-80 [Conf] - Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
**Compacting cuts: a new linear formulation for minimum cut.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:43-52 [Conf] - Goran Konjevod, Andréa W. Richa, Donglin Xia
**Optimal scale-free compact routing schemes in networks of low doubling dimension.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:939-948 [Conf] - Rida A. Bazzi, Goran Konjevod
**On the establishment of distinct identities in overlay networks.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2007, v:19, n:4, pp:267-287 [Journal] **Engineering Label-Constrained Shortest-Path Algorithms.**[Citation Graph (, )][DBLP]**Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms.**[Citation Graph (, )][DBLP]**Approximation Algorithm for Process Mapping on Network Processor Architectures.**[Citation Graph (, )][DBLP]**Folding a Better Checkerboard.**[Citation Graph (, )][DBLP]**Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules.**[Citation Graph (, )][DBLP]**Near optimal battery-aware energy management.**[Citation Graph (, )][DBLP]**Dynamic routing and location services in metrics of low doubling dimension.**[Citation Graph (, )][DBLP]**Storage Capacity of Labeled Graphs.**[Citation Graph (, )][DBLP]**Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.**[Citation Graph (, )][DBLP]**Randomized Postoptimization of Covering Arrays.**[Citation Graph (, )][DBLP]**Coloring number and on-line Ramsey theory for graphs and hypergraphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |