Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/ita/CerioliFFP11
%A Cerioli, Márcia R.
%A Faria, Luérbio
%A Ferreira, Talita O.
%A Protti, Fábio
%D 2011
%J RAIRO Theor. Informatics Appl.
%K dblp
%N 3
%P 331-346
%T A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
%U http://dblp.uni-trier.de/db/journals/ita/ita45.html#CerioliFFP11
%V 45
@article{journals/ita/CerioliFFP11,
added-at = {2020-06-04T00:00:00.000+0200},
author = {Cerioli, Márcia R. and Faria, Luérbio and Ferreira, Talita O. and Protti, Fábio},
biburl = {https://www.bibsonomy.org/bibtex/2dd5d29c4513d666fab92126d3684f6f8/dblp},
ee = {https://doi.org/10.1051/ita/2011106},
interhash = {2efa9683e50fd2d93d260129c8c787b9},
intrahash = {dd5d29c4513d666fab92126d3684f6f8},
journal = {RAIRO Theor. Informatics Appl.},
keywords = {dblp},
number = 3,
pages = {331-346},
timestamp = {2020-06-05T12:22:00.000+0200},
title = {A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.},
url = {http://dblp.uni-trier.de/db/journals/ita/ita45.html#CerioliFFP11},
volume = 45,
year = 2011
}