{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:27Z","timestamp":1759638747559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_7","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"82-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hard and Easy Instances of L-Tromino Tilings"],"prefix":"10.1007","author":[{"given":"Javier T.","family":"Akagi","sequence":"first","affiliation":[]},{"given":"Carlos F.","family":"Gaona","sequence":"additional","affiliation":[]},{"given":"Fabricio","family":"Mendoza","sequence":"additional","affiliation":[]},{"given":"Manjil P.","family":"Saikia","sequence":"additional","affiliation":[]},{"given":"Marcos","family":"Villagra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"2","key":"7_CR1","first-page":"3","volume":"10","author":"P Chin","year":"2007","unstructured":"Chin, P., Grimaldi, R., Heubach, S.: Tiling with L\u2019s and squares. J. Integer Sequences 10(2), 3 (2007)","journal-title":"J. Integer Sequences"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(90)90057-4","volume":"53","author":"JH Conway","year":"1990","unstructured":"Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. J. Comb. Theor. Ser. A 53(2), 183\u2013208 (1990)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs and Combinatorics 23(1), 195\u2013208 (2007)","journal-title":"Graphs and Combinatorics"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1022420103267","volume":"1","author":"N Elkies","year":"1992","unstructured":"Elkies, N., Kuperberg, G., Larsen, M., Propp, J.: Alternating-sign matrices and domino tilings. I. J. Algebraic Comb. 1(2), 111\u2013132 (1992)","journal-title":"I. J. Algebraic Comb."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-017-9884-9","volume":"58","author":"T Horiyama","year":"2017","unstructured":"Horiyama, T., Ito, T., Nakatsuka, K., Suzuki, A., Uehara, R.: Complexity of tiling a polygon with trominoes or bars. Discrete Comput. Geom. 58(3), 686\u2013704 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/0097-3165(83)90068-7","volume":"34","author":"WH Mills","year":"1983","unstructured":"Mills, W.H., Robbins, D.P., Rumsey, H.: Alternating sign matrices and descending plane partitions. J. Comb. Theor. Ser. A 34(3), 340\u2013359 (1983)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theor. Ser. B 28(3), 284\u2013304 (1980)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"7_CR9","first-page":"194","volume":"44","author":"D Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. J. Oper. Res. Soc. Japan 44(2), 194\u2013204 (2001)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aam.2017.04.002","volume":"89","author":"MP Saikia","year":"2017","unstructured":"Saikia, M.P.: Enumeration of domino tilings of an aztec rectangle with boundary defects. Adv. Appl. Math. 89, 41\u201366 (2017)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math. 29(1), 53\u201376 (1980)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:38Z","timestamp":1709823038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","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":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}