{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:46Z","timestamp":1757617426403,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_7","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:44Z","timestamp":1741105964000},"page":"78-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["k-Balanced Biclique Partition on\u00a0Signed Bipartite Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6912-0582","authenticated-orcid":false,"given":"Yifei","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-1804","authenticated-orcid":false,"given":"Donghua","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0571","authenticated-orcid":false,"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Adriaens, F., Apers, S.: Testing cluster properties of signed graphs. In: Proceedings of the ACM Web Conference 2023, pp. 49\u201359 (2023)","DOI":"10.1145\/3543507.3583213"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/S0895480199358655","volume":"15","author":"N Alon","year":"2002","unstructured":"Alon, N., Krivelevich, M.: Testing k-colorability. SIAM J. Discret. Math. 15(2), 211\u2013227 (2002)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"7_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of Heider\u2019s theory. Psychol. Rev. 63(5), 277 (1956)","journal-title":"Psychol. Rev."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-662-44777-2_20","volume-title":"Algorithms - ESA 2014","author":"P Chalermsook","year":"2014","unstructured":"Chalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A.: Nearly tight approximability results for minimum Diclique cover and partition. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 235\u2013246. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_20"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23(4) 493\u2013507 (1952)","DOI":"10.1214\/aoms\/1177729330"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.14778\/3632093.3632099","volume":"17","author":"KH Chung","year":"2023","unstructured":"Chung, K.H., Zhou, A., Wang, Y., Chen, L.: Maximum balanced (k,$$\\epsilon $$)-bitruss detection in signed bipartite graph. Proc. VLDB Endow. 17(3), 332\u2013344 (2023)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Derr, T., Johnson, C., Chang, Y., Tang, J.: Balance in signed bipartite networks. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 1221\u20131230 (2019)","DOI":"10.1145\/3357384.3358009"},{"issue":"21\u201323","key":"7_CR8","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1016\/j.tcs.2008.12.059","volume":"410","author":"H Fleischner","year":"2009","unstructured":"Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoret. Comput. Sci. 410(21\u201323), 2045\u20132053 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Huang, J., Shen, H., Cao, Q., Tao, S., Cheng, X.: Signed bipartite graph neural networks. In: Proceedings of the 30th ACM International Conference on Information and Knowledge Management, pp. 740\u2013749 (2021)","DOI":"10.1145\/3459637.3482392"},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ic.2011.03.008","volume":"213","author":"I Nor","year":"2012","unstructured":"Nor, I., et al.: Mod\/Resc parsimony inference: theory and application. Inf. Comput. 213, 23\u201332 (2012)","journal-title":"Inf. Comput."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. In: Indagationes Mathematicae (Proceedings), vol.\u00a080, pp. 406\u2013424. Elsevier (1977)","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"7_CR14","unstructured":"Shitov, Y.: A short proof that NMF is NP-hard. arXiv preprint 1605 (2016)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Sohler, C.: Almost optimal canonical property testers for satisfiability. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 541\u2013550. IEEE (2012)","DOI":"10.1109\/FOCS.2012.59"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Chen, C., Wang, X., Zhang, W., Lin, X.: Maximal balanced signed biclique enumeration in signed bipartite graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 1887\u20131899. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00187"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Efficient balanced signed biclique search in signed bipartite graphs. IEEE Trans. Knowl. Data Eng. 36(3), 1069\u20131083 (2023)","DOI":"10.1109\/TKDE.2023.3296721"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2010","unstructured":"Vavasis, S.A.: On the complexity of nonnegative matrix factorization. SIAM J. Optim. 20(3), 1364\u20131377 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:09:26Z","timestamp":1757142566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}