Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano. Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. In Leszek Gasieniec, Frank Wolter, editors, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings. Volume 8070 of Lecture Notes in Computer Science, pages 28-39, Springer, 2013. [doi]
@inproceedings{AsahiroEIM13, title = {Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree}, author = {Yuichi Asahiro and Hiroshi Eto and Takehiro Ito and Eiji Miyano}, year = {2013}, doi = {10.1007/978-3-642-40164-0_6}, url = {http://dx.doi.org/10.1007/978-3-642-40164-0_6}, researchr = {https://researchr.org/publication/AsahiroEIM13}, cites = {0}, citedby = {0}, pages = {28-39}, booktitle = {Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings}, editor = {Leszek Gasieniec and Frank Wolter}, volume = {8070}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-40163-3}, }