pdfformat: 

@InProceedings{agrawal_et_al:LIPIcs:2019:10587, author = {Akanksha Agrawal and Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Prafullkumar Tale}, title = {{Path Contraction Faster Than 2^n}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {11:111:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771092}, ISSN = {18688969}, year = {2019}, volume = {132}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10587}, URN = {urn:nbn:de:0030drops105874}, doi = {10.4230/LIPIcs.ICALP.2019.11}, annote = {Keywords: path contraction, exact exponential time algorithms, graph algorithms, enumerating connected sets, 3disjoint connected subgraphs} }
Keywords:  path contraction, exact exponential time algorithms, graph algorithms, enumerating connected sets, 3disjoint connected subgraphs  
Seminar:  46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)  
Issue date:  2019  
Date of publication:  04.07.2019 