Atsushi Miyauchi

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 39

Top Topics

Integer Program

Connected Subgraphs

Correlation Clustering

Quality Guarantees

Top Venues

Publications

Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi
A Survey on the Densest Subgraph Problem and its Variants. ACM Comput. Surv. 56 (8) (2024)
Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi
Local Centrality Minimization with Quality Guarantees. WWW (2024)
Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster
Bandits with Abstention under Expert Advice. CoRR (2024)
Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
Multilayer Correlation Clustering. CoRR (2024)
Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen
Query-Efficient Correlation Clustering with Noisy Oracle. CoRR (2024)
Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi
Local Centrality Minimization with Quality Guarantees. CoRR (2024)
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi
A Survey on the Densest Subgraph Problem and its Variants. CoRR (2023)
Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR (2023)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM (2023)
Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD (2023)
Issey Sukeda, Atsushi Miyauchi, Akiko Takeda
A study on modularity density maximization: Column generation acceleration and computational complexity analysis. Eur. J. Oper. Res. 309 (2) (2023)
Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida
Finding Cheeger cuts in hypergraphs via heat equation. Theor. Comput. Sci. 930 (2022)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR (2022)
Issey Sukeda, Atsushi Miyauchi, Akiko Takeda
A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis. CoRR (2022)
Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Dense and well-connected subgraph detection in dual networks. SDM (2022)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117 (2021)
Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka
A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CIKM (2021)
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Finding densest k-connected subgraphs. Discret. Appl. Math. 305 (2021)
Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Dense and well-connected subgraph detection in dual networks. CoRR (2021)
Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka
A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CoRR (2021)
Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR (2020)
Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback. Neural Comput. 32 (9) (2020)
Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida
Hypergraph Clustering Based on PageRank. KDD (2020)
Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML (2020)
Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
Finding Densest k-Connected Subgraphs. CoRR (2020)
Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida
Hypergraph Clustering Based on PageRank. CoRR (2020)
Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR (2019)
Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback. CoRR (2019)
Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI (2019)
Atsushi Miyauchi, Akiko Takeda
Robust Densest Subgraph Discovery. CoRR (2018)
Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida
Finding Cheeger Cuts in Hypergraphs via Heat Equation. CoRR (2018)
Atsushi Miyauchi, Naonori Kakimura
Finding a Dense Subgraph with Sparse Cut. CIKM (2018)
Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa
Exact Clustering via Integer Programming and Maximum Satisfiability. AAAI (2018)
Atsushi Miyauchi, Akiko Takeda
Robust Densest Subgraph Discovery. ICDM (2018)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica 80 (12) (2018)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. CoRR (2017)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. ISAAC (2016)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. CoRR (2016)
Yasushi Kawase, Atsushi Miyauchi
The Densest Subgraph Problem with a Convex/Concave Size Function. ISAAC (2016)
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
Threshold Influence Model for Allocating Advertising Budgets. ICML (2015)
Atsushi Miyauchi, Yasushi Kawase
What Is a Network Community?: A Novel Quality Function and Detection Algorithms. CIKM (2015)
Atsushi Miyauchi, Noriyoshi Sukegawa
Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. 9 (1) (2015)
Atsushi Miyauchi, Yasushi Kawase
Z-score-based modularity for community detection in networks. CoRR (2015)
Atsushi Miyauchi, Noriyoshi Sukegawa
Maximizing Barber's bipartite modularity is also hard. Optim. Lett. 9 (5) (2015)
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. 114 (12) (2014)
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
Fractional programming formulation for the vertex coloring problem. CoRR (2014)
Noriyoshi Sukegawa, Atsushi Miyauchi
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. 10 (4) (2013)
Atsushi Miyauchi, Noriyoshi Sukegawa
Maximizing Barber's bipartite modularity is also hard. CoRR (2013)