Go to the corresponding LIPIcs Volume Portal 
Golovach, Petr A. ; Heggernes, Pinar ; Lima, Paloma T. ; Montealegre, Pedro
pdfformat: 

@InProceedings{golovach_et_al:LIPIcs:2018:8562, author = {Petr A. Golovach and Pinar Heggernes and Paloma T. Lima and Pedro Montealegre}, title = {{Finding Connected Secluded Subgraphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {18:118:13}, 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/8562}, URN = {urn:nbn:de:0030drops85623}, doi = {10.4230/LIPIcs.IPEC.2017.18}, annote = {Keywords: Secluded subgraph, forbidden subgraphs, parameterized complexity} }
Keywords:  Secluded subgraph, forbidden subgraphs, parameterized complexity  
Seminar:  12th International Symposium on Parameterized and Exact Computation (IPEC 2017)  
Issue Date:  2018  
Date of publication:  23.02.2018 