{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:50Z","timestamp":1781463290075,"version":"3.54.1"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.035","type":"journal-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:02:23Z","timestamp":1778108543000},"page":"45-56","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Directed hypergraph connectivity augmentation by hyperarc reorientations"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2729-127X","authenticated-orcid":false,"given":"Moritz","family":"M\u00fchlenthaler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Peyrille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.dam.2026.04.035_b1","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.disopt.2008.03.001","article-title":"Recent results on well-balanced orientations","volume":"5","author":"Bern\u00e1th","year":"2008","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.dam.2026.04.035_b2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.dam.2026.04.035_b3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","article-title":"On the orientation of graphs","volume":"28","author":"Frank","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.dam.2026.04.035_b4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(82)90044-9","article-title":"A note on k-strongly connected orientations of an undirected graph","volume":"39","author":"Frank","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.035_b5","volume":"vol. 38","author":"Frank","year":"2011"},{"issue":"2","key":"10.1016\/j.dam.2026.04.035_b6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","article-title":"On the orientation of graphs and hypergraphs","volume":"131","author":"Frank","year":"2003","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.04.035_b7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF01589418","article-title":"Generalized polymatroids and submodular flows","volume":"42","author":"Frank","year":"1988","journal-title":"Math. Program."},{"issue":"2\u20133","key":"10.1016\/j.dam.2026.04.035_b8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","article-title":"Directed hypergraphs and applications","volume":"42","author":"Gallo","year":"1993","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.04.035_b9","article-title":"Monotone edge flips to an orientation of maximum edge-connectivity \u00e0 la Nash-Williams","volume":"19","author":"Ito","year":"2023","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"2","key":"10.1016\/j.dam.2026.04.035_b10","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0095-8956(73)90018-X","article-title":"Connectivity in digraphs","volume":"15","author":"Lov\u00e1sz","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.04.035_b11","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/j.dam.2026.04.035_b12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd-vertex-pairings in finite graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.dam.2026.04.035_b13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.21711\/231766362010\/rmc3919","article-title":"Orientations of graphs","volume":"39","author":"Szigeti","year":"2010","journal-title":"Matem\u00e1tica Contempor\u00e2nea"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600257X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600257X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:34Z","timestamp":1781460394000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600257X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":13,"alternative-id":["S0166218X2600257X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.035","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Directed hypergraph connectivity augmentation by hyperarc reorientations","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.035","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}