{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T01:26:37Z","timestamp":1673486797743},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(00)00400-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:05:14Z","timestamp":1027591514000},"page":"361-399","source":"Crossref","is-referenced-by-count":9,"title":["Edge coloring of bipartite graphs with constraints"],"prefix":"10.1016","volume":"270","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00400-X_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0304-3975(00)00400-X_BIB2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","article-title":"On edge coloring bipartite graphs","volume":"11","author":"Cole","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00998632","article-title":"Using Eulerian partitions to edge color bipartite graphs","volume":"5","author":"Gabow","year":"1976","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/0211009","article-title":"Algorithms for edge coloring bipartite graphs and multigraphs","volume":"11","author":"Gabow","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB7","first-page":"460","article-title":"Efficient wavelength routing on directed fiber trees","volume":"vol. 1136","author":"Kaklamanis","year":"1996"},{"key":"10.1016\/S0304-3975(00)00400-X_BIB8","article-title":"Constrained bipartite edge coloring with applications to wavelength routing","volume":"vol. 1256","author":"Kaklamanis","year":"1997493504"},{"key":"10.1016\/S0304-3975(00)00400-X_BIB9","first-page":"104","article-title":"Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1sok \u00e9s a halmazok elm\u00e9let\u00e9re","volume":"34","author":"K\u00f6nig","year":"1916","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6"},{"key":"10.1016\/S0304-3975(00)00400-X_BIB10","unstructured":"V. Kumar, E. Schwabe, Improved access to optical bandwidth in trees, Proc. 8th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA \u201997), 1997, pp. 437\u2013444."},{"key":"10.1016\/S0304-3975(00)00400-X_BIB11","doi-asserted-by":"crossref","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, Efficient access to optical bandwidth, Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science (FOCS \u201995), 1995, pp. 548\u2013557.","DOI":"10.1109\/SFCS.1995.492585"},{"issue":"3","key":"10.1016\/S0304-3975(00)00400-X_BIB12","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1137\/S0097539796299266","article-title":"Bipartite edge coloring in O(\u0394 m) time","volume":"28","author":"Schrijver","year":"1998","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000400X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000400X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:23:17Z","timestamp":1556878997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000400X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S030439750000400X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00400-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}