%0 Conference Paper %1 conf/csr/Fox-EpsteinK12 %A Fox-Epstein, Eli %A Krizanc, Danny %B CSR %D 2012 %E Hirsch, Edward A. %E Karhumäki, Juhani %E Lepistö, Arto %E Prilutskii, Michail Kh. %I Springer %K dblp %P 138-147 %T The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs. %U http://dblp.uni-trier.de/db/conf/csr/csr2012.html#Fox-EpsteinK12 %V 7353 %@ 978-3-642-30641-9

@inproceedings{conf/csr/Fox-EpsteinK12, added-at = {2017-05-17T00:00:00.000+0200}, author = {Fox-Epstein, Eli and Krizanc, Danny}, biburl = {https://www.bibsonomy.org/bibtex/2867b511cde5733018bcb81467f4211cb/dblp}, booktitle = {CSR}, crossref = {conf/csr/2012}, editor = {Hirsch, Edward A. and Karhumäki, Juhani and Lepistö, Arto and Prilutskii, Michail Kh.}, ee = {https://doi.org/10.1007/978-3-642-30642-6_14}, interhash = {39a5c43b02e9e7fa68134c7c62bac32b}, intrahash = {867b511cde5733018bcb81467f4211cb}, isbn = {978-3-642-30641-9}, keywords = {dblp}, pages = {138-147}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:49:50.000+0200}, title = {The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs.}, url = {http://dblp.uni-trier.de/db/conf/csr/csr2012.html#Fox-EpsteinK12}, volume = 7353, year = 2012 }