{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:03:45Z","timestamp":1725595425824},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_32","type":"book-chapter","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T03:58:48Z","timestamp":1310702328000},"page":"374-385","source":"Crossref","is-referenced-by-count":0,"title":["Never Minimal Automata and the Rainbow Bipartite Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Rodaro","sequence":"first","affiliation":[]},{"given":"Pedro V.","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(98)00034-6","volume":"204","author":"P. Goralcik","year":"1998","unstructured":"Goralcik, P., Koubek, V.: On the disjunctive set problem. Theoretical Computer Science\u00a0204, 99\u2013118 (1998)","journal-title":"Theoretical Computer Science"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","volume":"24","author":"M. Kano","year":"2008","unstructured":"Kano, M., Li, X.: Monochromatic and heterochromatic subgraphs in edge-colored graphs-a survey. Graphs and Combinatorics\u00a024, 237\u2013263 (2008)","journal-title":"Graphs and Combinatorics"},{"key":"32_CR3","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Longman, Amsterdam (1995)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-14455-4_36","volume-title":"Developments in Language Theory","author":"A. Restivo","year":"2010","unstructured":"Restivo, A., Vaglica, R.: Automata with extremal minimality conditions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 399\u2013410. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:09:41Z","timestamp":1553915381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}