Go to the corresponding LIPIcs Volume Portal 
Verbitsky, Oleg ; Zhukovskii, Maksim
pdfformat: 

@InProceedings{verbitsky_et_al:LIPIcs:2017:7684, author = {Oleg Verbitsky and Maksim Zhukovskii}, title = {{On the FirstOrder Complexity of Induced Subgraph Isomorphism}}, booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}, pages = {40:140:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770453}, ISSN = {18688969}, year = {2017}, volume = {82}, editor = {Valentin Goranko and Mads Dam}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7684}, URN = {urn:nbn:de:0030drops76841}, doi = {10.4230/LIPIcs.CSL.2017.40}, annote = {Keywords: the induced subgraph isomorphism problem, descriptive and computational complexity, finitevariable firstorder logic, quantifier depth and variable w} }
Keywords:  the induced subgraph isomorphism problem, descriptive and computational complexity, finitevariable firstorder logic, quantifier depth and variable w  
Seminar:  26th EACSL Annual Conference on Computer Science Logic (CSL 2017)  
Issue Date:  2017  
Date of publication:  14.08.2017 