{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:39:08Z","timestamp":1742927948534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_17","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Recognition of $$\\{a,b,c\\}$$-Modular Matrices"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Glanzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Stallknecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.orl.2016.07.004","volume":"44","author":"S Artmann","year":"2016","unstructured":"Artmann, S., Eisenbrand, F., Glanzer, C., Oertel, T., Vempala, S., Weismantel, R.: A note on non-degenerate integer programs with small subdeterminants. Oper. Res. Lett. 44(5), 635\u2013639 (2016)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM, New York (2017)","key":"17_CR2","DOI":"10.1145\/3055399.3055473"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00454-014-9601-x","volume":"52","author":"N Bonifas","year":"2014","unstructured":"Bonifas, N., Di Summa, M., Eisenbrand, F., H\u00e4hnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. Discrete Comput. Geometry 52(1), 102\u2013115 (2014)","journal-title":"Discrete Comput. Geometry"},{"doi-asserted-by":"crossref","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Joret, G., Weltge, S.: The stable set problem in graphs with bounded genus and bounded odd cycle packing number. In: SODA 2020: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2896\u20132915 (2020)","key":"17_CR4","DOI":"10.1137\/1.9781611975994.176"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-030-45771-6_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Conforti","year":"2020","unstructured":"Conforti, M., Fiorini, S., Huynh, T., Weltge, S.: Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 104\u2013116. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_9"},{"issue":"1\u20133","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582563","volume":"64","author":"M Dyer","year":"1994","unstructured":"Dyer, M., Frieze, A.: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64(1\u20133), 1\u201316 (1994)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Vempala, S.: Geometric random edge. Math. Programm. 164(1-2), 325\u2013339 (2017)","key":"17_CR7","DOI":"10.1007\/s10107-016-1089-0"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1137\/17M1125728","volume":"32","author":"C Glanzer","year":"2018","unstructured":"Glanzer, C., Weismantel, R., Zenklusen, R.: On the number of distinct rows of a matrix with bounded subdeterminants. SIAM J. Discret. Math. 32(3), 1706\u20131720 (2018)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"DV Gribanov","year":"2015","unstructured":"Gribanov, D.V., Veselov, S.I.: On integer programming with bounded determinants. Optim. Lett. 10(6), 1169\u20131177 (2015). https:\/\/doi.org\/10.1007\/s11590-015-0943-y","journal-title":"Optim. Lett."},{"unstructured":"Gribanov, D., Malyshev, D., Pardalos, P.: A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms. arXiv preprint arXiv:2002.01307 (2020)","key":"17_CR10"},{"doi-asserted-by":"crossref","unstructured":"N\u00e4gele, M., Sudakov, B., Zenklusen, R.: Submodular minimization under congruency constraints. In: Czumaj, A. (ed.) SODA pp. 849\u2013866. SIAM (2018)","key":"17_CR11","DOI":"10.1137\/1.9781611975031.55"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-45771-6_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Paat","year":"2020","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: The Integrality Number of an Integer Program. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 338\u2013350. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_26"},{"key":"17_CR13","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P Seymour","year":"1980","unstructured":"Seymour, P.: Decomposition of regular matroids. J. Comb. Theory, Series B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory, Series B"},{"doi-asserted-by":"crossref","unstructured":"Storjohann, A., Labahn, G.: Asymptotically fast computation of hermite normal forms of integer matrices. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, pp. 259\u2013266 (1996)","key":"17_CR15","DOI":"10.1145\/236869.237083"},{"doi-asserted-by":"crossref","unstructured":"Truemper, K.: A decomposition theory for matroids. v. testing of matrix total unimodularity. Journal of Combinatorial Theory, Series B 49(2), 241\u2013281 (1990)","key":"17_CR16","DOI":"10.1016\/0095-8956(90)90030-4"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"S Veselov","year":"2009","unstructured":"Veselov, S., Chirkov, A.: Integer program with bimodular matrix. Discret. Optim. 6(2), 220\u2013222 (2009)","journal-title":"Discret. Optim."},{"unstructured":"Veselov, S., Shevchenko, V.: Bounds for the maximal distance between the points of certain integer lattices (in Russian). Combinatorial-Algebraic Methods in Applied Mathematics, pp. 26\u201333 (1980)","key":"17_CR18"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s12532-012-0048-x","volume":"5","author":"M Walter","year":"2013","unstructured":"Walter, M., Truemper, K.: Implementation of a unimodularity test. Math. Program. Comput. 5(1), 57\u201373 (2013)","journal-title":"Math. Program. Comput."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:07:13Z","timestamp":1620169633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","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":"90","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":"33","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":"37% - 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":"15","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)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}