{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:11:37Z","timestamp":1649189497559},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4276,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0166-218x(01)00214-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:49Z","timestamp":1027591909000},"page":"49-62","source":"Crossref","is-referenced-by-count":0,"title":["Bipartition constrained edge-splitting in directed graphs"],"prefix":"10.1016","volume":"115","author":[{"given":"Harold N.","family":"Gabow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00214-1_BIB1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","article-title":"Edge-connectivity augmentation with partition constraints","volume":"12","author":"Bang-Jensen","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00214-1_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","article-title":"Augmenting graphs to meet edge-connectivity requirements","volume":"Vol. 5","author":"Frank","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00214-1_BIB3","series-title":"Mathematical Programming: State of the Art 1994","first-page":"34","article-title":"Connectivity augmentation problems in network design","author":"Frank","year":"1994"},{"key":"10.1016\/S0166-218X(01)00214-1_BIB4","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Applications of a poset representation to edge-connectivity and graph rigidity, Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991, pp. 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"issue":"2","key":"10.1016\/S0166-218X(01)00214-1_BIB5","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1137\/S0097539798347189","article-title":"How to make a square grid framework with cables rigid","volume":"30","author":"Gabow","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0166-218X(01)00214-1_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1023\/A:1009885511650","article-title":"Incrementing bipartite digraph edge-connectivity","volume":"4","author":"Gabow","year":"2000","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0166-218X(01)00214-1_BIB7","series-title":"Handbook in Operations Research and Management Science, Vol. 7, Network Models","first-page":"617","article-title":"Design of survivable networks","author":"Gr\u00f6tschel","year":"1994"},{"key":"10.1016\/S0166-218X(01)00214-1_BIB8","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0166-218X(01)00214-1_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","article-title":"Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"3","author":"Mader","year":"1982","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(01)00214-1_BIB10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/s004539910004","article-title":"A simplified \u00d5(nm) time edge-splitting algorithm in undirected graphs","volume":"26","author":"Nagamochi","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(01)00214-1_BIB11","series-title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","author":"Recski","year":"1989"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:21:51Z","timestamp":1556868111000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0166218X01002141"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00214-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}