%0 Conference Paper %1 conf/wea/NakahataKK18 %A Nakahata, Yu %A Kawahara, Jun %A Kasahara, Shoji %B SEA %D 2018 %E D'Angelo, Gianlorenzo %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 21:1-21:13 %T Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. %U http://dblp.uni-trier.de/db/conf/wea/sea2018.html#NakahataKK18 %V 103 %@ 978-3-95977-070-5

@inproceedings{conf/wea/NakahataKK18, added-at = {2020-06-15T00:00:00.000+0200}, author = {Nakahata, Yu and Kawahara, Jun and Kasahara, Shoji}, biburl = {https://www.bibsonomy.org/bibtex/22c15165a54cac500ca328afb742d6a64/dblp}, booktitle = {SEA}, crossref = {conf/wea/2018}, editor = {D'Angelo, Gianlorenzo}, ee = {https://doi.org/10.4230/LIPIcs.SEA.2018.21}, interhash = {6955d14aaf4b9b1c4cb62ea8e0355f48}, intrahash = {2c15165a54cac500ca328afb742d6a64}, isbn = {978-3-95977-070-5}, keywords = {dblp}, pages = {21:1-21:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-06-16T12:40:57.000+0200}, title = {Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.}, url = {http://dblp.uni-trier.de/db/conf/wea/sea2018.html#NakahataKK18}, volume = 103, year = 2018 }