Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. In Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk, editors, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Volume 8165 of Lecture Notes in Computer Science, pages 370-381, Springer, 2013. [doi]
@inproceedings{MisraPRRS13,
title = {Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs},
author = {Neeldhara Misra and Fahad Panolan and Ashutosh Rai and Venkatesh Raman and Saket Saurabh},
year = {2013},
doi = {10.1007/978-3-642-45043-3_32},
url = {http://dx.doi.org/10.1007/978-3-642-45043-3_32},
researchr = {https://researchr.org/publication/MisraPRRS13},
cites = {0},
citedby = {0},
pages = {370-381},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers},
editor = {Andreas Brandstädt and Klaus Jansen and Rüdiger Reischuk},
volume = {8165},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-45042-6},
}