Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

Abu-Khzam, Faisal N.; Fernau, Henning

dc.creator	Abu-Khzam, Faisal N.	en_US
dc.creator	Fernau, Henning	en_US
dc.date.accessioned	2016-11-09T09:37:05Z
dc.date.available	2016-11-09T09:37:05Z
dc.date.datecopyrighted	2006	en_US
dc.identifier.issn	1571-0653	en_US
dc.identifier.uri	http://hdl.handle.net/10725/4762
dc.language.iso	en	en_US
dc.title	Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs	en_US
dc.type	Article	en_US
dc.description.version	Published	en_US
dc.creator.school	SAS	en_US
dc.creator.identifier	200302941	en_US
dc.creator.department	Computer Science and Mathematics	en_US
dc.description.embargo	N/A	en_US
dc.relation.ispartof	Electronic Notes in Discrete Mathematics	en_US
dc.description.volume	25	en_US
dc.identifier.doi	http://dx.doi.org/10.1016/j.endm.2006.06.049	en_US
dc.identifier.ctation	Khzam, F. N. A., & Fernau, H. (2006). Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. Electronic Notes in Discrete Mathematics, (25), 1-6.	en_US
dc.creator.email	faisal.abukhzam@lau.edu.lb	en_US
dc.description.tou	http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php	en_US
dc.identifier.url	http://www.sciencedirect.com/science/article/pii/S1571065306000503	en_US
dc.identifier.orcid	https://orcid.org/0000-0001-5221-8421
dc.identifier.orcid	https://orcid.org/0000-0001-5221-8421	en_US