| 2026 | COLT | Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs. | Nicol Cesa-Bianchi, Junya Honda, Yuko Kuroki, Atsushi Miyauchi, Lukas Zierahn |
| 2025 | ICML | An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale. | Fabian Christian Spaeh, Atsushi Miyauchi |
| 2025 | IJCAI | Minimizing Polarization and Disagreement in the Friedkin-Johnsen Model with Unknown Innate Opinions. | Federico Cinus, Atsushi Miyauchi, Yuko Kuroki, Francesco Bonchi |
| 2025 | WSDM | Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. | Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis |
| 2025 | WSDM | Untapping the Power of Indirect Relationships in Entity Summarization. | Atefeh Moradan, Mohammad Sorkhpar, Atsushi Miyauchi, Davide Mottin, Ira Assent |
| 2024 | WWW | Local Centrality Minimization with Quality Guarantees. | Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi |
| 2023 | KDD | Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. | Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis |
| 2023 | WSDM | Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. | Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita |
| 2022 | SDM | Dense and well-connected subgraph detection in dual networks. | Tianyi Chen, Francesco Bonchi, David Garca-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis |
| 2021 | CIKM | A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. | Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka |
| 2020 | ICML | Online Dense Subgraph Discovery via Blurred-Graph Feedback. | Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama |
| 2020 | KDD | Hypergraph Clustering Based on PageRank. | Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida |
| 2019 | IJCAI | Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. | Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi |
| 2018 | AAAI | Exact Clustering via Integer Programming and Maximum Satisfiability. | Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa |
| 2018 | CIKM | Finding a Dense Subgraph with Sparse Cut. | Atsushi Miyauchi, Naonori Kakimura |
| 2018 | ICDM | Robust Densest Subgraph Discovery. | Atsushi Miyauchi, Akiko Takeda |
| 2016 | ISAAC | The Densest Subgraph Problem with a Convex/Concave Size Function. | Yasushi Kawase, Atsushi Miyauchi |
| 2016 | ISAAC | Additive Approximation Algorithms for Modularity Maximization. | Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi |
| 2015 | CIKM | What Is a Network Community?: A Novel Quality Function and Detection Algorithms. | Atsushi Miyauchi, Yasushi Kawase |
| 2015 | ICML | Threshold Influence Model for Allocating Advertising Budgets. | Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura |