Fahad Panolan, Ashutosh Rai. On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. In Joachim Gudmundsson, Julián Mestre, Taso Viglas, editors, Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Volume 7434 of Lecture Notes in Computer Science, pages 445-457, Springer, 2012. [doi]
@inproceedings{PanolanR12, title = {On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles}, author = {Fahad Panolan and Ashutosh Rai}, year = {2012}, doi = {10.1007/978-3-642-32241-9_38}, url = {http://dx.doi.org/10.1007/978-3-642-32241-9_38}, researchr = {https://researchr.org/publication/PanolanR12}, cites = {0}, citedby = {0}, pages = {445-457}, booktitle = {Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings}, editor = {Joachim Gudmundsson and Julián Mestre and Taso Viglas}, volume = {7434}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-32240-2}, }