Go to the corresponding LIPIcs Volume Portal 
Saurabh, Saket ; Tale, Prafullkumar
pdfformat: 

@InProceedings{saurabh_et_al:LIPIcs:2020:13329, author = {Saket Saurabh and Prafullkumar Tale}, title = {{On the Parameterized Complexity of Maximum Degree Contraction Problem}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {26:126:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771726}, ISSN = {18688969}, year = {2020}, volume = {180}, editor = {Yixin Cao and Marcin Pilipczuk}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13329}, URN = {urn:nbn:de:0030drops133297}, doi = {10.4230/LIPIcs.IPEC.2020.26}, annote = {Keywords: Graph Contraction Problems, FPT Algorithm, Lower Bound, ETH, No Polynomial Kernel} }
Keywords:  Graph Contraction Problems, FPT Algorithm, Lower Bound, ETH, No Polynomial Kernel  
Collection:  15th International Symposium on Parameterized and Exact Computation (IPEC 2020)  
Issue Date:  2020  
Date of publication:  04.12.2020 