{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:33:24Z","timestamp":1764783204843},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_17","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"140-149","source":"Crossref","is-referenced-by-count":6,"title":["Finding Maximum Edge Bicliques in Convex Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Doron","family":"Nussbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuye","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques\u00a0145(1), 11\u201321 (2004)","DOI":"10.1016\/j.dam.2003.09.004"},{"issue":"3-4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1089\/10665270360688075","volume":"10","author":"A. Ben-Dor","year":"2003","unstructured":"Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: the order-preserving submatrix problem. J. Comput. Biol.\u00a010(3-4), 373\u2013384 (2003)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"17_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J.\u00a0Comput. Syst. Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Brodal, G., Georgiadis, L., Hansen, K., Katriel, I.: Dynamic matchings in convex bipartite graphs, pp. 406\u2013417 (2007)","DOI":"10.1007\/978-3-540-74456-6_37"},{"key":"17_CR5","unstructured":"Chen, Y., Church, G.: Biclustering of expression data. In: Proc. 8th Internat. Conf. Intelligent Systems for Molecular Biology, pp. 93\u2013103 (2000)"},{"issue":"2","key":"17_CR6","first-page":"388","volume":"41","author":"M. Dawande","year":"2001","unstructured":"Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems \u00a041(2), 388\u2013403 (2001)","journal-title":"On bipartite and multipartite clique problems"},{"issue":"1-3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.tcs.2005.01.014","volume":"337","author":"V.M. Dias","year":"2005","unstructured":"Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theoretical Comput. Sci.\u00a0337(1-3), 240\u2013248 (2005)","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: On the generation of bicliques of a graph \u00a0155(14), 1826\u20131832 (2007)","DOI":"10.1016\/j.dam.2007.03.017"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity, pp. 534\u2013543 (2002)","DOI":"10.1145\/509984.509985"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(87)90174-8","volume":"25","author":"O. Fries","year":"1987","unstructured":"Fries, O., Mehlhorn, K., N\u00e4her, S., Tsakalidis, A.: A loglogn data structure for three-sided range queries. Inf. Process. Lett.\u00a025(4), 269\u2013273 (1987)","journal-title":"Inf. Process. Lett."},{"key":"17_CR11","volume-title":"Formal Concept Analysis, Mathematical Foundations","author":"B. Ganter","year":"1996","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Berlin (1996)"},{"issue":"7","key":"17_CR12","first-page":"1447","volume":"157","author":"A. G\u00e9ly","year":"2009","unstructured":"G\u00e9ly, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques \u00a0157(7), 1447\u20131459 (2009)","journal-title":"Enumeration aspects of maximal cliques and bicliques"},{"key":"17_CR13","unstructured":"Glover, F.: Maximum matching in a convex bipartite graph 14, 313\u2013316 (1967)"},{"key":"17_CR14","unstructured":"Goerdt, A., Lanka, A.: An approximation hardness result for bipartite clique. In: Technical Report 48, Electronic Colloquium on Computation Complexity (2004)"},{"issue":"1-2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Comput. Sci.\u00a0234(1-2), 59\u201384 (2000)","journal-title":"Theoretical Comput. Sci."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(95)00027-A","volume":"55","author":"T. Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D.: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph. Inf. Process. Lett.\u00a055(1), 11\u201316 (1995)","journal-title":"Inf. Process. Lett."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Liang, Y.D., Chang, M.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs 34(5), 337\u2013346 (1997)","DOI":"10.1007\/s002360050088"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Lipski, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems 15(4), 329\u2013346 (1981)","DOI":"10.1007\/BF00264533"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: A survey \u00a01(1), 24\u201345 (2004)","DOI":"10.1109\/TCBB.2004.2"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Meidanis, J., Porto, O., Telles, G.P.: On the consecutive ones property \u00a088(1-3), 325\u2013354 (1998)","DOI":"10.1016\/S0166-218X(98)00078-X"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: Proc. 16th Annu. Conf. Computational Learning Theory, pp. 448\u2013462 (2003)","DOI":"10.1007\/978-3-540-45167-9_33"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete \u00a0131(3), 651\u2013654 (2003)","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Soares, J., Stefanes, M.: Algorithms for maximum independent set in convex bipartite graphs 53(1), 35\u201349 (2009)","DOI":"10.1007\/s00453-007-9006-9"},{"issue":"12","key":"17_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner, G., Yeomans, J.S.: A linear time algorithm for maximum matchings in convex, bipartite graphs. Comput. Math. Appl.\u00a031(12), 91\u201396 (1996)","journal-title":"Comput. Math. Appl."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-79228-4_25","volume-title":"Theory and Applications of Models of Computation","author":"J. Tan","year":"2008","unstructured":"Tan, J.: Inapproximability of maximum weighted edge biclique and its applications. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 282\u2013293. Springer, Heidelberg (2008)"},{"issue":"Supplement 1","key":"17_CR26","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136","volume":"18","author":"A. Tanay","year":"2002","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. Bioinformatics\u00a018(Supplement 1), S136\u2013S144 (2002)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:22:09Z","timestamp":1558293729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}