BibTeX record conf/soda/JansenM15

download as .bib file

@inproceedings{DBLP:conf/soda/JansenM15,
  author    = {Bart M. P. Jansen and
               D{\'{a}}niel Marx},
  title     = {Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time
               algorithms, kernels, and Turing kernels},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {616--629},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.42},
  doi       = {10.1137/1.9781611973730.42},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/JansenM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2015,
  editor    = {Piotr Indyk},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730},
  doi       = {10.1137/1.9781611973730},
  isbn      = {978-1-61197-374-7},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Schloss Dagstuhl LZI