A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. - Noriyoshi Sukegawa; Atsushi Miyauchi 001 (Discret. Optim., 2013)

Fractional programming formulation for the vertex coloring problem. - Tomomi Matsui; Noriyoshi Sukegawa; Atsushi Miyauchi 001 (Inf. Process. Lett., 2014)

What Is a Network Community?: A Novel Quality Function and Detection Algorithms. - Atsushi Miyauchi 001; Yasushi Kawase (CIKM, 2015)

Threshold Influence Model for Allocating Advertising Budgets. - Atsushi Miyauchi 001; Yuni Iwamasa; Takuro Fukunaga; Naonori Kakimura (ICML, 2015)

Z-score-based modularity for community detection in networks. - Atsushi Miyauchi 001; Yasushi Kawase (CoRR, 2015)

Redundant constraints in the standard formulation for the clique partitioning problem. - Atsushi Miyauchi 001; Noriyoshi Sukegawa (Optim. Lett., 2015)

Maximizing Barber's bipartite modularity is also hard. - Atsushi Miyauchi 001; Noriyoshi Sukegawa (Optim. Lett., 2015)

Exact Clustering via Integer Programming and Maximum Satisfiability. - Atsushi Miyauchi 001; Tomohiro Sonobe; Noriyoshi Sukegawa (AAAI, 2018)

Finding a Dense Subgraph with Sparse Cut. - Atsushi Miyauchi 001; Naonori Kakimura (CIKM, 2018)

Robust Densest Subgraph Discovery. - Atsushi Miyauchi 001; Akiko Takeda (ICDM, 2018)

The Densest Subgraph Problem with a Convex/Concave Size Function. - Yasushi Kawase; Atsushi Miyauchi 001 (Algorithmica, 2018)

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. - Yasushi Kawase; Yuko Kuroki; Atsushi Miyauchi 001 (IJCAI, 2019)

Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback. - Yuko Kuroki; Liyuan Xu; Atsushi Miyauchi 001; Junya Honda; Masashi Sugiyama (CoRR, 2019)

Online Dense Subgraph Discovery via Blurred-Graph Feedback. - Yuko Kuroki; Atsushi Miyauchi 001; Junya Honda; Masashi Sugiyama (ICML, 2020)

Hypergraph Clustering Based on PageRank. - Yuuki Takai; Atsushi Miyauchi 001; Masahiro Ikeda; Yuichi Yoshida (KDD, 2020)

Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback. - Yuko Kuroki; Liyuan Xu; Atsushi Miyauchi 001; Junya Honda; Masashi Sugiyama (Neural Comput., 2020)

A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. - Naoki Marumo; Atsushi Miyauchi 001; Akiko Takeda; Akira Tanaka (CIKM, 2021)

Finding densest k-connected subgraphs. - Francesco Bonchi; David García-Soriano; Atsushi Miyauchi 001; Charalampos E. Tsourakakis (Discret. Appl. Math., 2021)

Additive approximation algorithms for modularity maximization. - Yasushi Kawase; Tomomi Matsui; Atsushi Miyauchi 001 (J. Comput. Syst. Sci., 2021)

Dense and well-connected subgraph detection in dual networks. - Tianyi Chen; Francesco Bonchi; David García-Soriano; Atsushi Miyauchi 001; Charalampos E. Tsourakakis (SDM, 2022)

Finding Cheeger cuts in hypergraphs via heat equation. - Masahiro Ikeda; Atsushi Miyauchi 001; Yuuki Takai; Yuichi Yoshida (Theor. Comput. Sci., 2022)

Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. - Atsushi Miyauchi 001; Tianyi Chen; Konstantinos Sotiropoulos; Charalampos E. Tsourakakis (KDD, 2023)

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. - Yasushi Kawase; Atsushi Miyauchi 001; Hanna Sumita (WSDM, 2023)

A study on modularity density maximization: Column generation acceleration and computational complexity analysis. - Issey Sukeda; Atsushi Miyauchi 001; Akiko Takeda (Eur. J. Oper. Res., 2023)

Query-Efficient Correlation Clustering with Noisy Oracle. - Yuko Kuroki; Atsushi Miyauchi 001; Francesco Bonchi; Wei Chen 013 (NeurIPS, 2024)

Bandits with Abstention under Expert Advice. - Stephen Pasteris; Alberto Rumi; Maximilian Thiessen; Shota Saito; Atsushi Miyauchi 001; Fabio Vitale; Mark Herbster (NeurIPS, 2024)

Local Centrality Minimization with Quality Guarantees. - Atsushi Miyauchi 001; Lorenzo Severini; Francesco Bonchi (WWW, 2024)

Multilayer Correlation Clustering. - Atsushi Miyauchi 001; Florian Adriaens; Francesco Bonchi; Nikolaj Tatti (CoRR, 2024)

A Survey on the Densest Subgraph Problem and its Variants. - Tommaso Lanciano; Atsushi Miyauchi 001; Adriano Fazzone; Francesco Bonchi (ACM Comput. Surv., 2024)

Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. - Tianyi Chen; Atsushi Miyauchi 001; Charalampos E. Tsourakakis (WSDM, 2025)

Untapping the Power of Indirect Relationships in Entity Summarization. - Atefeh Moradan; Mohammad Sorkhpar; Atsushi Miyauchi 001; Davide Mottin; Ira Assent (WSDM, 2025)

Minimizing Polarization and Disagreement in the Friedkin-Johnsen Model with Unknown Innate Opinions. - Federico Cinus; Atsushi Miyauchi 001; Yuko Kuroki; Francesco Bonchi (CoRR, 2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale. - Fabian Spaeh; Atsushi Miyauchi 001 (CoRR, 2025)