Name
Affiliation
Papers
GORAN KONJEVOD
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
42
Collaborators
Citations 
PageRank 
70
779
57.82
Referers 
Referees 
References 
1604
890
587
Search Limit
1001000
Title
Citations
PageRank
Year
Deep Multi-Modal Vehicle Detection In Aerial Isr Imagery30.392017
Context-aided analysis of community evolution in networks.00.342017
A Large Contextual Dataset For Classification, Detection And Counting Of Cars With Deep Learning261.202016
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension.00.342016
Effective storage capacity of labeled graphs.00.342014
Randomized post-optimization of covering arrays161.032013
Randomized compact routing in decomposable metrics00.342011
Detecting sybil nodes in static and dynamic networks00.342010
Storage Capacity of Labeled Graphs00.342010
Randomized Postoptimization of Covering Arrays100.662009
Compacting cuts: A new linear formulation for minimum cut40.542009
Coloring number and on-line Ramsey theory for graphs and hypergraphs110.792009
Near optimal battery-aware energy management00.342009
Engineering Label-Constrained Shortest-Path Algorithms140.872008
Dynamic routing and location services in metrics of low doubling dimension100.552008
Optimal scale-free compact routing schemes in networks of low doubling dimension150.652007
On the establishment of distinct identities in overlay networks432.602007
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules180.712007
Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms170.932007
Combinational equivalence checking for threshold logic circuits140.872007
Compact routing with slack in low doubling dimension130.552007
Optimal-stretch name-independent compact routing in doubling metrics250.872006
Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment10.382006
Robust optimization of contaminant sensor placement for community water systems151.962006
On sampling in higher-dimensional peer-to-peer systems10.362006
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures1596.502006
A tight lower bound for the steiner point removal problem on trees70.582006
A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media.30.422005
Improved approximations for tour and tree covers120.772004
Budget constrained minimum cost connected medians10.402004
A theoretical study of optimization techniques used in registration area based location management: models and online algorithms10.352002
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router191.572002
Approximation algorithms for the covering Steiner problem171.312002
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities10.372002
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem221.772001
On approximating planar metrics by tree metrics164.232001
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem241.272001
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem141.252000
On the red-blue set cover problem753.372000
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems263.732000
Algorithms for optimizing production DNA sequencing40.742000
A polylogarithmic approximation algorithm for the group Steiner tree problem12210.891998