{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:14:06Z","timestamp":1767212046130},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T00:00:00Z","timestamp":1190419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00453-007-9006-9","type":"journal-article","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T19:26:36Z","timestamp":1190402796000},"page":"35-49","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for Maximum Independent Set in Convex Bipartite Graphs"],"prefix":"10.1007","volume":"53","author":[{"given":"Jos\u00e9","family":"Soares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco A.","family":"Stefanes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,22]]},"reference":[{"key":"9006_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9006_CR2","doi-asserted-by":"crossref","unstructured":"Bose, P., Chan, A., Dehne, F., Latzel, M.: Coarse grained parallel maximum matching in convex bipartite graphs. In: 13th International Parallel Processing Symposium (IPPS\u201999), pp. 125\u2013129 (1999)","DOI":"10.1109\/IPPS.1999.760446"},{"key":"9006_CR3","doi-asserted-by":"crossref","unstructured":"Caceres, E., Chan, A., Dehne, F., Prencipe, G.: Coarse grained parallel algorithms for detecting convex bipartite graphs. In: Proc. 26th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Konstanz, Germany (2000)","DOI":"10.1007\/3-540-40064-8_9"},{"key":"9006_CR4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1142\/S0129626499000499","volume":"9","author":"A. Chan","year":"1999","unstructured":"Chan, A., Dehne, F.: A note on coarse grained parallel integer sorting. Parallel Process. Lett. 9, 533\u2013538 (1999)","journal-title":"Parallel Process. Lett."},{"key":"9006_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. McGraw\u2013Hill, New York (1990)"},{"key":"9006_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(96)00131-7","volume":"59","author":"A. Czumaj","year":"1996","unstructured":"Czumaj, A., Diks, K., Przytycka, T.: Parallel maximum independent set in convex bipartite graphs. Inf. Process. Lett. 59, 289\u2013294 (1996)","journal-title":"Inf. Process. Lett."},{"key":"9006_CR7","doi-asserted-by":"crossref","unstructured":"Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel geometric algorithms for coarse grained multicomputers. In: 9th Annual ACM Symposium on Computational Geometry, pp. 289\u2013307 (1993)","DOI":"10.1145\/160985.161154"},{"key":"9006_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","volume":"1","author":"E. Dekel","year":"1984","unstructured":"Dekel, E., Sahni, S.: A parallel matching for convex bipartite graphs and applications to scheduling. J. Parallel Distrib. Comput. 1, 185\u2013205 (1984)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9006_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in a convex bipartite graph. Nav. Res. Logist. Q. 14, 313\u2013316 (1967)","journal-title":"Nav. Res. Logist. Q."},{"key":"9006_CR10","doi-asserted-by":"crossref","unstructured":"Goodrich, M.: Communication efficient parallel sorting. In: 28th Annual ACM Symposium on Theory of Computing (STOC\u201996), pp. 247\u2013256 (1996)","DOI":"10.1145\/237814.237870"},{"key":"9006_CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H. Kuhn","year":"1955","unstructured":"Kuhn, H.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"9006_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski","year":"1981","unstructured":"Lipski, W., Preparata, F.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Inform. 15, 329\u2013346 (1981)","journal-title":"Acta Inform."},{"issue":"12","key":"9006_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner, G., Yeoman, J.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Comput. Math. Appl. 31(12), 91\u201396 (1996)","journal-title":"Comput. Math. Appl."},{"key":"9006_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant, L.: A bridging model for parallel computation. Commun. ACM 33, 103\u2013111 (1990)","journal-title":"Commun. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9006-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9006-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9006-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:59Z","timestamp":1559137499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9006-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,22]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9006"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9006-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,22]]}}}