Reduction Rules Deliver Efficient FPT Algorithms for Covering Points with Lines

File Size Format
61052_1.pdf 466Kb Adobe PDF View
Title Reduction Rules Deliver Efficient FPT Algorithms for Covering Points with Lines
Author Estivill-Castro, Vladimir; Heednacram, Apichat; Suraweera, Francis
Year Published 2009
Publisher Association for Computing Machinery
Citation Journal of Experimental Algorithmics, Vol. 14, pp. 1-26
Peer Reviewed Yes
Published Yes
Publisher URI http://www.jea.acm.org/
Alternative URI http://doi.acm.org/10.1145/1498698.1626535
Copyright Statement Copyright ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Journal of Experimental Algorithmics (JEA), Volume 14, December 2009, http://doi.acm.org/10.1145/1498698.1626535
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Science, Environment, Engineering and Technology
Publication Type Journal Articles (Refereed Article)

Full Record

Griffith University copyright notice