%0 Conference Paper %1 conf/tamc/Jelinkova11 %A Jelínková, Eva %B TAMC %D 2011 %E Ogihara, Mitsunori %E Tarui, Jun %I Springer %K dblp %P 463-470 %T Switching to Hedgehog-Free Graphs Is NP-Complete. %U http://dblp.uni-trier.de/db/conf/tamc/tamc2011.html#Jelinkova11 %V 6648 %@ 978-3-642-20876-8

@inproceedings{conf/tamc/Jelinkova11, added-at = {2021-10-14T00:00:00.000+0200}, author = {Jelínková, Eva}, biburl = {https://www.bibsonomy.org/bibtex/20a4d73ebbd3baeb3aa76bb73b79a3618/dblp}, booktitle = {TAMC}, crossref = {conf/tamc/2011}, editor = {Ogihara, Mitsunori and Tarui, Jun}, ee = {https://doi.org/10.1007/978-3-642-20877-5_45}, interhash = {22a5044a1074482bf8a6a8b0fec9ff6f}, intrahash = {0a4d73ebbd3baeb3aa76bb73b79a3618}, isbn = {978-3-642-20876-8}, keywords = {dblp}, pages = {463-470}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T13:39:59.000+0200}, title = {Switching to Hedgehog-Free Graphs Is NP-Complete.}, url = {http://dblp.uni-trier.de/db/conf/tamc/tamc2011.html#Jelinkova11}, volume = 6648, year = 2011 }