Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang.
Folding a better checkerboard.
In *ISAAC*, pages 1074-1083, 2009.
[ bib ]

Charles Colbourn, Peyman Nayeri, and Goran Konjevod.
Randomized postoptimization of covering arrays.
In *Proceedings of IWOCA*, pages 408-419, 2009.
[ bib |
.pdf ]

Goran Konjevod and Ana Maria Kuprešanin.
Notation for a class of paperfolded models.
In *Proceedings of the 12th Annual Bridges Conference, Banff*,
pages 47-54, 2009.
[ bib |
.pdf ]

Sushu Zhang, Karam S. Chatha, and Goran Konjevod.
Near optimal battery-aware energy management.
In *ISLPED*, pages 249-254, 2009.
[ bib ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia.
Dynamic routing and location services in metrics of low doubling
dimension.
In *Proceedings of the 22nd DISC*, volume 5218 of *Lecture
Notes in Computer Science*, pages 379-393, 2008.
[ bib |
.pdf ]

Christopher L. Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav V.
Marathe, and Dorothea Wagner.
Engineering label-constrained shortest-path algorithms.
In *Proceedings of AAIM*, pages 27-37, 2008.
[ bib ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia.
Dynamic routing and location services in metrics of low doubling
dimension.
In *Proceedings of the 27th PODC*, page 417, 2008.
Brief announcement.
[ bib ]

Sushu Zhang, Karam S. Chatha, and Goran Konjevod.
Approximation algorithms for power minimization of earliest deadline
first and rate monotonic schedules.
In *ISLPED '07: Proceedings of the 2007 international symposium
on Low power electronics and design*, pages 225-230, 2007.
[ bib |
DOI |
.pdf ]

Goran Konjevod, Andrea Richa, Donglin Xia, and Hai Yu.
Compact routing with slack in low doubling dimension.
In *Proceedings of the 26th PODC*, pages 71-80, 2007.
[ bib |
DOI |
.pdf ]

Tejaswi Gowda, Samuel Leshner, Sarma B. K. Vrudhula, and Goran Konjevod.
Synthesis of threshold logic circuits using tree matching.
In *Proceedings of the 18th European Conference on Circuit Theory
and Design*, 2007.
[ bib |
.pdf ]

Tejaswi Gowda, Sarma B. K. Vrudhula, and Goran Konjevod.
Combinational equivalence checking for threshold logic circuits.
In *ACM Great Lakes Symposium on VLSI*, pages 102-107, 2007.
[ bib |
.pdf ]

Tejaswi Gowda, Sarma B. K. Vrudhula, and Goran Konjevod.
A non-ilp based threshold logic synthesis methodology.
In *Proceedings of the International Worshop on Logic Synthesis
(IWLS)*, 2007.
[ bib |
.pdf ]

Krisnan Srinivasan, Karam S. Chatha, and Goran Konjevod.
Application specific network-on-chip design with guaranteed quality
approximation algorithms.
In *Proceedings of ASP-DAC*, 2007.
[ bib |
.pdf ]

Chris Ostler, Karam S. Chatha, and Goran Konjevod.
Application throughput maximization on network processor
architectures.
In *Proceedings of ASP-DAC*, 2007.
[ bib |
.pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia.
Optimal scale-free compact routing schemes in networks of low
doubling dimension.
In *Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 939-948, 2007.
[ bib |
.ps.gz ]

Robert D. Carr, Goran Konjevod, Danny Greg Little, Venkatesh Natarajan, and
Ojas D. Parekh.
Compacting cuts: a new linear formulation for minimum cut.
In *Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete
Algorithms*, 2007.
[ bib |
.ps.gz ]

T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, and Andréa W. Richa.
A tight lower bound for Steiner point removal problem on trees.
In *Proceedings of the APPROX*, volume 4110 of *Lecture Notes
in Computer Science*, pages 70-81, 2006.
[ bib |
.pdf ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia.
Optimal-stretch name-independent compact routing in doubling metrics.
In *Proceedings of the 25th PODC*, pages 198-207, 2006.
[ bib |
.ps.gz ]

Himanshu Joshi, Subhrajit Guhathakurta, Goran Konjevod, John Crittenden, and
Ke Li.
Simulating impact of light rail on urban growth in phoenix: an
application of urbansim modeling environment.
In *Proceedings of the 7th Annual International Conference on
Digital Government Research, DG.O 2006*, pages 135-141, 2006.
[ bib ]

Goran Konjevod, Andréa W. Richa, and Donglin Xia.
On sampling in higher-dimensional peer-to-peer systems.
In *Proceedings of the 9th LATIN*, volume 3887 of *Lecture
Notes in Computer Science*, pages 641-652, 2006.
[ bib |
.pdf ]

Krishnan Srinivasan, Karam S. Chatha, and Goran Konjevod.
An automated technique for topology and route generation of
application specific on-chip interconnection networks.
In *Proceedings of the ICCAD*, 2005.
[ bib |
.pdf ]

Rida A. Bazzi and Goran Konjevod.
On the establishment of distinct identities in overlay networks.
In *Proceedings of the 24th PODC*, pages 312-320, 2005.
[ bib |
.ps.gz ]

Rida A. Bazzi and Goran Konjevod.
Efficient verification for provably secure storage and secret sharing
in systems where half the servers are faulty.
In *Proceedings of the 18th DISC*, volume 3274 of *Lecture
Notes in Computer Science*, pages 420-434, 2004.
[ bib |
.pdf ]

Krishnan Srinivasan, Karam S. Chatha, and Goran Konjevod.
Linear programming based techniques for synthesis of network-on-chip
architectures.
In *Proceedings of the 22nd ICCD*, pages 422-429, 2004.
[ bib |
.pdf ]

Sandeep K. S. Gupta, Goran Konjevod, and Georgios Varsamopoulos.
A theoretical study of optimization techniques used in registration
area based location management: models and online algorithms.
In *Proceedings of the 6th DIAL-M*, pages 72-79, 2002.
[ bib |
.ps.gz ]

Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, and Madhav V.
Marathe.
Classical and contemporary shortest path problems in road networks:
Implementation and experimental analysis of the transims router.
In *Proceedings of the 10th ESA*, volume 2461 of *Lecture
Notes in Computer Science*, pages 126-138, 2002.
[ bib |
.pdf ]

Goran Konjevod, Soohyun Oh, and Andréa W. Richa.
Finding most sustainable paths in networks with time-dependent edge
reliabilities.
In *Proceedings of the 5th LATIN*, volume 2286 of *Lecture
Notes in Computer Science*, pages 435-450, 2002.
[ bib |
.ps.gz ]

Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, and
Amitabh Sinha.
On the integrality gap of a natural formulation of the single-sink
buy-at-bulk network design problem.
In *Proceedings of the 8th IPCO*, pages 170-184, 2001.
[ bib |
.ps.gz ]

Jochen Könemann, Goran Konjevod, Ojas Parekh, and Amitabh Sinha.
Improved approximations for tour and tree covers.
In *Proceedings of the 3rd Approx*, volume 1913 of *Lecture
Notes in Computer Science*, pages 184-193, 2000.
[ bib |
.ps.gz ]

Robert D. Carr, Toshihiro Fujito, Goran Konjevod, and Ojas Parekh.
A 2(1)/(10)-approximation algorithm for a generalization of the
weighted edge-dominating set problem.
In *Proceedings of the 8th ESA*, volume 1879 of *Lecture
Notes in Computer Science*, pages 132-142, 2000.
[ bib |
.ps.gz ]

Goran Konjevod, Sven O. Krumke, and Madhav V. Marathe.
Budget constrained minimum cost connected medians.
In *Proceedings of the 26th WG*, volume 1928 of *Lecture
Notes in Computer Science*, pages 267-278, 2000.
[ bib |
.ps.gz ]

Goran Konjevod and R. Ravi.
An approximation algorithm for the covering Steiner problem.
In *Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 338-344, 2000.
[ bib |
.ps.gz ]

Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav V. Marathe.
On the red-blue set cover problem.
In *Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 345-353, 2000.
[ bib |
.ps.gz ]

Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, and
David C. Torney.
Algorithms for optimizing production DNA sequencing.
In *Proceedings of the 11thAnnual ACM-SIAM Symposium on Discrete
Algorithms*, pages 399-408, 2000.
[ bib |
.ps.gz ]

Avrim Blum, Goran Konjevod, R. Ravi, and Santosh Vempala.
Semi-definite relaxations for minimum bandwidth and other
vertex-ordering problems.
In *Proceedings of the 30th Annual ACM Symposium on Theory of
Computing*, pages 100-105, 1998.
[ bib |
.ps.gz ]

Naveen Garg, Goran Konjevod, and R. Ravi.
A polylogarithmic approximation algorithm for the group Steiner
tree problem.
In *Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete
Algorithms*, pages 253-259, 1998.
[ bib |
.ps.gz ]

*This file was generated by
bibtex2html 1.91.*