%0 Conference Paper %1 conf/wads/BonamyD0P19 %A Bonamy, Marthe %A Dabrowski, Konrad K. %A Johnson, Matthew %A Paulusma, Daniël %B WADS %D 2019 %E Friggstad, Zachary %E Sack, Jörg-Rüdiger %E Salavatipour, Mohammad R. %I Springer %K dblp %P 181-195 %T Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. %U http://dblp.uni-trier.de/db/conf/wads/wads2019.html#BonamyD0P19 %V 11646 %@ 978-3-030-24766-9

@inproceedings{conf/wads/BonamyD0P19, added-at = {2019-08-08T00:00:00.000+0200}, author = {Bonamy, Marthe and Dabrowski, Konrad K. and Johnson, Matthew and Paulusma, Daniël}, biburl = {https://www.bibsonomy.org/bibtex/20d2f337bcb38db97fdae0aae645ad1aa/dblp}, booktitle = {WADS}, crossref = {conf/wads/2019}, editor = {Friggstad, Zachary and Sack, Jörg-Rüdiger and Salavatipour, Mohammad R.}, ee = {https://doi.org/10.1007/978-3-030-24766-9_14}, interhash = {3d84c4cc580d735672d643891ea8b85a}, intrahash = {0d2f337bcb38db97fdae0aae645ad1aa}, isbn = {978-3-030-24766-9}, keywords = {dblp}, pages = {181-195}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-08-09T11:49:02.000+0200}, title = {Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.}, url = {http://dblp.uni-trier.de/db/conf/wads/wads2019.html#BonamyD0P19}, volume = 11646, year = 2019 }