{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:21Z","timestamp":1759638201409,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_29","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"336-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trichotomy for the Reconfiguration Problem of Integer Linear Systems"],"prefix":"10.1007","author":[{"given":"Kei","family":"Kimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s004530010075","volume":"29","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29(4), 595\u2013609 (2001)","journal-title":"Algorithmica"},{"key":"29_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/S0097539792228629","volume":"23","author":"E Boros","year":"1994","unstructured":"Boros, E., Crama, Y., Hammer, P.L., Saks, M.: A complexity index for satisfiability problems. SIAM J. Comput. 23(1), 45\u201349 (1994)","journal-title":"SIAM J. Comput."},{"key":"29_CR4","first-page":"101","volume":"8","author":"R Chandrasekaran","year":"1984","unstructured":"Chandrasekaran, R.: Integer programming problems for which a simple rounding type algorithm works. Prog. Comb. Optim. 8, 101\u2013106 (1984)","journal-title":"Prog. Comb. Optim."},{"issue":"3","key":"29_CR5","first-page":"131","volume":"6","author":"F Glover","year":"1964","unstructured":"Glover, F.: A bound escalation method for the solution of integer linear programs. Cahiers du Centre d\u2019Etudes de Recherche Operationelle 6(3), 131\u2013168 (1964)","journal-title":"Cahiers du Centre d\u2019Etudes de Recherche Operationelle"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P Gopalan","year":"2009","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E., Papadimitriou, C.H.: The connectivity of Boolean satisfiability: computational and structural dichotomies. SIAM J. Comput. 38, 2330\u20132355 (2009)","journal-title":"SIAM J. Comput."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics 2013, London Mathematical Society Lecture Note Series, vol. 409, pp. 127\u2013160. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139506748.005"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01585160","volume":"62","author":"DS Hochbaum","year":"1993","unstructured":"Hochbaum, D.S., Megiddo, N., Naor, J.S., Tamir, A.: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62, 69\u201383 (1993)","journal-title":"Math. Program."},{"issue":"12\u201314","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D., Harvey, N.J., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-58601-6_92","volume-title":"Principles and Practice of Constraint Programming","author":"J Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond finite domains. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 86\u201394. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58601-6_92"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.dam.2015.07.004","volume":"200","author":"K Kimura","year":"2016","unstructured":"Kimura, K., Makino, K.: Trichotomy for integer linear systems based on their sign patterns. Disc. Appl. Math. 200, 67\u201378 (2016)","journal-title":"Disc. Appl. Math."},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput. 14(1), 196\u2013209 (1985)","journal-title":"SIAM J. Comput."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11559306_9","volume-title":"Frontiers of Combining Systems","author":"Shuvendu K. Lahiri","year":"2005","unstructured":"Lahiri, S.K., Musuvathi, M.: An efficient decision procedure for UTVPI constraints. In: Proceedings of the 5th International Workshop on Frontiers of Combining Systems, pp. 168\u2013183 (2005)"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1013847510365","volume":"6","author":"H Maaren van","year":"2002","unstructured":"van Maaren, H., Dang, C.: Simplicial pivoting algorithms for a tractable class of integer programs. J. Comb. Optim. 6(2), 133\u2013142 (2002)","journal-title":"J. Comb. Optim."},{"issue":"52","key":"29_CR15","first-page":"1","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(52), 1\u201325 (2018)","journal-title":"Algorithms"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.12.016","volume":"576","author":"K Subramani","year":"2015","unstructured":"Subramani, K., Worthington, J.: Feasibility checking in Horn constraint systems through a reduction based approach. Theor. Comput. Sci. 576, 1\u201317 (2015)","journal-title":"Theor. Comput. Sci."}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:06:41Z","timestamp":1582139201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_29","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"}}]}}