The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica, 68(2):504-530, 2014. [doi]

Authors

Neeldhara Misra

This author has not been identified. Look up 'Neeldhara Misra' in Google

Geevarghese Philip

This author has not been identified. Look up 'Geevarghese Philip' in Google

Venkatesh Raman

This author has not been identified. Look up 'Venkatesh Raman' in Google

Saket Saurabh

This author has not been identified. Look up 'Saket Saurabh' in Google