%0 Conference Paper %1 conf/iwpec/BroersmaGP11 %A Broersma, Hajo %A Golovach, Petr A. %A Patel, Viresh %B IPEC %D 2011 %E Marx, Dániel %E Rossmanith, Peter %I Springer %K dblp %P 207-218 %T Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. %U http://dblp.uni-trier.de/db/conf/iwpec/ipec2011.html#BroersmaGP11 %V 7112 %@ 978-3-642-28049-8

@inproceedings{conf/iwpec/BroersmaGP11, added-at = {2020-09-05T00:00:00.000+0200}, author = {Broersma, Hajo and Golovach, Petr A. and Patel, Viresh}, biburl = {https://www.bibsonomy.org/bibtex/2732129e129aee65e7d9192f66a4633e7/dblp}, booktitle = {IPEC}, crossref = {conf/iwpec/2011}, editor = {Marx, Dániel and Rossmanith, Peter}, ee = {https://doi.org/10.1007/978-3-642-28050-4_17}, interhash = {b432d5f0cbc9803589257328ee9887c9}, intrahash = {732129e129aee65e7d9192f66a4633e7}, isbn = {978-3-642-28049-8}, keywords = {dblp}, pages = {207-218}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T02:32:30.000+0200}, title = {Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.}, url = {http://dblp.uni-trier.de/db/conf/iwpec/ipec2011.html#BroersmaGP11}, volume = 7112, year = 2011 }