%0 Conference Paper %1 conf/esa/KobayashiY11 %A Kobayashi, Yusuke %A Yoshida, Yuichi %B ESA %D 2011 %E Demetrescu, Camil %E Halldórsson, Magnús M. %I Springer %K dblp %P 131-142 %T Algorithms for Finding a Maximum Non-k-linked Graph. %U http://dblp.uni-trier.de/db/conf/esa/esa2011.html#KobayashiY11 %V 6942 %@ 978-3-642-23718-8

@inproceedings{conf/esa/KobayashiY11, added-at = {2017-05-26T00:00:00.000+0200}, author = {Kobayashi, Yusuke and Yoshida, Yuichi}, biburl = {https://www.bibsonomy.org/bibtex/251b6e08268c67b54cc47577180bbd3f6/dblp}, booktitle = {ESA}, crossref = {conf/esa/2011}, editor = {Demetrescu, Camil and Halldórsson, Magnús M.}, ee = {https://doi.org/10.1007/978-3-642-23719-5_12}, interhash = {66ebd8097ba72ec13db17a6d28090dc0}, intrahash = {51b6e08268c67b54cc47577180bbd3f6}, isbn = {978-3-642-23718-8}, keywords = {dblp}, pages = {131-142}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:37:11.000+0200}, title = {Algorithms for Finding a Maximum Non-k-linked Graph.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa2011.html#KobayashiY11}, volume = 6942, year = 2011 }