{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:32Z","timestamp":1770921392870,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_22","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:00Z","timestamp":1770918780000},"page":"288-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Overlapping Biclustering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0705-972X","authenticated-orcid":false,"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7228-6640","authenticated-orcid":false,"given":"P\u00e5l Gr\u00f8n\u00e5s","family":"Drange","sequence":"additional","affiliation":[]},{"given":"Erlend","family":"Haugen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., et al.: Cluster editing with vertex splitting. Discrete Appl. Math. 371, 185\u2013195 (2025)","DOI":"10.1016\/j.dam.2025.04.013"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Davot, T., Isenmann, L., Thoumi, S.: On the complexity of 2-club cluster editing with vertex splitting. In: Proceedings of the 31st International Computing and Combinatorics Conference (COCOON), pp. 3\u201314. Springer Nature (2026)","DOI":"10.1007\/978-981-95-0218-9_1"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Isenmann, L., Merchad, Z.: Bicluster editing with overlaps: a vertex splitting approach. In: Proceedings of the 36th International Workshop on Combinatorial Algorithms (IWOCA), pp. 146\u2013159. Springer Nature (2025)","DOI":"10.1007\/978-3-031-98740-3_11"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Ahmed, A.R., et al.: Splitting vertices in 2-layer graph drawings. IEEE Comput. Graph. Appl. 43(3), 24\u201335 (2023)","DOI":"10.1109\/MCG.2023.3264244"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Kobourov, S., Kryven, M.: An FPT algorithm for bipartite vertex splitting. In: Proceeding of the 30th International Symposium on Graph Drawing and Network Visualization (GD), pp. 261\u2013268. Springer (2022)","DOI":"10.1007\/978-3-031-22203-0_19"},{"key":"22_CR6","unstructured":"Amit, N.: The bicluster graph editing problem. PhD Dissertation, Tel Aviv University (2004)"},{"issue":"1\u20133","key":"22_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"066102","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber, M.J.: Modularity and community detection in bipartite networks. Phys. Rev. E 76(6), 066102 (2007)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"e20284","DOI":"10.1371\/journal.pone.0020284","volume":"6","author":"A Bauer-Mehren","year":"2011","unstructured":"Bauer-Mehren, A., Bundschus, M., Rautschka, M., Mayer, M.A., Sanz, F., Furlong, L.I.: Gene-disease network analysis reveals functional modules in mendelian, complex and environmental diseases. PLoS ONE 6(6), e20284 (2011)","journal-title":"PLoS ONE"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"114928","DOI":"10.1016\/j.tcs.2024.114928","volume":"1021","author":"J Baumann","year":"2024","unstructured":"Baumann, J., Pfretzschner, M., Rutter, I.: Parameterized complexity of vertex splitting to pathwidth at most 1. Theoret. Comput. Sci. 1021, 114928 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR11","unstructured":"Bentert, M., Crane, A., Drange, P.G., Reidl, F., Sullivan, B.D.: Correlation clustering with vertex splitting. In: Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 8:1\u20138:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"22_CR12","unstructured":"Bentert, M., Drange, P.G., Haugen, E.: Overlapping biclustering (2025)"},{"key":"22_CR13","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 93\u2013103. AAAI Press (1999)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Craciun, G., Feinberg, M.: Multiple equilibria in complex chemical reaction networks: II. The species-reaction graph. SIAM J. Appl. Math. 66(4), 1321\u20131338 (2006)","DOI":"10.1137\/050634177"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.: A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48, 100556 (2023)","DOI":"10.1016\/j.cosrev.2023.100556"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Marcin Pilipczuk (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"22_CR18","unstructured":"Drange, P.G., Reidl, F., Villaamil, F.S., Sikdar, S.: Fast biclustering by dual parameterization. In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC), pp. 402\u2013413. Schloss Dagstuhl \u2014 Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Du, N., Wang, B., Wu, B., Wang, Y.: Overlapping community detection in bipartite networks. In: Proceedings of the 2008 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI), pp. 176\u2013179. IEEE Computer Society (2008)","DOI":"10.1109\/WIIAT.2008.98"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Eades, P., de\u00a0Mendon\u00e7a\u00a0Neto, C.F.X.: Vertex splitting and tension-free layout. In: Proceedings of the 3rd International Symposium on Graph Drawing (GD), pp. 202\u2013211. Springer (1995)","DOI":"10.1007\/BFb0021804"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Faria, L., de\u00a0Figueiredo, C.M.H., de\u00a0Mendon\u00e7a\u00a0Neto, C.F.X.: Splitting number is NP-complete. Discrete Appl. Math. 108(1-2), 65\u201383 (2001)","DOI":"10.1016\/S0166-218X(00)00220-1"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2025.01.012","volume":"365","author":"A Firbas","year":"2025","unstructured":"Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu, A., Wi\u00dfmann, M.: The complexity of cluster vertex splitting and company. Discret. Appl. Math. 365, 190\u2013207 (2025)","journal-title":"Discret. Appl. Math."},{"key":"22_CR23","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Proceedings of the 5th International Conference on Theory and Applications of Models of Computation (TAMC), pp. 445\u2013456. Springer (2008)","DOI":"10.1007\/978-3-540-79228-4_39"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Hsu, W.-L., Ma, T.-H.: Substitution decomposition on chordal graphs and applications. In: Proceedings of the 2nd International Symposium on Algorithms (ISA), pp. 52\u201360. Springer (1991)","DOI":"10.1007\/3-540-54945-5_49"},{"issue":"1","key":"22_CR26","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1140\/epjds\/s13688-017-0098-4","volume":"6","author":"Y Jiang","year":"2017","unstructured":"Jiang, Y., Skufca, J.D., Sun, J.: BiFold visualization of bipartite datasets. EPJ Data Sci. 6(1), 2 (2017)","journal-title":"EPJ Data Sci."},{"issue":"15","key":"22_CR27","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Lafond, M.: Even better fixed-parameter algorithms for bicluster editing. In: Computing and Combinatorics, pp. 578\u2013590. Springer International Publishing (2020)","DOI":"10.1007\/978-3-030-58150-3_47"},{"issue":"5","key":"22_CR29","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s10878-024-01186-y","volume":"47","author":"M Lafond","year":"2024","unstructured":"Lafond, M.: Improved kernelization and fixed-parameter algorithms for bicluster editing. J. Comb. Optim. 47(5), 90 (2024)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinf. 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jbi.2015.06.028","volume":"57","author":"B Pontes","year":"2015","unstructured":"Pontes, B., Gir\u00e1ldez, R., Aguilar-Ruiz, J.S.: Biclustering on expression data: a review. J. Biomed. Inform. 57, 163\u2013180 (2015)","journal-title":"J. Biomed. Inform."},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91\u2013104 (2009)","DOI":"10.1007\/s00224-007-9032-7"},{"key":"22_CR34","unstructured":"Sun, P., Guo, J., Baumbach, J.: Efficient large-scale bicluster editing. In: Proceedings of the German Conference on Bioinformatics 2014, pp. 54\u201360. GI (2014)"},{"issue":"1\u201320","key":"22_CR35","first-page":"122","volume":"9","author":"A Tanay","year":"2005","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. Handbook Comput. Mol. Biol. 9(1\u201320), 122\u2013124 (2005)","journal-title":"Handbook Comput. Mol. Biol."},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"113796","DOI":"10.1016\/j.tcs.2023.113796","volume":"953","author":"D Tsur","year":"2023","unstructured":"Tsur, D.: Faster parameterized algorithms for bicluster editing and flip consensus tree. Theoret. Comput. Sci. 953, 113796 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR37","doi-asserted-by":"publisher","first-page":"106193","DOI":"10.1016\/j.ipl.2021.106193","volume":"174","author":"M Xiao","year":"2022","unstructured":"Xiao, M., Kou, S.: A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett. 174, 106193 (2022)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:07Z","timestamp":1770918787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}