Go to the corresponding LIPIcs Volume Portal 
NovotnÃ¡, Jana ; Okrasa, Karolina ; Pilipczuk, Michal ; Rzazewski, Pawel ; van Leeuwen, Erik Jan ; Walczak, Bartosz
pdfformat: 

@InProceedings{novotn_et_al:LIPIcs:2019:11484, author = {Jana Novotn{\'a} and Karolina Okrasa and Michal Pilipczuk and Pawel Rzazewski and Erik Jan van Leeuwen and Bartosz Walczak}, title = {{SubexponentialTime Algorithms for Finding Large Induced Sparse Subgraphs}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {23:123:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771290}, ISSN = {18688969}, year = {2019}, volume = {148}, editor = {Bart M. P. Jansen and Jan Arne Telle}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11484}, URN = {urn:nbn:de:0030drops114845}, doi = {10.4230/LIPIcs.IPEC.2019.23}, annote = {Keywords: subexponential algorithm, feedback vertex set, P_tfree graphs, string graphs} }
Keywords:  subexponential algorithm, feedback vertex set, P_tfree graphs, string graphs  
Collection:  14th International Symposium on Parameterized and Exact Computation (IPEC 2019)  
Issue Date:  2019  
Date of publication:  04.12.2019 