( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dense and well-connected subgraph detection in dual networks.

, , , , и . SDM, стр. 361-369. SIAM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Atsushi Imai

Atsushi Imai

Atsushi Yagi

Atsushi Fukui

Atsushi Kambayashi

 

Другие публикации лиц с тем же именем

Local Centrality Minimization with Quality Guarantees., , и . WWW, стр. 410-421. ACM, (2024)A Survey on the Densest Subgraph Problem and its Variants., , , и . ACM Comput. Surv., 56 (8): 208:1-208:40 (августа 2024)Online Dense Subgraph Discovery via Blurred-Graph Feedback., , , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 5522-5532. PMLR, (2020)Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks., , и . WSDM, стр. 886-894. ACM, (2023)Robust Densest Subgraph Discovery., и . ICDM, стр. 1188-1193. IEEE Computer Society, (2018)Fractional programming formulation for the vertex coloring problem., , и . Inf. Process. Lett., 114 (12): 706-709 (2014)What Is a Network Community?: A Novel Quality Function and Detection Algorithms., и . CIKM, стр. 1471-1480. ACM, (2015)The Densest Subgraph Problem with a Convex/Concave Size Function., и . ISAAC, том 64 из LIPIcs, стр. 44:1-44:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Threshold Influence Model for Allocating Advertising Budgets., , , и . ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 1395-1404. JMLR.org, (2015)Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation., , и . IJCAI, стр. 1272-1279. ijcai.org, (2019)