my-papers.bib

@unpublished{konjevodetal:talg-xx,
  author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
  title = {Optimal-stretch name-independent compact routing
  in doubling metrics},
  note = {Invited for publication in special issue of 
ACM Transactions on Algorithms dedicated to best papers of SODA 2007;
combination of papers from PODC 2006 and SODA 2007; submitted},
  catid1 = {submitted.paper},
  catid1 = {selected.paper},
  catid1 = {approx.paper},
  catid1 = {distributed.paper},
  url = {talg-routing07.pdf},
  year = {2007}
}
@inproceedings{demaineetal:isaac-09,
  author = {Erik D. Demaine and
               Martin L. Demaine and
               Goran Konjevod and
               Robert J. Lang},
  title = {Folding a Better Checkerboard},
  booktitle = {ISAAC},
  year = {2009},
  pages = {1074-1083},
  catid1 = {origami},
  catid1 = {conference.paper},
  catid1 = {selected.paper}
}
@incollection{guhathakurtaetal:digitalphoenix-09,
  author = {Subhrajit Guhathakurta and Yoshi Kobayashi and
 Mookesh Patel and Janet Holston and Tim Lant and
 John Crittenden and Ke Li and Goran Konjevod and 
 Karthikeya Date},
  title = {Digital Phoenix Project: A Multidimensional Journey 
 through Time},
  booktitle = {Visualizing Sustainable Planning},
  editor = {Gerhard Steinebach and Subhrajit Guhathakurta and Hans Hagen},
  year = {2009},
  publisher = {Springer},
  pages = {159--184},
  catid1 = {sim.paper},
  catid1 = {bookchapter}
}
@incollection{barrettetal:dimacs-09,
  author = {Chris Barrett and Keith Bisset and Martin Holzer and 
  Goran Konjevod and Madhav Marathe and Dorothea Wagner},
  title = {Engineering Label-Constrained Shortest-Path Algorithms},
  booktitle = {The Shortest Path Problem: Ninth DIMACS Implementation Challenge},
  editor = {Camil Demetrescu and Andrew Goldberg and David S. Johnson},
  year = {2009},
  pages = {309--318},
  publisher = {AMS and DIMACS},
  catid1 = {shpaths.paper},
  catid1 = {bookchapter}
}
@inproceedings{colbournetal:iwoca-09,
  author = {Charles Colbourn and Peyman Nayeri and Goran Konjevod},
  title = {Randomized postoptimization of covering arrays},
  booktitle = {Proceedings of IWOCA},
  year = {2009},
  pages = {408-419},
  catid1 = {conference.paper},
  catid1 = {other.paper},
  url = {iwoca2009.pdf}
}
@inproceedings{konjevodkupresanin:bridges-09,
  author = {Goran Konjevod and Ana Maria Kupre{\v s}anin},
  title = {Notation for a class of paperfolded models},
  booktitle = {Proceedings of the 12th Annual Bridges Conference, Banff},
  year = {2009},
  pages = {47--54},
  catid1 = {conference.paper},
  ecatid1 = {origami},
  catid1 = {selected.paper},
  catid1 = {other.paper},
  url = {bridges2009.pdf}
}
@inproceedings{zhangetal:islped-09,
  author = {Sushu Zhang and
               Karam S. Chatha and
               Goran Konjevod},
  title = {Near optimal battery-aware energy management},
  booktitle = {ISLPED},
  year = {2009},
  pages = {249-254},
  catid1 = {conference.paper},
  catid1 = {cad.paper}
}
@incollection{konjevod:4osme-09,
  author = {Goran Konjevod},
  title = {Integer programming models for flat origami},
  booktitle = {Origami 4, Proceedings of 4OSME: 4th International Conference on Origami
Science, Mathematics and Education},
  year = {2009},
  editor = {Robert J. Lang},
  pages = {207--216},
  catid1 = {selected.paper},
  catid1 = {bookchapter},
  catid1 = {origami},
  catid1 = {other.paper},
  http = {4osme.mod},
  url = {4osme.pdf}
}
@article{carretal:talg-09,
  author = {Robert D. Carr and Goran Konjevod and Danny Greg Little
  and Venkatesh Natarajan and Ojas D. Parekh},
  title = {Compacting cuts: a new linear formulation for minimum cut},
  note = {Special issue dedicated to best papers of SODA 2007},
  journal = {ACM Transactions on Algorithms},
  volume = {5},
  issue = {3},
  year = {2009},
  pages = {27:1--27:16},
  catid1 = {polyhedral.paper},
  catid1 = {journal.paper},
  url = {talg-cuts.pdf}
}
@article{kiersteadkonjevod:combinatorica-09,
  author = {Henry A. Kierstead and Goran Konjevod},
  title = {Coloring number and on-line {R}amsey theory for
  graphs and hypergraphs},
  year = {2009},
  journal = {Combinatorica},
  volume = {29},
  number = {1},
  pages = {49--64},
  catid1 = {ramsey.paper},
  catid1 = {journal.paper},
  catid1 = {selected.paper},
  url = {051231-sub-combinatorica.ps.gz}
}
@article{chathaetal:tcad-08,
  author = {Karam S. Chatha and
               Krishnan Srinivasan and
               Goran Konjevod},
  title = {Automated Techniques for Synthesis of Application-Specific
               Network-on-Chip Architectures},
  journal = {IEEE Trans. on CAD of Integrated Circuits and Systems},
  volume = {27},
  number = {8},
  year = {2008},
  pages = {1425-1438},
  catid1 = {journal.paper},
  catid1 = {cad.paper}
}
@inproceedings{konjevodetal:disc-08,
  author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
  title = {Dynamic routing and location services in metrics of 
low doubling dimension},
  booktitle = {Proceedings of the  22nd DISC},
  series = {Lecture Notes in Computer Science},
  volume = {5218},
  year = {2008},
  pages = {379--393},
  catid1 = {conference.paper},
  catid1 = {distributed.paper},
  catid1 = {approx.paper},
  catid1 = {selected.paper},
  url = {dynamic-routing.pdf}
}
@inproceedings{barrettetal:aaim-08,
  author = {Christopher L. Barrett and
               Keith Bisset and
               Martin Holzer and
               Goran Konjevod and
               Madhav V. Marathe and
               Dorothea Wagner},
  title = {Engineering Label-Constrained Shortest-Path Algorithms},
  booktitle = {Proceedings of AAIM},
  year = {2008},
  pages = {27-37},
  catid1 = {conference.paper},
  catid1 = {shpaths.paper}
}
@incollection{konjevod:encyclopedia-07,
  author = {Goran Konjevod},
  title = {Separators ({L}eighton-{R}ao)},
  booktitle = {Encyclopedia of Algorithms},
  editor = {Ming-Yang Kao},
  catid1 = {bookchapter},
  pages = {815--818},
  url = {separators.pdf},
  year = 2008
}
@inproceedings{konjevodetal:podc-08,
  author = {Goran Konjevod and
               Andr{\'e}a W. Richa and
               Donglin Xia},
  title = {Dynamic routing and location services in metrics of low
               doubling dimension},
  booktitle = {Proceedings of the  27th PODC},
  year = {2008},
  pages = {417},
  note = {Brief announcement},
  ee = {http://doi.acm.org/10.1145/1400751.1400808},
  catid1 = {conference.paper},
  catid1 = {distributed.paper}
}
@inproceedings{zhangetal:islped-07,
  author = {Sushu Zhang and Karam S. Chatha and Goran Konjevod},
  title = {Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules},
  booktitle = {ISLPED '07: Proceedings of the 2007 international symposium on Low power electronics and design},
  year = {2007},
  pages = {225--230},
  doi = {http://doi.acm.org/10.1145/1283780.1283828},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {cad.paper},
  url = {islped07.pdf}
}
@inproceedings{konjevodetal:podc-07,
  author = {Goran Konjevod and Andrea Richa and Donglin Xia and Hai Yu},
  title = {Compact routing with slack in low doubling dimension},
  booktitle = {Proceedings of the  26th PODC},
  year = {2007},
  isbn = {978-1-59593-616-5},
  pages = {71--80},
  location = {Portland, Oregon, USA},
  doi = {http://doi.acm.org/10.1145/1281100.1281113},
  catid1 = {conference.paper},
  catid1 = {distributed.paper},
  catid1 = {approx.paper},
  catid1 = {selected.paper},
  url = {podc07.pdf}
}
@inproceedings{gowdaetal:ecctd-07,
  title = {Synthesis of Threshold Logic Circuits Using Tree Matching},
  author = {Tejaswi Gowda and
            Samuel Leshner and
               Sarma B. K. Vrudhula and
               Goran Konjevod},
  booktitle = {Proceedings of the 18th European Conference on Circuit Theory and Design},
  year = {2007},
  catid1 = {conference.paper},
  catid1 = {cad.paper},
  url = {2007 ecctd matching.pdf}
}
@inproceedings{gowdaetal:glsvlsi-07,
  author = {Tejaswi Gowda and
               Sarma B. K. Vrudhula and
               Goran Konjevod},
  title = {Combinational equivalence checking for threshold logic
circuits.},
  booktitle = {ACM Great Lakes Symposium on VLSI},
  year = {2007},
  pages = {102-107},
  ee = {http://doi.acm.org/10.1145/1228784.1228813},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  catid1 = {conference.paper},
  catid1 = {cad.paper},
  url = {2007 glsvlsi thresholdequiv.pdf}
}
@inproceedings{gowdaetal:iwls-07,
  author = {Tejaswi Gowda and
               Sarma B. K. Vrudhula and
               Goran Konjevod},
  title = {A non-ILP based threshold logic synthesis methodology},
  year = {2007},
  booktitle = {Proceedings of the International Worshop on Logic Synthesis (IWLS)},
  catid1 = {conference.paper},
  catid1 = {cad.paper},
  url = {iwls2007.pdf}
}
@inproceedings{srinivasanetal:aspdac-07,
  author = {Krisnan Srinivasan and Karam S. Chatha 
and Goran Konjevod},
  title = {Application Specific Network-on-Chip Design with 
Guaranteed Quality Approximation Algorithms},
  booktitle = {Proceedings of ASP-DAC},
  year = {2007},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {polyhedral.paper},
  catid1 = {cad.paper},
  url = {noc-aspdac07.pdf}
}
@inproceedings{ostleretal:aspdac-07,
  author = {Chris Ostler and Karam S. Chatha
and Goran Konjevod},
  title = {Application Throughput Maximization on 
Network Processor Architectures},
  booktitle = {Proceedings of ASP-DAC},
  catid1 = {conference.paper},
  catid1 = {cad.paper},
  year = 2007,
  url = {throughput-aspdac07.pdf}
}
@inproceedings{konjevodetal:soda-07,
  author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
  title = {Optimal scale-free compact routing schemes in networks
of low doubling dimension},
  booktitle = {Proceedings of the  17th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {939--948},
  url = {06scalefree.ps.gz},
  catid1 = {conference.paper},
  catid1 = {selected.paper},
  catid1 = {approx.paper},
  catid2 = {c.approx},
  catid1 = {distributed.paper},
  year = {2007}
}
@inproceedings{carretal:soda-07,
  author = {Robert D. Carr and Goran Konjevod and Danny Greg Little
  and Venkatesh Natarajan and Ojas D. Parekh},
  title = {Compacting cuts: a new linear formulation for minimum cut},
  booktitle = {Proceedings of the  17th Annual ACM-SIAM Symposium on Discrete Algorithms},
  year = {2007},
  catid1 = {conference.paper},
  catid1 = {selected.paper},
  catid1 = {polyhedral.paper},
  url = {mincut.ps.gz}
}
@article{bazzikonjevod:dc-06,
  author = {Rida A. Bazzi and Goran Konjevod},
  title = {On the establishment of distinct identities in overlay networks},
  note = {Special issue with best papers of PODC 2005},
  journal = {Distributed Computing},
  volume = {19},
  number = {4},
  pages = {267--287},
  year = {2007},
  catid1 = {selected.paper},
  catid1 = {distributed.paper},
  catid1 = {journal.paper},
  url = {dc06.pdf}
}
@article{joshietal:jut-06,
  author = {Himanshu Joshi and
               Subhrajit Guhathakurta and
               Goran Konjevod and
               John Crittenden and
               Ke Li},
  title = {Simulating impact of light rail on urban growth in {P}hoenix:
               an application of the {U}rban{S}im modeling environment.},
  journal = {Journal of Urban Technology},
  year = {2006},
  pages = {91--111},
  catid1 = {journal.paper},
  catid1 = {sim.paper},
  url = {CJUT_A_187137_0.pdf},
  catid1 = {other.paper}
}
@inproceedings{chanetal:steiner-06,
  author = {T.-H. Hubert Chan and Donglin Xia and Goran Konjevod
and Andr\'{e}a W. Richa},
  title = {A tight lower bound for {S}teiner point removal problem
  on trees},
  booktitle = {Proceedings of the APPROX},
  series = {Lecture Notes in Computer Science},
  volume = 4110,
  pages = {70--81},
  year = {2006},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {metric.paper},
  url = {steinerremoval.pdf}
}
@inproceedings{konjevodetal:podc-06,
  author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
  title = {Optimal-stretch name-independent compact routing
  in doubling metrics},
  booktitle = {Proceedings of the  25th PODC},
  pages = {198--207},
  url = {routing-podc06.ps.gz},
  catid1 = {conference.paper},
  catid1 = {selected.paper},
  catid1 = {approx.paper},
  catid1 = {distributed.paper},
  year = {2006}
}
@inproceedings{joshietal:dgo-06,
  author = {Himanshu Joshi and
               Subhrajit Guhathakurta and
               Goran Konjevod and
               John Crittenden and
               Ke Li},
  title = {Simulating impact of light rail on urban growth in Phoenix:
               an application of urbansim modeling environment.},
  booktitle = {Proceedings of the 7th Annual International Conference on
               Digital Government Research, DG.O 2006},
  year = {2006},
  catid1 = {conference.paper},
  catid1 = {sim.paper},
  pages = {135-141},
  catid1 = {other.paper}
}
@article{srinivasanetal:tvlsi-06,
  author = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
  title = {Linear-programming-based techniques for synthesis of 
   network-on-chip architectures},
  journal = {IEEE Trans. VLSI Syst.},
  volume = {14},
  number = {4},
  pages = {407-420},
  year = {2006},
  catid1 = {journal.paper},
  catid1 = {cad.paper},
  url = {tvlsi05.pdf}
}
@article{carretal:mpb-06,
  author = {Robert D. Carr and William E. Hart and Harvey J. Greenberg
  and Goran Konjevod and Erik Lauer and Henry Lin and Tod Morrison
  and Cynthia A. Phillips},
  title = {Robust Optimization of Contaminant Sensor Placement 
for Community Water Systems},
  journal = {Math. Programming, Ser. B},
  volume = {107},
  number = {1-2},
  year = {2006},
  pages = {337-356},
  catid1 = {journal.paper},
  catid1 = {polyhedral.paper},
  note = {Special issue on Robust Optimization},
  url = {robustopt05.pdf}
}
@inproceedings{konjevodetal:latin-06,
  author = {Goran Konjevod and Andr\'{e}a W. Richa and Donglin Xia},
  title = {On sampling in higher-dimensional peer-to-peer systems},
  booktitle = {Proceedings of the  9th LATIN},
  year = {2006},
  pages = {641--652},
  series = {Lecture Notes in Computer Science},
  volume = {3887},
  catid1 = {conference.paper},
  catid1 = {distributed.paper},
  url = {latin06.pdf}
}
@unpublished{konjevod:dst-05,
  author = {Goran Konjevod},
  title = {Directed {S}teiner trees, linear programs and
randomized rounding},
  year = {2005},
  note = {Manuscript, 8 pages},
  catid1 = {approx.paper},
  catid1 = {polyhedral.paper},
  url = {dst.ps.gz}
}
@article{ohetal:tbroadcasting-05,
  author = {Soohyun Oh and Yo Huh and Beshlan Kulapala and
  Goran Konjevod and Andr\'{e}a W. Richa and Martin Reisslein},
  title = {A modular algorithm-theoretic framework for the 
  fair and efficient collaborative prefetching of continuous media},
  journal = {IEEE Transactions on Broadcasting},
  volume = 51,
  number = 2,
  pages = {200--215},
  year = 2005,
  catid1 = {journal.paper},
  url = {OhKKRR_TB05.pdf},
  catid1 = {other.paper}
}
@inproceedings{srinivasanetal:iccad-05,
  author = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
  title = {An Automated Technique for Topology and Route Generation
  of Application Specific On-Chip Interconnection Networks},
  booktitle = {Proceedings of the ICCAD},
  year = {2005},
  pages = {},
  catid1 = {conference.paper},
  catid1 = {polyhedral.paper},
  catid1 = {cad.paper},
  url = {ICCAD05.pdf}
}
@inproceedings{bazzikonjevod:podc-05,
  author = {Rida A. Bazzi and Goran Konjevod},
  title = {On the establishment of distinct identities in overlay networks},
  booktitle = {Proceedings of the  24th PODC},
  pages = {312--320},
  year = 2005,
  catid1 = {conference.paper},
  catid1 = {distributed.paper},
  url = {podc05.ps.gz}
}
@incollection{carrkonjevod:poly-04,
  author = {Robert D. Carr and Goran Konjevod},
  editor = {Harvey Greenberg},
  booktitle = {Tutorials on emerging methodologies and applications
in Operations Research},
  chapter = {2},
  title = {Polyhedral Combinatorics},
  publisher = {Springer},
  year = {2004},
  pages = {(2-1)--(2-48)},
  catid1 = {polyhedral.paper},
  catid1 = {bookchapter},
  catid1 = {selected.paper},
  url = {Chapter2.pdf}
}
@article{konjevodetal:jda-04,
  author = {Goran Konjevod and Sven O. Krumke and Madhav V. Marathe},
  title = {Budget constrained minimum cost connected medians},
  journal = {J. Discrete Algorithms},
  volume = {2},
  number = {4},
  pages = {453--469},
  year = {2004},
  catid1 = {journal.paper},
  catid1 = {approx.paper},
  catid2 = {c.approx},
  url = {conmed.ps.gz}
}
@inproceedings{bazzikonjevod:disc-04,
  author = {Rida A. Bazzi and Goran Konjevod},
  title = {Efficient Verification for Provably Secure Storage 
and Secret Sharing in Systems Where Half the Servers Are Faulty},
  booktitle = {Proceedings of the  18th DISC},
  year = {2004},
  series = {Lecture Notes in Computer Science},
  volume = {3274},
  pages = {420--434},
  catid1 = {conference.paper},
  catid1 = {distributed.paper},
  url = {disc04.pdf}
}
@unpublished{bazzikonjevod:disc-04erratum,
  author = {Rida A. Bazzi and Goran Konjevod},
  title = {Erratum: Efficient Verification for Provably Secure Storage 
and Secret Sharing in Systems Where Half the Servers Are Faulty},
  year = {2004},
  catid1 = {distributed.paper},
  url = {disc04-erratum.pdf}
}
@inproceedings{srinivasanetal:iccd-04,
  author = {Krishnan Srinivasan and Karam S. Chatha and Goran Konjevod},
  title = {Linear Programming Based Techniques for Synthesis of 
Network-on-Chip Architectures},
  booktitle = {Proceedings of the  22nd ICCD},
  pages = {422--429},
  year = {2004},
  catid1 = {cad.paper},
  catid1 = {conference.paper},
  url = {iccd04.pdf}
}
@article{koenemannetal:algorithmica-03,
  author = {Jochen K\"{o}nemann and Goran Konjevod and
  Ojas Parekh and Amitabh Sinha},
  title = {Improved Approximations for Tour and Tree Covers},
  journal = {Algorithmica},
  volume = {38},
  number = {3},
  pages = {441--449},
  year = {2003},
  catid1 = {approx.paper},
  catid1 = {journal.paper},
  catid1 = {polyhedral.paper},
  url = {tc.pdf}
}
@inproceedings{guptaetal:dialm-02,
  author = {Sandeep K. S. Gupta and Goran Konjevod and Georgios Varsamopoulos},
  title = {A theoretical study of optimization techniques used in 
  registration area based location management: models and online algorithms},
  booktitle = {Proceedings of the  6th DIAL-M},
  year = {2002},
  pages = {72--79},
  catid1 = {conference.paper},
  url = {dialm02.ps.gz},
  catid1 = {other.paper}
}
@inproceedings{barrettetal:esa-02,
  author = {Christopher L. Barrett and Keith Bisset and Riko Jacob
  and Goran Konjevod and Madhav V. Marathe},
  title = {Classical and Contemporary Shortest Path Problems in Road 
  Networks: Implementation and Experimental Analysis of the TRANSIMS Router},
  booktitle = {Proceedings of the  10th ESA},
  year = {2002},
  series = {Lecture Notes in Computer Science},
  volume = {2461},
  pages = {126--138},
  catid1 = {conference.paper},
  catid1 = {shpaths.paper},
  url = {transims.pdf}
}
@inproceedings{konjevodetal:latin-02,
  author = {Goran Konjevod and Soohyun Oh and Andr\'{e}a W. Richa},
  title = {Finding Most Sustainable Paths in Networks with 
Time-Dependent Edge Reliabilities},
  booktitle = {Proceedings of the  5th LATIN},
  year = {2002},
  series = {Lecture Notes in Computer Science},
  volume = {2286},
  pages = {435--450},
  catid1 = {conference.paper},
  url = {oh.ps.gz},
  catid1 = {other.paper}
}
@article{konjevodetal:rsa-02,
  author = {Goran Konjevod and R. Ravi and Aravind Srinivasan},
  title = {Approximation algorithms for the covering {S}teiner problem},
  journal = {Random Struct. Algorithms},
  volume = {20},
  number = {3},
  pages = {465-482},
  year = {2002},
  catid1 = {selected.paper},
  catid1 = {journal.paper},
  catid1 = {approx.paper},
  url = {cst.ps.gz}
}
@inproceedings{gargetal:ipco-01,
  author = {Naveen Garg and Rohit Khandekar and Goran Konjevod 
  and R. Ravi and F. Sibel Salman and Amitabh Sinha},
  title = {On the Integrality Gap of a Natural Formulation of the Single-Sink
  Buy-at-Bulk Network Design Problem},
  booktitle = {Proceedings of the  8th IPCO},
  year = {2001},
  pages = {170--184},
  catid1 = {approx.paper},
  catid1 = {conference.paper},
  catid1 = {polyhedral.paper},
  url = {dd.ps.gz}
}
@article{konjevodetal:ipl-01,
  author = {Goran Konjevod and R. Ravi and F. Sibel Salman},
  title = {On approximating planar metrics by tree metrics},
  journal = {Information Processing Letters},
  volume = {80},
  number = {4},
  pages = {213--219},
  year = {2001},
  catid1 = {journal.paper},
  catid1 = {metric.paper},
  url = {metrics.ps.gz}
}
@article{carretal:jco-01,
  author = {Robert D. Carr and Toshihiro Fujito and Goran Konjevod
  and Ojas Parekh},
  title = {A 2$\frac{1}{10}$-Approximation Algorithm for a Generalization 
  of the Weighted Edge-Dominating Set Problem},
  journal = {J. Comb. Optim.},
  volume = {5},
  number = {3},
  pages = {317--326},
  year = {2001},
  catid1 = {approx.paper},
  catid1 = {journal.paper},
  catid1 = {polyhedral.paper},
  url = {eds.ps.gz}
}
@inproceedings{koenemannetal:approx-00,
  author = {Jochen K\"{o}nemann and Goran Konjevod and
  Ojas Parekh and Amitabh Sinha},
  title = {Improved Approximations for Tour and Tree Covers},
  booktitle = {Proceedings of the  3rd Approx},
  pages = {184--193},
  series = {Lecture Notes in Computer Science},
  volume = {1913},
  year = {2000},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {polyhedral.paper},
  url = {tc.ps.gz}
}
@inproceedings{carretal:esa-00,
  author = {Robert D. Carr and Toshihiro Fujito and Goran Konjevod
  and Ojas Parekh},
  title = {A 2$\frac{1}{10}$-Approximation Algorithm for a Generalization 
  of the Weighted Edge-Dominating Set Problem},
  booktitle = {Proceedings of the  8th ESA},
  series = {Lecture Notes in Computer Science},
  volume = 1879,
  pages = {132--142},
  year = {2000},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {polyhedral.paper},
  url = {eds-proc.ps.gz}
}
@inproceedings{konjevodetal:wg-00,
  author = {Goran Konjevod and Sven O. Krumke and Madhav V. Marathe},
  title = {Budget constrained minimum cost connected medians},
  booktitle = {Proceedings of the  26th WG},
  series = {Lecture Notes in Computer Science},
  volume = {1928},
  pages = {267--278},
  year = {2000},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  url = {conmed-proc.ps.gz}
}
@inproceedings{konjevodravi:soda-00,
  author = {Goran Konjevod and R. Ravi},
  title = {An approximation algorithm for the covering {S}teiner problem},
  booktitle = {Proceedings of the  11th Annual ACM-SIAM Symposium on Discrete Algorithms},
  year = {2000},
  pages = {338--344},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  url = {cst-proc.ps.gz}
}
@inproceedings{carretal:soda-00rb,
  author = {Robert D. Carr and Srinivas Doddi and Goran Konjevod and
Madhav V. Marathe},
  title = {On the red-blue set cover problem},
  booktitle = {Proceedings of the  11th Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {345--353},
  year = {2000},
  catid1 = {selected.paper},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  catid1 = {polyhedral.paper},
  url = {rb-proc.ps.gz}
}
@inproceedings{czabarkaetal:soda-00,
  author = {\'{E}va Czabarka and Goran Konjevod and Madhav V. Marathe
  and Allon G. Percus and David C. Torney},
  title = {Algorithms for optimizing production {D}{N}{A} sequencing},
  booktitle = {Proceedings of the  11thAnnual ACM-SIAM Symposium on Discrete Algorithms},
  pages = {399--408},
  catid1 = {conference.paper},
  catid1 = {compbio.paper},
  catid1 = {other.paper},
  year = {2000},
  url = {dna.ps.gz}
}
@article{blumetal:tcs-00,
  author = {Avrim Blum and Goran Konjevod and R. Ravi and Santosh Vempala},
  title = {Semi-definite relaxations for minimum bandwidth and other 
  vertex-ordering problems},
  journal = {Theor. Comput. Sci.},
  volume = {235},
  number = {1},
  pages = {25--42},
  year = {2000},
  catid1 = {journal.paper},
  catid1 = {approx.paper},
  url = {bw.ps.gz}
}
@article{gargetal:jalg-00,
  author = {Naveen Garg and Goran Konjevod and R. Ravi},
  title = {A polylogarithmic approximation algorithm for the group {S}teiner tree
problem},
  journal = {J. Algorithms},
  volume = {37},
  year = {2000},
  pages = {66--84},
  catid1 = {selected.paper},
  catid1 = {journal.paper},
  catid1 = {approx.paper},
  url = {gst.ps.gz}
}
@inproceedings{blumetal:stoc-98,
  author = {Avrim Blum and Goran Konjevod and R. Ravi and Santosh Vempala},
  title = {Semi-definite relaxations for minimum bandwidth and other 
  vertex-ordering problems},
  booktitle = {Proceedings of the  30th Annual ACM Symposium on Theory of Computing},
  pages = {100--105},
  year = {1998},
  catid1 = {conference.paper},
  catid1 = {approx.paper},
  url = {bw-proc.ps.gz}
}
@inproceedings{gargetal:soda-98,
  author = {Naveen Garg and Goran Konjevod and R. Ravi},
  title = {A polylogarithmic approximation algorithm for the group {S}teiner tree
problem},
  booktitle = {Proceedings of the  9th Annual ACM-SIAM Symposium on Discrete Algorithms},
  year = {1998},
  pages = {253--259},
  catid1 = {approx.paper},
  catid1 = {conference.paper},
  url = {gst-proc.ps.gz}
}

This file was generated by bibtex2html 1.91.