2008 |
42 | EE | Christopher L. Barrett,
Keith R. Bisset,
Martin Holzer,
Goran Konjevod,
Madhav V. Marathe,
Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms.
AAIM 2008: 27-37 |
41 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia:
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.
DISC 2008: 379-393 |
40 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia:
Dynamic routing and location services in metrics of low doubling dimension.
PODC 2008: 417 |
39 | EE | Goran Konjevod:
Separators in Graphs.
Encyclopedia of Algorithms 2008 |
38 | EE | Karam S. Chatha,
Krishnan Srinivasan,
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) |
2007 |
37 | EE | Tejaswi Gowda,
Sarma B. K. Vrudhula,
Goran Konjevod:
Combinational equivalence checking for threshold logic circuits.
ACM Great Lakes Symposium on VLSI 2007: 102-107 |
36 | EE | Krishnan Srinivasan,
Karam S. Chatha,
Goran Konjevod:
Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms.
ASP-DAC 2007: 184-190 |
35 | EE | Christopher Ostler,
Karam S. Chatha,
Goran Konjevod:
Approximation Algorithm for Process Mapping on Network Processor Architectures.
ASP-DAC 2007: 577-582 |
34 | EE | Sushu Zhang,
Karam S. Chatha,
Goran Konjevod:
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules.
ISLPED 2007: 225-230 |
33 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia,
Hai Yu:
Compact routing with slack in low doubling dimension.
PODC 2007: 71-80 |
32 | EE | Robert D. Carr,
Goran Konjevod,
Greg Little,
Venkatesh Natarajan,
Ojas Parekh:
Compacting cuts: a new linear formulation for minimum cut.
SODA 2007: 43-52 |
31 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia:
Optimal scale-free compact routing schemes in networks of low doubling dimension.
SODA 2007: 939-948 |
30 | EE | Rida A. Bazzi,
Goran Konjevod:
On the establishment of distinct identities in overlay networks.
Distributed Computing 19(4): 267-287 (2007) |
2006 |
29 | EE | Hubert T.-H. Chan,
Donglin Xia,
Goran Konjevod,
Andréa W. Richa:
A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
APPROX-RANDOM 2006: 70-81 |
28 | EE | 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.
DG.O 2006: 135-141 |
27 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia:
On Sampling in Higher-Dimensional Peer-to-Peer Systems.
LATIN 2006: 641-652 |
26 | EE | Goran Konjevod,
Andréa W. Richa,
Donglin Xia:
Optimal-stretch name-independent compact routing in doubling metrics.
PODC 2006: 198-207 |
25 | EE | Krishnan Srinivasan,
Karam S. Chatha,
Goran Konjevod:
Linear-programming-based techniques for synthesis of network-on-chip architectures.
IEEE Trans. VLSI Syst. 14(4): 407-420 (2006) |
24 | EE | 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.
Math. Program. 107(1-2): 337-356 (2006) |
2005 |
23 | | Krishnan Srinivasan,
Karam S. Chatha,
Goran Konjevod:
An automated technique for topology and route generation of application specific on-chip interconnection networks.
ICCAD 2005: 231-237 |
22 | EE | Rida A. Bazzi,
Goran Konjevod:
On the establishment of distinct identities in overlay networks.
PODC 2005: 312-320 |
2004 |
21 | EE | Rida A. Bazzi,
Goran Konjevod:
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.
DISC 2004: 420-434 |
20 | EE | Krishnan Srinivasan,
Karam S. Chatha,
Goran Konjevod:
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures.
ICCD 2004: 422-429 |
19 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget constrained minimum cost connected medians.
J. Discrete Algorithms 2(4): 453-469 (2004) |
2003 |
18 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved Approximations for Tour and Tree Covers.
Algorithmica 38(3): 441-449 (2003) |
2002 |
17 | EE | 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.
DIAL-M 2002: 72-79 |
16 | EE | Christopher L. Barrett,
Keith R. 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.
ESA 2002: 126-138 |
15 | EE | Goran Konjevod,
Soohyun Oh,
Andréa W. Richa:
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.
LATIN 2002: 435-450 |
14 | EE | Goran Konjevod,
R. Ravi,
Aravind Srinivasan:
Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms 20(3): 465-482 (2002) |
2001 |
13 | EE | 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.
IPCO 2001: 170-184 |
12 | EE | Goran Konjevod,
R. Ravi,
F. Sibel Salman:
On approximating planar metrics by tree metrics.
Inf. Process. Lett. 80(4): 213-219 (2001) |
11 | | 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.
J. Comb. Optim. 5(3): 317-326 (2001) |
2000 |
10 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved approximations for tour and tree covers.
APPROX 2000: 184-193 |
9 | | 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.
ESA 2000: 132-142 |
8 | EE | Goran Konjevod,
R. Ravi:
An approximation algorithm for the covering Steiner problem.
SODA 2000: 338-344 |
7 | EE | Robert D. Carr,
Srinivas Doddi,
Goran Konjevod,
Madhav V. Marathe:
On the red-blue set cover problem.
SODA 2000: 345-353 |
6 | EE | Éva Czabarka,
Goran Konjevod,
Madhav V. Marathe,
Allon G. Percus,
David C. Torney:
Algorithms for optimizing production DNA sequencing.
SODA 2000: 399-408 |
5 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget Constrained Minimum Cost Connected Medians.
WG 2000: 267-278 |
4 | | Naveen Garg,
Goran Konjevod,
R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
J. Algorithms 37(1): 66-84 (2000) |
3 | EE | Avrim Blum,
Goran Konjevod,
R. Ravi,
Santosh Vempala:
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.
Theor. Comput. Sci. 235(1): 25-42 (2000) |
1998 |
2 | | Naveen Garg,
Goran Konjevod,
R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
SODA 1998: 253-259 |
1 | EE | Avrim Blum,
Goran Konjevod,
R. Ravi,
Santosh Vempala:
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.
STOC 1998: 100-105 |