On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.