Goran Konjevod

According to our database1, Goran Konjevod authored at least 51 papers between 2000 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Context-aided analysis of community evolution in networks.
Statistical Analysis and Data Mining, 2017

Deep Multi-modal Vehicle Detection in Aerial ISR Imagery.
Proceedings of the 2017 IEEE Winter Conference on Applications of Computer Vision, 2017

2016
Separators in Graphs.
Encyclopedia of Algorithms, 2016

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension.
ACM Trans. Algorithms, 2016

Dude (Duality descriptor): A robust descriptor for disparate images using line segment duality.
Proceedings of the 2016 IEEE International Conference on Image Processing, 2016

A Large Contextual Dataset for Classification, Detection and Counting of Cars with Deep Learning.
Proceedings of the Computer Vision - ECCV 2016, 2016

2014
Effective storage capacity of labeled graphs.
Inf. Comput., 2014

2013
Randomized post-optimization of covering arrays.
Eur. J. Comb., 2013

2011
Randomized compact routing in decomposable metrics.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010
Storage Capacity of Labeled Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Detecting Sybil Nodes in Static and Dynamic Networks.
Proceedings of the On the Move to Meaningful Internet Systems, 2010

2009
Compacting cuts: A new linear formulation for minimum cut.
ACM Trans. Algorithms, 2009

Coloring number and on-line Ramsey theory for graphs and hypergraphs.
Combinatorica, 2009

Randomized Postoptimization of Covering Arrays.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Near optimal battery-aware energy management.
Proceedings of the 2009 International Symposium on Low Power Electronics and Design, 2009

Folding a Better Checkerboard.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Separators in Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2008

Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007
On the establishment of distinct identities in overlay networks.
Distributed Computing, 2007

Optimal scale-free compact routing schemes in networks of low doubling dimension.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compact routing with slack in low doubling dimension.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules.
Proceedings of the 2007 International Symposium on Low Power Electronics and Design, 2007

Combinational equivalence checking for threshold logic circuits.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

Approximation Algorithm for Process Mapping on Network Processor Architectures.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

2006
Linear-programming-based techniques for synthesis of network-on-chip architectures.
IEEE Trans. VLSI Syst., 2006

Robust optimization of contaminant sensor placement for community water systems.
Math. Program., 2006

Optimal-stretch name-independent compact routing in doubling metrics.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Sampling in Higher-Dimensional Peer-to-Peer Systems.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Engineering Label-Constrained Shortest-Path Algorithms.
Proceedings of the Shortest Path Problem, 2006

Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment.
Proceedings of the 7th Annual International Conference on Digital Government Research, 2006

A Tight Lower Bound for the Steiner Point Removal Problem on Trees.
Proceedings of the Approximation, 2006

2005
A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media.
TBC, 2005

An automated technique for topology and route generation of application specific on-chip interconnection networks.
Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

2004
Budget constrained minimum cost connected medians.
J. Discrete Algorithms, 2004

Improved Approximations for Tour and Tree Covers.
Algorithmica, 2004

Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.
Proceedings of the Distributed Computing, 18th International Conference, 2004

2002
Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms, 2002

Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.
Proceedings of the Algorithms, 2002

A theoretical study of optimization techniques used in registration area based location management: models and online algorithms.
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), 2002

2001
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.
J. Comb. Optim., 2001

On approximating planar metrics by tree metrics.
Inf. Process. Lett., 2001

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.
Theor. Comput. Sci., 2000

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
J. Algorithms, 2000

An approximation algorithm for the covering Steiner problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Algorithms for optimizing production DNA sequencing.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the red-blue set cover problem.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.
Proceedings of the Algorithms, 2000


  Loading...