{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:11:38Z","timestamp":1758636698320,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_25","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"294-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Integer Linear Programs for\u00a0Treewidth Based on\u00a0Perfect Elimination Orderings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5335-0678","authenticated-orcid":false,"given":"Sven","family":"Mallach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Meth. 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"25_CR2","unstructured":"Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: A modular library for computing tree decompositions. In: Iliopoulos, C.S., Pissis, S.P., Puglisi, S.J., Raman, R. (eds.) 16th International Symposium on Experimental Algorithms (SEA 2017), vol. 75 of Leibniz Intern. Proceedings in Informatics (LIPIcs), pp. 28:1\u201328:21, Dagstuhl, Germany (2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Berg, J., J\u00e4rvisalo, M.: SAT-based approaches to treewidth computation: an evaluation. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 328\u2013335. IEEE Computer Society (2014)","DOI":"10.1109\/ICTAI.2014.57"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105\u2013118. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19488-6_110"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/11841036_60","volume-title":"Algorithms \u2013 ESA 2006","author":"HL Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 672\u2013683. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_60"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"HL Bodlaender","year":"2012","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: A note on exact algorithms for vertex ordering problems on graphs. Theory Comput. Syst. 50(3), 420\u2013432 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1111\/j.1467-8640.2005.00274.x","volume":"21","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Koster, A.M., Eijkhof, F.V.D.: Pre-processing rules for triangulation of probabilistic networks. Comput. Intell. 21(3), 286\u2013305 (2005)","journal-title":"Comput. Intell."},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255 (2007)","journal-title":"Comput. J."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/3-540-45995-2_45","volume-title":"LATIN 2002: Theoretical Informatics","author":"CF Bornstein","year":"2002","unstructured":"Bornstein, C.F., Vempala, S.: Flow metrics. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 516\u2013527. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_45"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"25_CR12","unstructured":"Dell, H., Husfeldt, T., Jansen, B.M., Kaski, P., Komusiewicz, C., Rosamond, F.A.: The first parameterized algorithms and computational experiments challenge. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), vol. 63 of Leibniz Intern. Proceedings in Informatics (LIPIcs), pp. 30:1\u201330:9, Dagstuhl, Germany (2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"25_CR13","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Lokshtanov, D., Nishimura, N. (eds.) 12th international symposium on Parameterized and Exact Computation (IPEC 2017), vol. 89 of Leibniz Intern. Proceedings in Informatics (LIPIcs), pp. 30:1\u201330:12, Dagstuhl, Germany (2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 25(1), 71\u201376 (1961)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"12","key":"25_CR15","doi-asserted-by":"publisher","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L.F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J.J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"key":"25_CR16","unstructured":"Feremans, C., Oswald, M., Reinelt, G.: A Y-Formulation for the Treewidth. Heidelberg University, Germany, Preprint (2002)"},{"key":"25_CR17","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. Technical report, Berkeley, USA (1984)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-42071-0_7","volume-title":"Treewidth, Kernels, and Algorithms","author":"A Grigoriev","year":"2020","unstructured":"Grigoriev, A.: Possible and impossible attempts to\u00a0solve the treewidth problem via ILPs. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds.) Treewidth, Kernels, and Algorithms. LNCS, vol. 12160, pp. 78\u201388. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42071-0_7"},{"key":"25_CR20","unstructured":"Grigoriev, A., Ensinck, H., Usotskaya, N.: Integer linear programming formulations for treewidth. Research Memorandum 030, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR) (2011)"},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF00264496","volume":"16","author":"T Lengauer","year":"1981","unstructured":"Lengauer, T.: Black-white pebbles and graph separation. Acta Inform. 16(4), 465\u2013475 (1981)","journal-title":"Acta Inform."},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2007.02.004","volume":"186","author":"R Mart\u00ed","year":"2008","unstructured":"Mart\u00ed, R., Campos, V., Pi\u00f1ana, E.: A branch and bound algorithm for the matrix bandwidth minimization. Europ. J. Oper. Res. 186(2), 513\u2013528 (2008)","journal-title":"Europ. J. Oper. Res."},{"key":"25_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Linear Ordering Problem","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem. Springer, Boston (2011)"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"25_CR25","unstructured":"Tamaki, H.: Heuristic computation of exact treewidth. In: Schulz, C., U\u00e7ar, B., (eds.) 20th International Symposium on Experimental Algorithms (SEA 2022), vol. 233 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 17:1\u201317:16, Dagstuhl, Germany (2022). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"25_CR26","unstructured":"Usotskaya, N.: Exploiting geometric properties in combinatorial optimization = Benutten van geomwetrische eigenschappen in combinatiorische optimalisatie. PhD thesis, Maastricht University, Netherlands (2011)"},{"key":"25_CR27","unstructured":"Y\u00fcceoglu, B.: Branch-and-cut algorithms for graph problems. PhD thesis, Maastricht University (2015)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:08:41Z","timestamp":1712758121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"86","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":"38% - 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.04","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":"5.69","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)"}}]}}