BibTeX record conf/ciac/GlantzM13

download as .bib file

@inproceedings{DBLP:conf/ciac/GlantzM13,
  author    = {Roland Glantz and
               Henning Meyerhenke},
  title     = {Finding All Convex Cuts of a Plane Graph in Cubic Time},
  booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
               Barcelona, Spain, May 22-24, 2013. Proceedings},
  pages     = {246--263},
  year      = {2013},
  crossref  = {DBLP:conf/ciac/2013},
  url       = {https://doi.org/10.1007/978-3-642-38233-8\_21},
  doi       = {10.1007/978-3-642-38233-8\_21},
  timestamp = {Thu, 15 Jun 2017 21:39:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ciac/GlantzM13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2013,
  editor    = {Paul G. Spirakis and
               Maria J. Serna},
  title     = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
               Barcelona, Spain, May 22-24, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7878},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38233-8},
  doi       = {10.1007/978-3-642-38233-8},
  isbn      = {978-3-642-38232-1},
  timestamp = {Thu, 15 Jun 2017 21:39:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ciac/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier