BibTeX record conf/fun/BiloG0M18

download as .bib file

@inproceedings{DBLP:conf/fun/BiloG0M18,
  author    = {Davide Bil{\`{o}} and
               Luciano Gual{\`{a}} and
               Stefano Leucci and
               Neeldhara Misra},
  title     = {On the Complexity of Two Dots for Narrow Boards and Few Colors},
  booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
               13-15, 2018, La Maddalena, Italy},
  pages     = {7:1--7:15},
  year      = {2018},
  crossref  = {DBLP:conf/fun/2018},
  url       = {https://doi.org/10.4230/LIPIcs.FUN.2018.7},
  doi       = {10.4230/LIPIcs.FUN.2018.7},
  timestamp = {Wed, 25 Sep 2019 18:18:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fun/BiloG0M18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fun/2018,
  editor    = {Hiro Ito and
               Stefano Leonardi and
               Linda Pagli and
               Giuseppe Prencipe},
  title     = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
               13-15, 2018, La Maddalena, Italy},
  series    = {LIPIcs},
  volume    = {100},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-067-5},
  isbn      = {978-3-95977-067-5},
  timestamp = {Thu, 02 May 2019 17:40:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fun/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics