Florent Foucaud. The Complexity of the Identifying Code Problem in Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard, editors, Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers. Volume 8288 of Lecture Notes in Computer Science, pages 150-163, Springer, 2013. [doi]
@inproceedings{Foucaud13, title = {The Complexity of the Identifying Code Problem in Restricted Graph Classes}, author = {Florent Foucaud}, year = {2013}, doi = {10.1007/978-3-642-45278-9_14}, url = {http://dx.doi.org/10.1007/978-3-642-45278-9_14}, researchr = {https://researchr.org/publication/Foucaud13}, cites = {0}, citedby = {0}, pages = {150-163}, booktitle = {Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers}, editor = {Thierry Lecroq and Laurent Mouchard}, volume = {8288}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-45277-2}, }