Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/latin/AbreuCFFKMPP18
%A de Abreu, Alexandre Santiago
%A Cunha, Luís Felipe I.
%A Fernandes, Tharso D.
%A de Figueiredo, Celina M. H.
%A Kowada, Luis Antonio Brasil
%A Marquezino, Franklin L.
%A Posner, Daniel
%A Portugal, Renato
%B LATIN
%D 2018
%E Bender, Michael A.
%E Farach-Colton, Martin
%E Mosteiro, Miguel A.
%I Springer
%K dblp
%P 1-13
%T The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
%U http://dblp.uni-trier.de/db/conf/latin/latin2018.html#AbreuCFFKMPP18
%V 10807
%@ 978-3-319-77404-6
@inproceedings{conf/latin/AbreuCFFKMPP18,
added-at = {2019-10-19T00:00:00.000+0200},
author = {de Abreu, Alexandre Santiago and Cunha, Luís Felipe I. and Fernandes, Tharso D. and de Figueiredo, Celina M. H. and Kowada, Luis Antonio Brasil and Marquezino, Franklin L. and Posner, Daniel and Portugal, Renato},
biburl = {https://www.bibsonomy.org/bibtex/289b6fdd00decf581d9a5b573742eff9a/dblp},
booktitle = {LATIN},
crossref = {conf/latin/2018},
editor = {Bender, Michael A. and Farach-Colton, Martin and Mosteiro, Miguel A.},
ee = {https://doi.org/10.1007/978-3-319-77404-6_1},
interhash = {1c4a654613bed3c9b07157bfed699774},
intrahash = {89b6fdd00decf581d9a5b573742eff9a},
isbn = {978-3-319-77404-6},
keywords = {dblp},
pages = {1-13},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-10-22T13:54:30.000+0200},
title = {The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.},
url = {http://dblp.uni-trier.de/db/conf/latin/latin2018.html#AbreuCFFKMPP18},
volume = 10807,
year = 2018
}