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

@InProceedings{agrawal_et_al:LIPIcs:2018:8544, author = {Akanksha Agrawal and Saket Saurabh and Prafullkumar Tale}, title = {{On the Parameterized Complexity of Contraction to Generalization of Trees}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {1:11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770514}, ISSN = {18688969}, year = {2018}, volume = {89}, editor = {Daniel Lokshtanov and Naomi Nishimura}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8544}, URN = {urn:nbn:de:0030drops85446}, doi = {10.4230/LIPIcs.IPEC.2017.1}, annote = {Keywords: Graph Contraction, Fixed Parameter Tractability, Graph Algorithms, Generalization of Trees} }
Keywords:  Graph Contraction, Fixed Parameter Tractability, Graph Algorithms, Generalization of Trees  
Seminar:  12th International Symposium on Parameterized and Exact Computation (IPEC 2017)  
Issue Date:  2018  
Date of publication:  23.02.2018 