{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T12:13:37Z","timestamp":1769775217754,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819556397","type":"print"},{"value":"9789819556403","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-981-95-5640-3_43","type":"book-chapter","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:07:55Z","timestamp":1769720875000},"page":"684-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Query-Centered Fairness-Aware Maximum Clique Search in\u00a0Dynamic Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Jingwen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianuo","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinrui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,30]]},"reference":[{"key":"43_CR1","unstructured":"Technical report. https:\/\/github.com\/Quiet-chen\/MFCS"},{"issue":"11","key":"43_CR2","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3137628.3137640","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. Proc. VLDB Endow. 10(11), 1298\u20131309 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"43_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"issue":"11","key":"43_CR4","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006)","journal-title":"Comput. Oper. Res."},{"key":"43_CR5","unstructured":"Bose, A.J., Hamilton, W.L.: Compositional fairness constraints for graph embeddings. In: ICML, vol.\u00a097, pp. 715\u2013724. PMLR (2019)"},{"issue":"9","key":"43_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"key":"43_CR7","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. Nat. Secur. Agency Tech. Rep. 16(3.1), 1\u201329 (2008)"},{"issue":"3","key":"43_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00778-019-00540-5","volume":"28","author":"A Das","year":"2019","unstructured":"Das, A., Svendsen, M., Tirthapura, S.: Incremental maintenance of maximal cliques in a dynamic graph. VLDB J. 28(3), 351\u2013375 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00540-5","journal-title":"VLDB J."},{"key":"43_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-17517-6_36","volume-title":"Algorithms and Computation","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 403\u2013414. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_36"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithmics 18 (2013)","DOI":"10.1145\/2543629"},{"key":"43_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123915","volume":"250","author":"Y He","year":"2024","unstructured":"He, Y., Lin, L., Yuan, P., Li, R., Jia, T., Wang, Z.: CCSS: towards conductance-based community search with size constraints. Expert Syst. Appl. 250, 123915 (2024)","journal-title":"Expert Syst. Appl."},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322. ACM (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"14","key":"43_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.3991\/ijim.v16i14.30625","volume":"16","author":"F Hussein","year":"2022","unstructured":"Hussein, F., El-Salhi, S., Alazazma, R., Abu-Hantash, T., Abu-Hantash, H., Thaher, H.: An android application using machine learning algorithm for clique detection in issues related to transportation. Int. J. Interact. Mob. Technol. 16(14), 4\u201322 (2022)","journal-title":"Int. J. Interact. Mob. Technol."},{"key":"43_CR14","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley (2011)"},{"key":"43_CR15","unstructured":"Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: ICML, vol.\u00a097, pp. 3458\u20133467. PMLR (2019)"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Li, Y., et al.: Fairness in recommendation: foundations, methods, and applications. ACM Trans. Intell. Syst. Technol. 14(5), 95:1\u201395:48 (2023)","DOI":"10.1145\/3610302"},{"issue":"3","key":"43_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.hcc.2024.100200","volume":"4","author":"Y Liang","year":"2024","unstructured":"Liang, Y.: Outlier item detection in bundle recommendation via the attention mechanism. High-Confidence Comput. 4(3), 100200 (2024)","journal-title":"High-Confidence Comput."},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Pan, M., Li, R., Zhang, Q., Dai, Y., Tian, Q., Wang, G.: Fairness-aware maximal clique enumeration. In: ICDE, pp. 259\u2013271. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00024"},{"issue":"2","key":"43_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s41019-023-00213-y","volume":"8","author":"AE Rabaa","year":"2023","unstructured":"Rabaa, A.E., Elbassuoni, S., Hanna, J., Mouawad, A.E., Olleik, A., Amer-Yahia, S.: A framework to maximize group fairness for workers on online labor platforms. Data Sci. Eng. 8(2), 146\u2013176 (2023)","journal-title":"Data Sci. Eng."},{"issue":"4","key":"43_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.hcc.2024.100228","volume":"4","author":"SI Rahman","year":"2024","unstructured":"Rahman, S.I., et al.: Unsupervised machine learning approach for tailoring educational content to individual student weaknesses. High-Confidence Comput. 4(4), 100228 (2024)","journal-title":"High-Confidence Comput."},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Gleich, D.F., Gebremedhin, A.H.: Parallel maximum clique algorithms with applications to network analysis. SIAM J. Sci. Comput. 37(5) (2015)","DOI":"10.1137\/14100018X"},{"issue":"4","key":"43_CR22","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TKDE.2020.3003701","volume":"34","author":"S Sun","year":"2022","unstructured":"Sun, S., Li, W., Wang, Y., Liao, W., Yu, P.S.: Continuous monitoring of maximum clique over dynamic graphs. IEEE Trans. Knowl. Data Eng. 34(4), 1667\u20131683 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"43_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Tsioutsiouliklis, S., Pitoura, E., Tsaparas, P., Kleftakis, I., Mamoulis, N.: Fairness-aware PageRank. In: WWW, pp. 3815\u20133826. ACM\/IW3C2 (2021)","DOI":"10.1145\/3442381.3450065"},{"issue":"4","key":"43_CR25","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TKDE.2023.3311398","volume":"36","author":"T Yu","year":"2024","unstructured":"Yu, T., et al.: Incremental maximal clique enumeration for hybrid edge changes in large dynamic graphs. IEEE Trans. Knowl. Data Eng. 36(4), 1650\u20131666 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"43_CR26","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.jplph.2010.09.010","volume":"168","author":"X Zheng","year":"2011","unstructured":"Zheng, X., Liu, T., Yang, Z., Wang, J.: Large cliques in arabidopsis gene coexpression network and motif discovery. J. Plant Physiol. 168(6), 611\u2013618 (2011)","journal-title":"J. Plant Physiol."},{"issue":"8","key":"43_CR27","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.14778\/3594512.3594532","volume":"16","author":"Y Zhou","year":"2023","unstructured":"Zhou, Y., Fang, Y., Luo, W., Ye, Y.: Influential community search over large heterogeneous information networks. Proc. VLDB Endow. 16(8), 2047\u20132060 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"43_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/3654922","volume":"2","author":"Y Zhou","year":"2024","unstructured":"Zhou, Y., Guo, Q., Fang, Y., Ma, C.: A counting-based approach for efficient k-clique densest subgraph discovery. Proc. ACM Manag. Data 2(3), 119 (2024)","journal-title":"Proc. ACM Manag. Data"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5640-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:07:59Z","timestamp":1769720879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5640-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819556397","9789819556403"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5640-3_43","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":"30 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}