Goran Konjevod

T. Nathan Mundhenk

Proceedings of the 2017 IEEE Winter Conference on Applications of Computer Vision, 2017

2016

Separators in Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Dude (Duality descriptor): A robust descriptor for disparate images using line segment duality.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2016, 2016

2014

Effective storage capacity of labeled graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2014

2013

Randomized post-optimization of covering arrays.

[BibT_eX]

[DOI]

Peyman Nayeri

Charles J. Colbourn

José Antonio Cárdenas-Haro

Eur. J. Comb., 2013

2011

Randomized compact routing in decomposable metrics.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010

Storage Capacity of Labeled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Detecting Sybil Nodes in Static and Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the On the Move to Meaningful Internet Systems, 2010

2009

Compacting cuts: A new linear formulation for minimum cut.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

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

[BibT_eX]

[DOI]

Hal A. Kierstead

Comb., 2009

Randomized Postoptimization of Covering Arrays.

[BibT_eX]

[DOI]

Peyman Nayeri

Charles J. Colbourn

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Near optimal battery-aware energy management.

[BibT_eX]

[DOI]

Sushu Zhang

Proceedings of the 2009 International Symposium on Low Power Electronics and Design, 2009

Folding a Better Checkerboard.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Separators in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

Dynamic Routing and Location Services in Metrics of Low Doubling Dimension.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007

On the establishment of distinct identities in overlay networks.

[BibT_eX]

[DOI]

Rida A. Bazzi

Distributed Comput., 2007

Optimal scale-free compact routing schemes in networks of low doubling dimension.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compact routing with slack in low doubling dimension.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Sushu Zhang

Proceedings of the 2007 International Symposium on Low Power Electronics and Design, 2007

Combinational equivalence checking for threshold logic circuits.

[BibT_eX]

[DOI]

Tejaswi Gowda

Sarma B. K. Vrudhula

Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

Synthesis of threshold logic circuits using tree matching.

[BibT_eX]

[DOI]

Proceedings of the 18th European Conference on Circuit Theory and Design, 2007

Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

Approximation Algorithm for Process Mapping on Network Processor Architectures.

[BibT_eX]

[DOI]

Christopher Ostler

Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

2006

Linear-programming-based techniques for synthesis of network-on-chip architectures.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 2006

Robust optimization of contaminant sensor placement for community water systems.

[BibT_eX]

[DOI]

Math. Program., 2006

Optimal-stretch name-independent compact routing in doubling metrics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Sampling in Higher-Dimensional Peer-to-Peer Systems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Engineering Label-Constrained Shortest-Path Algorithms.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the Shortest Path Problem, 2006

Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment.

[BibT_eX]

[DOI]

Himanshu Joshi

Subhrajit Guhathakurta

John Crittenden

Ke Li

Proceedings of the 7th Annual International Conference on Digital Government Research, 2006

A Tight Lower Bound for the Steiner Point Removal Problem on Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

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

[BibT_eX]

[DOI]

IEEE Trans. Broadcast., 2005

An automated technique for topology and route generation of application specific on-chip interconnection networks.

[BibT_eX]

[DOI]

Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

2004

Budget constrained minimum cost connected medians.

[BibT_eX]

[DOI]

Sven Oliver Krumke

Madhav V. Marathe

J. Discrete Algorithms, 2004

Improved Approximations for Tour and Tree Covers.

[BibT_eX]

[DOI]

Algorithmica, 2004

Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.

[BibT_eX]

[DOI]

Rida A. Bazzi

Proceedings of the Distributed Computing, 18th International Conference, 2004

2002

Approximation algorithms for the covering Steiner problem.

[BibT_eX]

[DOI]

Aravind Srinivasan

Random Struct. Algorithms, 2002

Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities.

[BibT_eX]

[DOI]

Soohyun Oh

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.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the Algorithms, 2002

A theoretical study of optimization techniques used in registration area based location management: models and online algorithms.

[BibT_eX]

[DOI]

Sandeep K. S. Gupta

Georgios Varsamopoulos

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.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

On approximating planar metrics by tree metrics.

[BibT_eX]

[DOI]

F. Sibel Salman

Inf. Process. Lett., 2001

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.

[BibT_eX]

[DOI]

Naveen Garg

J. Algorithms, 2000

An approximation algorithm for the covering Steiner problem.

[BibT_eX]

[DOI]