BibTeX record conf/latin/AbreuCFFKMPP18

• > Home > conf/latin/AbreuCFFKMPP18

@inproceedings{DBLP:conf/latin/AbreuCFFKMPP18,
  author       = {Alexandre Santiago de Abreu and
                  Lu{\'{\i}}s Felipe I. Cunha and
                  Tharso D. Fernandes and
                  Celina M. H. de Figueiredo and
                  Luis Antonio Brasil Kowada and
                  Franklin L. Marquezino and
                  Daniel Posner and
                  Renato Portugal},
  editor       = {Michael A. Bender and
                  Martin Farach{-}Colton and
                  Miguel A. Mosteiro},
  title        = {The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms
                  and Hardness},
  booktitle    = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
                  Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10807},
  pages        = {1--13},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-77404-6\_1},
  doi          = {10.1007/978-3-319-77404-6\_1},
  timestamp    = {Sat, 19 Oct 2019 20:12:42 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/AbreuCFFKMPP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}