Goran Konjevod

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 7

Top Topics

Intersection Points

Vehicle Detection

Covering Arrays

Top Venues

Stat. Anal. Data Min.

ACM Trans. Algorithms

Publications

Jason Van Tuinen, Aditya Ranganath, Goran Konjevod, Mukesh Singhal, Roummel F. Marcia
Novel Adversarial Defense Techniques for White-Box Attacks. ICMLA (2022)
Wesam A. Sakla, Goran Konjevod, T. Nathan Mundhenk
Deep Multi-modal Vehicle Detection in Aerial ISR Imagery. WACV (2017)
Giuliana Pallotta, Goran Konjevod, Jose Cadena, Phan Nguyen
Context-aided analysis of community evolution in networks. Stat. Anal. Data Min. 10 (5) (2017)
T. Nathan Mundhenk, Goran Konjevod, Wesam A. Sakla, Kofi Boakye
A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning. CoRR (2016)
Youngwook Paul Kwon, Hyojin Kim, Goran Konjevod, Sara McMains
Dude (Duality descriptor): A robust descriptor for disparate images using line segment duality. ICIP (2016)
T. Nathan Mundhenk, Goran Konjevod, Wesam A. Sakla, Kofi Boakye
A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning. ECCV (3) (2016)
Goran Konjevod, Andréa W. Richa, Donglin Xia
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. ACM Trans. Algorithms 12 (3) (2016)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Effective storage capacity of labeled graphs. Inf. Comput. 234 (2014)
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
Randomized post-optimization of covering arrays. Eur. J. Comb. 34 (1) (2013)
Goran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou
Randomized compact routing in decomposable metrics. PODC (2011)
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod
Storage Capacity of Labeled Graphs. SSS (2010)
José Antonio Cárdenas-Haro, Goran Konjevod
Detecting Sybil Nodes in Static and Dynamic Networks. OTM Conferences (2) (2010)
Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang
Folding a Better Checkerboard. ISAAC (2009)
Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
Compacting cuts: A new linear formulation for minimum cut. ACM Trans. Algorithms 5 (3) (2009)
Sushu Zhang, Karam S. Chatha, Goran Konjevod
Near optimal battery-aware energy management. ISLPED (2009)
Hal A. Kierstead, Goran Konjevod
Coloring number and on-line Ramsey theory for graphs and hypergraphs. Comb. 29 (1) (2009)
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
Randomized Postoptimization of Covering Arrays. IWOCA (2009)
Goran Konjevod, Andréa W. Richa, Donglin Xia
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension. DISC (2008)
Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
Engineering Label-Constrained Shortest-Path Algorithms. AAIM (2008)
Karam S. Chatha, Krishnan Srinivasan, Goran Konjevod
Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27 (8) (2008)
Goran Konjevod, Andréa W. Richa, Donglin Xia
Dynamic routing and location services in metrics of low doubling dimension. PODC (2008)
Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms. ASP-DAC (2007)
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevod
Combinational equivalence checking for threshold logic circuits. ACM Great Lakes Symposium on VLSI (2007)
Christopher Ostler, Karam S. Chatha, Goran Konjevod
Approximation Algorithm for Process Mapping on Network Processor Architectures. ASP-DAC (2007)
Goran Konjevod, Andréa W. Richa, Donglin Xia
Optimal scale-free compact routing schemes in networks of low doubling dimension. SODA (2007)
Sushu Zhang, Karam S. Chatha, Goran Konjevod
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. ISLPED (2007)
Tejaswi Gowda, Samuel Leshner, Sarma B. K. Vrudhula, Goran Konjevod
Synthesis of threshold logic circuits using tree matching. ECCTD (2007)
Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu
Compact routing with slack in low doubling dimension. PODC (2007)
Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
Compacting cuts: a new linear formulation for minimum cut. SODA (2007)
Rida A. Bazzi, Goran Konjevod
On the establishment of distinct identities in overlay networks. Distributed Comput. 19 (4) (2007)
T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa
A Tight Lower Bound for the Steiner Point Removal Problem on Trees. APPROX-RANDOM (2006)
Goran Konjevod, Andréa W. Richa, Donglin Xia
Optimal-stretch name-independent compact routing in doubling metrics. PODC (2006)
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) (2006)
Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
Engineering Label-Constrained Shortest-Path Algorithms. The Shortest Path Problem (2006)
Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
Linear-programming-based techniques for synthesis of network-on-chip architectures. IEEE Trans. Very Large Scale Integr. Syst. 14 (4) (2006)
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)
Goran Konjevod, Andréa W. Richa, Donglin Xia
On Sampling in Higher-Dimensional Peer-to-Peer Systems. LATIN (2006)
Rida A. Bazzi, Goran Konjevod
On the establishment of distinct identities in overlay networks. PODC (2005)
Soohyun Oh, Yo Huh, Beshan Kulapala, Goran Konjevod, Andréa W. Richa, Martin Reisslein
A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media. IEEE Trans. Broadcast. 51 (2) (2005)
Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
An automated technique for topology and route generation of application specific on-chip interconnection networks. ICCAD (2005)
Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
Budget constrained minimum cost connected medians. J. Discrete Algorithms 2 (4) (2004)
Krishnan Srinivasan, Karam S. Chatha, Goran Konjevod
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures. ICCD (2004)
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
Improved Approximations for Tour and Tree Covers. Algorithmica 38 (3) (2004)
Rida A. Bazzi, Goran Konjevod
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty. DISC (2004)
Goran Konjevod, R. Ravi, Aravind Srinivasan
Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms 20 (3) (2002)
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)
Goran Konjevod, Soohyun Oh, Andréa W. Richa
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities. LATIN (2002)
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)
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) (2001)
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)
Goran Konjevod, R. Ravi, F. Sibel Salman
On approximating planar metrics by tree metrics. Inf. Process. Lett. 80 (4) (2001)
Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
Improved approximations for tour and tree covers. APPROX (2000)
Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
Budget Constrained Minimum Cost Connected Medians. WG (2000)
Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci. 235 (1) (2000)
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)
Naveen Garg, Goran Konjevod, R. Ravi
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37 (1) (2000)
Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney
Algorithms for optimizing production DNA sequencing. SODA (2000)
Goran Konjevod, R. Ravi
An approximation algorithm for the covering Steiner problem. SODA (2000)
Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe
On the red-blue set cover problem. SODA (2000)
Naveen Garg, Goran Konjevod, R. Ravi
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. SODA (1998)
Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. STOC (1998)