{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:27:54Z","timestamp":1771126074507,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"MTA-ELTE Egerv\u00e1ry Research Group and the Hungarian National Research, Development and Innovation Office\u00a0\u2014\u00a0NKFIH","award":["K109240"],"award-info":[{"award-number":["K109240"]}]},{"name":"MTA-ELTE Egerv\u00e1ry Research Group and the Hungarian National Research, Development and Innovation Office\u00a0\u2014\u00a0NKFIH","award":["K120254"],"award-info":[{"award-number":["K120254"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.disc.2018.03.024","type":"journal-article","created":{"date-parts":[[2018,4,14]],"date-time":"2018-04-14T09:02:31Z","timestamp":1523696551000},"page":"1864-1872","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Blocking optimal structures"],"prefix":"10.1016","volume":"341","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0457-4573","authenticated-orcid":false,"given":"Krist\u00f3f","family":"B\u00e9rczi","sequence":"first","affiliation":[]},{"given":"Attila","family":"Bern\u00e1th","sequence":"additional","affiliation":[]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[]},{"given":"Gyula","family":"Pap","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2018.03.024_b1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s00453-006-0068-x","article-title":"Multicriteria global minimum cuts","volume":"46","author":"Armon","year":"2006","journal-title":"Algorithmica"},{"key":"10.1016\/j.disc.2018.03.024_b2","doi-asserted-by":"crossref","unstructured":"A. Bern\u00e1th, T. Kir\u00e1ly, Blocking optimal k-arborescences. Technical Report TR-2015-09, Egerv\u00e1ry Research Group, Budapest, 2015, www.cs.elte.hu\/egres.","DOI":"10.1137\/1.9781611974331.ch115"},{"key":"10.1016\/j.disc.2018.03.024_b3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.disopt.2016.08.003","article-title":"Blocking unions of arborescences","volume":"22, Part B","author":"Bern\u00e1th","year":"2016","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.disc.2018.03.024_b4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-016-1025-3","article-title":"Blocking optimal arborescences","volume":"161","author":"Bern\u00e1th","year":"2017","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.disc.2018.03.024_b5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/net.21739","article-title":"Hardness and approximation for network flow interdiction","volume":"69","author":"Chestnut","year":"2017","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.disc.2018.03.024_b6","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10878-010-9334-6","article-title":"Minimum d-blockers and d-transversals in graphs","volume":"22","author":"Costa","year":"2011","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.disc.2018.03.024_b7","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/j.disc.2018.03.024_b8","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/j.disc.2018.03.024_b9","series-title":"Algebraic Methods in Graph Theory, Colloquia Mathematica Soc. J. Bolyai, Vol. 25","first-page":"159","article-title":"On disjoint trees and arborescences","author":"Frank","year":"1978"},{"key":"10.1016\/j.disc.2018.03.024_b10","series-title":"Connections in Combinatorial Optimization","author":"Frank","year":"2011"},{"key":"10.1016\/j.disc.2018.03.024_b11","first-page":"1","article-title":"The highly connected matroids in minor-closed classes","author":"Geelen","year":"2013","journal-title":"Ann. Comb."},{"key":"10.1016\/j.disc.2018.03.024_b12","article-title":"Computing girth and cogirth in perturbed graphic matroids","author":"Geelen","year":"2017","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/j.disc.2018.03.024_b13","article-title":"Reducing the rank of a matroid","volume":"17","author":"Joret","year":"2015","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.disc.2018.03.024_b14","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","article-title":"On short paths interdiction problems: Total and node-wise limited interdiction","volume":"43","author":"Khachiyan","year":"2008","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.disc.2018.03.024_b15","unstructured":"T. Kir\u00e1ly, Computing the minimum cut in hypergraphic matroids. Technical Report QP-2009-05, Egerv\u00e1ry Research Group, Budapest, 2009, www.cs.elte.hu\/egres."},{"key":"10.1016\/j.disc.2018.03.024_b16","unstructured":"A. Linhares, C. Swamy, Improved Algorithms for MST and Metric-TSP Interdiction. ArXiv e-prints, May 2017."},{"key":"10.1016\/j.disc.2018.03.024_b17","doi-asserted-by":"crossref","unstructured":"S.T. McCormick, A combinatorial approach to some sparse matrix prob- lems. Technical report, DTIC Document, 1983.","DOI":"10.21236\/ADA131387"},{"issue":"1","key":"10.1016\/j.disc.2018.03.024_b18","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","article-title":"Computing edge-connectivity in multigraphs and capacitated graphs","volume":"5","author":"Nagamochi","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2018.03.024_b19","doi-asserted-by":"crossref","unstructured":"M. N\u00e4gele, B. Sudakov, R. Zenklusen, Submodular Minimization Unader Congruency Constraints. ArXiv e-prints, July 2017.","DOI":"10.1137\/1.9781611975031.55"},{"key":"10.1016\/j.disc.2018.03.024_b20","series-title":"Combinatorial optimization: polyhedra and efficiency, Vol. 24","author":"Schrijver","year":"2003"},{"issue":"1","key":"10.1016\/j.disc.2018.03.024_b21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"1","author":"Tutte","year":"1961","journal-title":"J. Lond. Math. Soc."},{"issue":"6","key":"10.1016\/j.disc.2018.03.024_b22","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","article-title":"The intractability of computing the minimum distance of a code","volume":"43","author":"Vardy","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/j.disc.2018.03.024_b23","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/net.3230200402","article-title":"Disjoint (s, t)-cuts in a network","volume":"20","author":"Wagner","year":"1990","journal-title":"Networks"},{"issue":"67","key":"10.1016\/j.disc.2018.03.024_b24","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.orl.2014.07.010","article-title":"Connectivity interdiction","volume":"42","author":"Zenklusen","year":"2014","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X18300955?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X18300955?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T09:21:22Z","timestamp":1656667282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X18300955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S0012365X18300955"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2018.03.024","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Blocking optimal structures","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2018.03.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}