On the Parameterized Complexity of Maximum Degree Contraction Problem

Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Complexity of Maximum Degree Contraction Problem. In Yixin Cao 0001, Marcin Pilipczuk, editors, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 180 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Saket Saurabh 0001

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

Prafullkumar Tale

This author has not been identified. Look up 'Prafullkumar Tale' in Google