%0 Conference Paper %1 conf/walcom/MiyanoSUYZ18 %A Miyano, Eiji %A Saitoh, Toshiki %A Uehara, Ryuhei %A Yagita, Tsuyoshi %A van der Zanden, Tom C. %B WALCOM %D 2018 %E Rahman, M. Sohel %E Sung, Wing-Kin %E Uehara, Ryuhei %I Springer %K dblp %P 240-251 %T Complexity of the Maximum k-Path Vertex Cover Problem. %U http://dblp.uni-trier.de/db/conf/walcom/walcom2018.html#MiyanoSUYZ18 %V 10755 %@ 978-3-319-75172-6

@inproceedings{conf/walcom/MiyanoSUYZ18, added-at = {2023-11-12T00:00:00.000+0100}, author = {Miyano, Eiji and Saitoh, Toshiki and Uehara, Ryuhei and Yagita, Tsuyoshi and van der Zanden, Tom C.}, biburl = {https://www.bibsonomy.org/bibtex/2338e2e6a5cdd49ec0d75f3f0ca7657ef/dblp}, booktitle = {WALCOM}, crossref = {conf/walcom/2018}, editor = {Rahman, M. Sohel and Sung, Wing-Kin and Uehara, Ryuhei}, ee = {https://doi.org/10.1007/978-3-319-75172-6_21}, interhash = {0657a543bf9c886d0bd42834017ddf2d}, intrahash = {338e2e6a5cdd49ec0d75f3f0ca7657ef}, isbn = {978-3-319-75172-6}, keywords = {dblp}, pages = {240-251}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T08:54:00.000+0200}, title = {Complexity of the Maximum k-Path Vertex Cover Problem.}, url = {http://dblp.uni-trier.de/db/conf/walcom/walcom2018.html#MiyanoSUYZ18}, volume = 10755, year = 2018 }