BibTeX record conf/wads/BermanDK09

download as .bib file

@inproceedings{DBLP:conf/wads/BermanDK09,
  author    = {Piotr Berman and
               Bhaskar DasGupta and
               Marek Karpinski},
  title     = {Approximating Transitive Reductions for Directed Networks},
  booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  pages     = {74--85},
  year      = {2009},
  crossref  = {DBLP:conf/wads/2009},
  url       = {https://doi.org/10.1007/978-3-642-03367-4\_7},
  doi       = {10.1007/978-3-642-03367-4\_7},
  timestamp = {Sun, 21 May 2017 00:16:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/BermanDK09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/2009,
  editor    = {Frank K. H. A. Dehne and
               Marina L. Gavrilova and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Csaba D. T{\'{o}}th},
  title     = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5664},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03367-4},
  doi       = {10.1007/978-3-642-03367-4},
  isbn      = {978-3-642-03366-7},
  timestamp = {Sun, 21 May 2017 00:16:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier