{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:29Z","timestamp":1740123209803,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T00:00:00Z","timestamp":1634342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T00:00:00Z","timestamp":1634342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0297","J1-9109"],"award-info":[{"award-number":["P1-0297","J1-9109"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["J1-1693","J1-2452"],"award-info":[{"award-number":["J1-1693","J1-2452"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10479-021-04330-7","type":"journal-article","created":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T22:51:31Z","timestamp":1634424691000},"page":"25-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of mixed-connectivity"],"prefix":"10.1007","volume":"307","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-4126","authenticated-orcid":false,"given":"Sergio","family":"Cabello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,16]]},"reference":[{"issue":"6","key":"4330_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O Amini","year":"2011","unstructured":"Amini, O., Fomin, F. V., & Saurabh, S. (2011). Implicit branching and parameterized partial cover problems. Journal of Computer and System Sciences, 77(6), 1159\u20131171. https:\/\/doi.org\/10.1016\/j.jcss.2010.12.002.","journal-title":"Journal of Computer and System Sciences"},{"key":"4330_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.dam.2013.05.015","volume":"165","author":"N Apollonio","year":"2014","unstructured":"Apollonio, N., & Simeone, B. (2014). The maximum vertex coverage problem on bipartite graphs. Discrete Applied Mathematics, 165, 37\u201348. https:\/\/doi.org\/10.1016\/j.dam.2013.05.015.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"4330_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1112\/S0025579300003806","volume":"14","author":"LW Beineke","year":"1967","unstructured":"Beineke, L. W., & Harary, F. (1967). The connectivity function of a graph. Mathematika, 14(2), 197\u2013202. https:\/\/doi.org\/10.1112\/S0025579300003806.","journal-title":"Mathematika"},{"issue":"3","key":"4330_CR4","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1137\/15M1054328","volume":"31","author":"B Caskurlu","year":"2017","unstructured":"Caskurlu, B., Mkrtchyan, V., Parekh, O., & Subramani, K. (2017). Partial vertex cover and budgeted maximum coverage in bipartite graphs. SIAM Journal of Discrete Mathematics, 31(3), 2172\u20132184. https:\/\/doi.org\/10.1137\/15M1054328.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"4330_CR5","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Makarychev, Y., Vijayaraghavan, A., & Zhou, Y. (2016). Approximation algorithms and hardness of the $${k}$$-route cut problem. ACM Transactions on Algorithms,12(1), 2:1\u20132:40. https:\/\/doi.org\/10.1145\/2644814","DOI":"10.1145\/2644814"},{"key":"4330_CR6","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F. V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. Springer. https:\/\/doi.org\/10.1007\/978-3-319-21275-3.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"4330_CR7","doi-asserted-by":"publisher","unstructured":"Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Texts in Computer Science. Springer. https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"4330_CR8","first-page":"49","volume":"124","author":"R Erve\u0161","year":"2016","unstructured":"Erve\u0161, R., & \u017derovnik, J. (2016). Mixed connectivity of Cartesian graph products and bundles. ARS Combinatoria, 124, 49\u201364.","journal-title":"ARS Combinatoria"},{"key":"4330_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00415-z","author":"R Gu","year":"2019","unstructured":"Gu, R., Shi, Y., & Fan, N. (2019). Mixed connectivity properties of random graphs and some special graphs. Journal of Combinatorial Optimization. https:\/\/doi.org\/10.1007\/s10878-019-00415-z.","journal-title":"Journal of Combinatorial Optimization"},{"key":"4330_CR10","doi-asserted-by":"crossref","unstructured":"Joret, G., & Vetta, A. (2015). Reducing the rank of a matroid. Discrete Mathematics and Theoretical Computer Science, 17(2), 143\u2013156. http:\/\/dmtcs.episciences.org\/2135.","DOI":"10.46298\/dmtcs.2135"},{"key":"4330_CR11","doi-asserted-by":"publisher","unstructured":"Kawarabayashi, K., Kobayashi, Y., & Reed, B. A. (2012). The disjoint paths problem in quadratic time. Journal of Combinatorial Theory, Series B, 102(2), 424\u2013435. https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"4330_CR12","doi-asserted-by":"publisher","unstructured":"W. Mader (1979) Connectivity and edge-connectivity in finite graphs. Surveys in Combinatorics, pp.\u00a066\u201395. Cambridge University Press, London Mathematical Society Lecture Note Series. https:\/\/doi.org\/10.1017\/CBO9780511662133.005","DOI":"10.1017\/CBO9780511662133.005"},{"key":"4330_CR13","doi-asserted-by":"crossref","unstructured":"Rai, A., Ramanujan, M.\u00a0S. ,&\u00a0Saurabh, S. A parameterized algorithm for mixed-cut. In LATIN 2016: Theoretical Informatics\u201412th Latin American Symposium, Ensenada, Mexico, April 11\u201315, Proceedings (pp.\u00a0672\u2013685). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_50.","DOI":"10.1007\/978-3-662-49529-2_50"},{"key":"4330_CR14","doi-asserted-by":"publisher","unstructured":"Robertson, N., & Seymour, P. D. (1995). Graph Minors. XIII. The Disjoint Paths Problem. Journal of Combinatorial Theory, Series B,63(1), 65\u2013110. https:\/\/doi.org\/10.1006\/jctb.1995.1006","DOI":"10.1006\/jctb.1995.1006"},{"key":"4330_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03175-5","author":"E Sadeghi","year":"2019","unstructured":"Sadeghi, E., & Fan, N. (2019). On the survivable network design problem with mixed connectivity requirements. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-019-03175-5.","journal-title":"Annals of Operations Research"},{"key":"4330_CR16","unstructured":"Sebastian, M. S., Johann, S., & Krumke, S. O. (2019). On the mixed connectivity conjecture of Beineke and Harary. CoRR abs\/1908.11621https:\/\/arxiv.org\/abs\/1908.11621."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04330-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04330-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04330-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T16:34:08Z","timestamp":1636994048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04330-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,16]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4330"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04330-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,10,16]]},"assertion":[{"value":"30 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}