BibTeX record conf/waoa/IkedaT18

download as .bib file

@inproceedings{DBLP:conf/waoa/IkedaT18,
  author       = {Motoki Ikeda and
                  Shin{-}ichi Tanigawa},
  editor       = {Leah Epstein and
                  Thomas Erlebach},
  title        = {Cut Sparsifiers for Balanced Digraphs},
  booktitle    = {Approximation and Online Algorithms - 16th International Workshop,
                  {WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {11312},
  pages        = {277--294},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-04693-4\_17},
  doi          = {10.1007/978-3-030-04693-4\_17},
  timestamp    = {Sat, 19 Oct 2019 20:34:29 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/IkedaT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.