Go to the corresponding LIPIcs Volume Portal 
Ganian, Robert ; Narayanaswamy, N. S. ; Ordyniak, Sebastian ; Rahul, C. S. ; Ramanujan, M. S.
pdfformat: 

@InProceedings{ganian_et_al:LIPIcs:2016:6501, author = {Robert Ganian and N. S. Narayanaswamy and Sebastian Ordyniak and C. S. Rahul and M. S. Ramanujan}, title = {{On the Complexity Landscape of Connected fFactor Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {41:141:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6501}, URN = {urn:nbn:de:0030drops65013}, doi = {10.4230/LIPIcs.MFCS.2016.41}, annote = {Keywords: ffactors, connected ffactors, quasipolynomial time algorithms, randomized algorithms} }
Keywords:  ffactors, connected ffactors, quasipolynomial time algorithms, randomized algorithms  
Collection:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 