%0 Journal Article %1 journals/tcs/BroersmaGP13 %A Broersma, Hajo %A Golovach, Petr A. %A Patel, Viresh %D 2013 %J Theor. Comput. Sci. %K dblp %P 69-84 %T Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. %U http://dblp.uni-trier.de/db/journals/tcs/tcs485.html#BroersmaGP13 %V 485

@article{journals/tcs/BroersmaGP13, added-at = {2021-02-17T00:00:00.000+0100}, author = {Broersma, Hajo and Golovach, Petr A. and Patel, Viresh}, biburl = {https://www.bibsonomy.org/bibtex/23117d24dd3b4395bc27c8b63d4abec9a/dblp}, ee = {https://doi.org/10.1016/j.tcs.2013.03.008}, interhash = {7b4b88a7ed2722ba4b1ecbc449116770}, intrahash = {3117d24dd3b4395bc27c8b63d4abec9a}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, pages = {69-84}, timestamp = {2024-04-08T18:49:28.000+0200}, title = {Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs485.html#BroersmaGP13}, volume = 485, year = 2013 }