{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:42Z","timestamp":1725493482237},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664086"},{"type":"electronic","value":"9783540483403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_34","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:04:52Z","timestamp":1184591092000},"page":"376-386","source":"Crossref","is-referenced-by-count":1,"title":["Edge Coloring of Bipartite Graphs with Constraints"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"C. Berge. Graphs and Hypergraphs. North Holland, 1973."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"R. Cole and J. Hopcroft. On Edge Coloring Bipartite Graphs. SIAM Journal on Computing, 11 (1982), pp. 540\u2013546.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir. On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing, 5 (1976), pp. 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00998632","volume":"5","author":"H.N. Gabow","year":"1976","unstructured":"H.N. Gabow. Using Eulerian Partitions to Edge Color Bipartite Graphs. Internal. J. Comput. Inform. Sci., 5 (1976), pp. 345\u2013355.","journal-title":"Internal. J. Comput. Inform. Sci."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/0211009","volume":"11","author":"H.N. Gabow","year":"1982","unstructured":"H.N. Gabow and O. Kariv. Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM Journal on Computing, 11 (1982), pp. 117\u2013129.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. Karp. An n\n                  5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2 (1973), pp. 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/3-540-61680-2_75","volume-title":"Proc. of the 4th European Symposium on Algorithms (ESA\u2019 96)","author":"C. Kaklamanis","year":"1996","unstructured":"C. Kaklamanis, P. Persiano. Efficient Wavelength Routing on Directed Fiber Trees. In Proc. of the 4th European Symposium on Algorithms (ESA\u2019 96), LNCS 1136, Springer Verlag, 1996, pp. 460\u2013470."},{"key":"34_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-63165-8_205","volume-title":"Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP\u2019 97)","author":"C. Kaklamanis","year":"1997","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP\u2019 97), LNCS 1256, Springer Verlag, 1997, pp. 493\u2013504."},{"key":"34_CR9","first-page":"104","volume":"34","author":"D. K\u00f6nig","year":"1916","unstructured":"D. K\u00f6nig. Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1sok \u00e9s a halmazok elm\u00e9let\u00e9re. Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6, 34 (1916), pp. 104\u2013119 (in Hungarian).","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6"},{"key":"34_CR10","unstructured":"V. Kumar, E. Schwabe. Improved Access to Optical Bandwidth in Trees. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 97), 1997, pp. 437\u2013444."},{"key":"34_CR11","unstructured":"M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS\u2019 95), 1995, pp. 548\u2013557."},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A. Schrijver","year":"1998","unstructured":"A. Schrijver. Bipartite Edge Coloring in O(\u0394m) Time. SIAM Journal on Computing, 28(3) (1998), pp. 841\u2013846.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:08:39Z","timestamp":1550444919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}