BibTeX record conf/walcom/Brinkmeier09

download as .bib file

@inproceedings{DBLP:conf/walcom/Brinkmeier09,
  author       = {Michael Brinkmeier},
  editor       = {Sandip Das and
                  Ryuhei Uehara},
  title        = {Minimum Cuts of Simple Graphs in Almost Always Linear Time},
  booktitle    = {{WALCOM:} Algorithms and Computation, Third International Workshop,
                  {WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5431},
  pages        = {226--237},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-00202-1\_20},
  doi          = {10.1007/978-3-642-00202-1\_20},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/Brinkmeier09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.