{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:03Z","timestamp":1779174843087,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200103700, DP170104747, LP180100750"],"award-info":[{"award-number":["DP200103700, DP170104747, LP180100750"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872258"],"award-info":[{"award-number":["61872258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3459241","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"248-260","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs"],"prefix":"10.1145","author":[{"given":"Lu","family":"Chen","sequence":"first","affiliation":[{"name":"Swinburne University of Technology, , Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, , Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhou","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, , Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajie","family":"Xu","sequence":"additional","affiliation":[{"name":"Soochow University, , CN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[{"name":"Deakin University, , Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/492"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.907875"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.17713\/ajs.v49i3.1011"},{"key":"e_1_3_2_2_6_1","volume-title":"SIGKDD (Anchorage, AK, USA)","author":"Chang Lijun","unstructured":"Lijun Chang . 2019. Efficient Maximum Clique Computation over Large Sparse Graphs . In SIGKDD (Anchorage, AK, USA) . Association for Computing Machinery , New York, NY, USA , 529--538. https:\/\/doi.org\/10.1145\/3292500.3330986 10.1145\/3292500.3330986 Lijun Chang. 2019. Efficient Maximum Clique Computation over Large Sparse Graphs. In SIGKDD (Anchorage, AK, USA). Association for Computing Machinery, New York, NY, USA, 529--538. https:\/\/doi.org\/10.1145\/3292500.3330986"},{"key":"e_1_3_2_2_7_1","volume-title":"Frontiers in Algorithmics","author":"Chen Hao","unstructured":"Hao Chen and Tian Liu . 2017. Maximum Edge Bicliques in Tree Convex Bipartite Graphs . In Frontiers in Algorithmics , Mingyu Xiao and Frances Rosamond (Eds.). Springer International Publishing , Cham , 47--55. Hao Chen and Tian Liu. 2017. Maximum Edge Bicliques in Tree Convex Bipartite Graphs. In Frontiers in Algorithmics, Mingyu Xiao and Frances Rosamond (Eds.). Springer International Publishing, Cham, 47--55."},{"key":"e_1_3_2_2_8_1","first-page":"93","article-title":"Biclustering of expression data","volume":"8","author":"Cheng Yizong","year":"2000","unstructured":"Yizong Cheng and George M Church . 2000 . Biclustering of expression data . In Ismb , Vol. 8. 93 -- 103 . Yizong Cheng and George M Church. 2000. Biclustering of expression data. In Ismb, Vol. 8. 93--103.","journal-title":"Ismb"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"A. Das and S. Tirthapura. 2019. Shared-Memory Parallel Maximal Biclique Enumeration. In HiPC. 34--43.  A. Das and S. Tirthapura. 2019. Shared-Memory Parallel Maximal Biclique Enumeration. In HiPC. 34--43.","DOI":"10.1109\/HiPC.2019.00016"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1199"},{"key":"e_1_3_2_2_11_1","volume-title":"Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok","author":"D\u00e9nes K\u00f6nig","year":"1931","unstructured":"K\u00f6nig D\u00e9nes . 1931. Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok , Vol. 38 ( 1931 ), 116--119. K\u00f6nig D\u00e9nes. 1931. Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok, Vol. 38 (1931), 116--119."},{"key":"e_1_3_2_2_12_1","volume-title":"A Graph-Based Approach for Finding the Dengue Infection Pathways in Humans Using Protein--Protein Interactions. Journal of Computational Biology","author":"Dey Lopamudra","year":"2019","unstructured":"Lopamudra Dey and Anirban Mukhopadhyay . 2019. A Graph-Based Approach for Finding the Dengue Infection Pathways in Humans Using Protein--Protein Interactions. Journal of Computational Biology ( 2019 ). Lopamudra Dey and Anirban Mukhopadhyay. 2019. A Graph-Based Approach for Finding the Dengue Infection Pathways in Humans Using Protein--Protein Interactions. Journal of Computational Biology (2019)."},{"key":"e_1_3_2_2_13_1","volume-title":"Computers and intractability","author":"Garey Michael R","unstructured":"Michael R Garey and David S Johnson . 1979. Computers and intractability . Vol. 174 . freeman San Francisco . Michael R Garey and David S Johnson. 1979. Computers and intractability. Vol. 174. freeman San Francisco."},{"key":"e_1_3_2_2_14_1","volume-title":"Computational genetic neuroanatomy of the developing mouse brain: dimensionality reduction, visualization, and clustering. BMC bioinformatics","author":"Shuiwang Ji.","year":"2013","unstructured":"Shuiwang Ji. 2013. Computational genetic neuroanatomy of the developing mouse brain: dimensionality reduction, visualization, and clustering. BMC bioinformatics , Vol. 14 , 1 ( 2013 ), 222. Shuiwang Ji. 2013. Computational genetic neuroanatomy of the developing mouse brain: dimensionality reduction, visualization, and clustering. BMC bioinformatics, Vol. 14, 1 (2013), 222."},{"key":"e_1_3_2_2_15_1","volume-title":"AIP Conference Proceedings","volume":"2084","author":"Kaloka Tesdiq Prigel","year":"2019","unstructured":"Tesdiq Prigel Kaloka , Alhadi Bustamam , Dian Lestari , and Wibowo Mangunwardoyo . 2019 . POLS algorithm to find a local bicluster on interactions between HIV-1 proteins and human proteins . In AIP Conference Proceedings , Vol. 2084 . AIP Publishing LLC, 0 20016. Tesdiq Prigel Kaloka, Alhadi Bustamam, Dian Lestari, and Wibowo Mangunwardoyo. 2019. POLS algorithm to find a local bicluster on interactions between HIV-1 proteins and human proteins. In AIP Conference Proceedings, Vol. 2084. AIP Publishing LLC, 020016."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104922"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.3390\/a11010010"},{"key":"e_1_3_2_2_20_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"McCreesh Ciaran","unstructured":"Ciaran McCreesh and Patrick Prosser . 2014. An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem . In Integration of AI and OR Techniques in Constraint Programming . Springer International Publishing , Cham , 226--234. Ciaran McCreesh and Patrick Prosser. 2014. An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. In Integration of AI and OR Techniques in Constraint Programming. Springer International Publishing, Cham, 226--234."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-26"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118237.3118545"},{"key":"e_1_3_2_2_23_1","volume-title":"Maximum Weighted Edge Biclique Problem on Bipartite Graphs","author":"Pandey Arti","unstructured":"Arti Pandey , Gopika Sharma , and Nivedit Jain . 2020. Maximum Weighted Edge Biclique Problem on Bipartite Graphs . In Algorithms and Discrete Applied Mathematics, Manoj Changat and Sandip Das (Eds.). Springer International Publishing , Cham , 116--128. Arti Pandey, Gopika Sharma, and Nivedit Jain. 2020. Maximum Weighted Edge Biclique Problem on Bipartite Graphs. In Algorithms and Discrete Applied Mathematics, Manoj Changat and Sandip Das (Eds.). Springer International Publishing, Cham, 116--128."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217045"},{"key":"#cr-split#-e_1_3_2_2_25_1.1","doi-asserted-by":"crossref","unstructured":"Eran Shaham Honghai Yu and Xiaoli li. 2016. On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach. 315--323. https:\/\/doi.org\/10.1137\/1.9781611974348.36 10.1137\/1.9781611974348.36","DOI":"10.1137\/1.9781611974348.36"},{"key":"#cr-split#-e_1_3_2_2_25_1.2","doi-asserted-by":"crossref","unstructured":"Eran Shaham Honghai Yu and Xiaoli li. 2016. On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach. 315--323. https:\/\/doi.org\/10.1137\/1.9781611974348.36","DOI":"10.1137\/1.9781611974348.36"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"M. S\u00f6zdinler and C. \u00d6zturan. 2018. Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming. In CSE. 132--137.  M. S\u00f6zdinler and C. \u00d6zturan. 2018. Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming. In CSE. 132--137.","DOI":"10.1109\/CSE.2018.00025"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167943.1167945"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.012"},{"key":"e_1_3_2_2_29_1","volume-title":"Christian Setzkorn, and Matthew Baylis.","author":"Wardeh Maya","year":"2015","unstructured":"Maya Wardeh , Claire Risley , Marie Kirsty McIntyre , Christian Setzkorn, and Matthew Baylis. 2015 . Database of host-pathogen and related species interactions, and their global distribution. Scientific data, Vol. 2 , 1 (2015), 1--11. Maya Wardeh, Claire Risley, Marie Kirsty McIntyre, Christian Setzkorn, and Matthew Baylis. 2015. Database of host-pathogen and related species interactions, and their global distribution. Scientific data, Vol. 2, 1 (2015), 1--11."},{"key":"e_1_3_2_2_30_1","unstructured":"E.A.B.S.G. Williamson. [n.d.]. Lists Decisions and Graphs .S. Gill Williamson. https:\/\/books.google.com.au\/books?id=vaXv_yhefG8C  E.A.B.S.G. Williamson. [n.d.]. Lists Decisions and Graphs .S. Gill Williamson. https:\/\/books.google.com.au\/books?id=vaXv_yhefG8C"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213005002387"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"G. Yeap S. S. Lin Y. M. Chen H. L. Shang P. W. Wang H. C. Lin Y. C. Peng J. Y. Sheu M. Wang X. Chen B. R. Yang C. P. Lin F. C. Yang Y. K. Leung D. W. Lin C. P. Chen K. F. Yu D. H. Chen C. Y. Chang H. K. Chen P. Hung C. S. Hou Y. K. Cheng J. Chang L. Yuan C. K. Lin C. C. Chen Y. C. Yeo M. H. Tsai H. T. Lin C. O. Chui K. B. Huang W. Chang H. J. Lin K. W. Chen R. Chen S. H. Sun Q. Fu H. T. Yang H. T. Chiang C. C. Yeh T. L. Lee C. H. Wang S. L. Shue C. W. Wu R. Lu W. R. Lin J. Wu F. Lai Y. H. Wu B. Z. Tien Y. C. Huang L. C. Lu J. He Y. Ku J. Lin M. Cao T. S. Chang and S. M. Jang. 2019. 5nm CMOS Production Technology Platform featuring full-fledged EUV and High Mobility Channel FinFETs with densest 0.021\u00b5m2 SRAM cells for Mobile SoC and High Performance Computing Applications. In IEDM. 36.7.1--36.7.4.  G. Yeap S. S. Lin Y. M. Chen H. L. Shang P. W. Wang H. C. Lin Y. C. Peng J. Y. Sheu M. Wang X. Chen B. R. Yang C. P. Lin F. C. Yang Y. K. Leung D. W. Lin C. P. Chen K. F. Yu D. H. Chen C. Y. Chang H. K. Chen P. Hung C. S. Hou Y. K. Cheng J. Chang L. Yuan C. K. Lin C. C. Chen Y. C. Yeo M. H. Tsai H. T. Lin C. O. Chui K. B. Huang W. Chang H. J. Lin K. W. Chen R. Chen S. H. Sun Q. Fu H. T. Yang H. T. Chiang C. C. Yeh T. L. Lee C. H. Wang S. L. Shue C. W. Wu R. Lu W. R. Lin J. Wu F. Lai Y. H. Wu B. Z. Tien Y. C. Huang L. C. Lu J. He Y. Ku J. Lin M. Cao T. S. Chang and S. M. Jang. 2019. 5nm CMOS Production Technology Platform featuring full-fledged EUV and High Mobility Channel FinFETs with densest 0.021\u00b5m2 SRAM cells for Mobile SoC and High Performance Computing Applications. In IEDM. 36.7.1--36.7.4.","DOI":"10.1109\/IEDM19573.2019.8993577"},{"key":"e_1_3_2_2_34_1","volume-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang , Charles A Phillips , Gary L Rogers , Erich J Baker , Elissa J Chesler , and Michael A Langston . 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics , Vol. 15 , 1 ( 2014 ), 110. Yun Zhang, Charles A Phillips, Gary L Rogers, Erich J Baker, Elissa J Chesler, and Michael A Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics, Vol. 15, 1 (2014), 110."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.09.017"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.03.010"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459241","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3459241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3459241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":37,"alternative-id":["10.1145\/3448016.3459241","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3459241","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}