{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:49:34Z","timestamp":1743090574629,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_18","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"211-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8947-0994","authenticated-orcid":false,"given":"Yu","family":"Nakahata","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-044X","authenticated-orcid":false,"given":"Jun","family":"Kawahara","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1397-1020","authenticated-orcid":false,"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"8","key":"18_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"18_CR3","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"18_CR4","unstructured":"Horiyama, T., Kawahara, J., ichi Minato, S., Nakahata, Y.: Decomposing a graph into unigraphs (2019). \narXiv:1904.09438"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10009-014-0352-z","volume":"18","author":"T Inoue","year":"2016","unstructured":"Inoue, T., Iwashita, H., Kawahara, J., Minato, S.: Graphillion: software library for very large sets of labeled graphs. Int. J. Softw. Tools Technol. Transfer 18(1), 57\u201366 (2016)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"18_CR6","unstructured":"Iwashita, H., Minato, S.: Efficient top-down ZDD construction techniques using recursive specifications. TCS Technical Reports TCS-TR-A-13-69, pp. 1\u201328 (2013)"},{"issue":"9","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1587\/transfun.E100.A.1773","volume":"E100\u2013A","author":"J Kawahara","year":"2017","unstructured":"Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E100\u2013A(9), 1773\u20131784 (2017)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-34029-2_9","volume-title":"Analysis of Experimental Algorithms","author":"J Kawahara","year":"2019","unstructured":"Kawahara, J., Saitoh, T., Suzuki, H., Yoshinaka, R.: Colorful frontier-based search: implicit enumeration of chordal and interval subgraphs. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 125\u2013141. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-34029-2_9"},{"key":"18_CR9","series-title":"Combinatorial Algorithms, Part 1","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, Part 1, vol. 4A, 1st edn. Addison-Wesley Professional, Boston (2011)","edition":"1"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae 15(1), 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th ACM\/IEEE Design Automation Conference (DAC 1993), pp. 272\u2013277. ACM, New York (1993)","DOI":"10.1145\/157485.164890"},{"issue":"9","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1587\/transfun.E101.A.1363","volume":"E101\u2013A","author":"Y Nakahata","year":"2018","unstructured":"Nakahata, Y., Kawahara, J., Horiyama, T., Kasahara, S.: Enumerating all spanning shortest path forests with distance and capacity constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E101\u2013A(9), 1363\u20131374 (2018)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations","author":"K Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 224\u2013233. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/BFb0015427"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:56Z","timestamp":1582139156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}