Atsushi Miyauchi

According to our database, Atsushi Miyauchi authored at least 27 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Local Centrality Minimization with Quality Guarantees.

Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi

CoRR, 2024

Query-Efficient Correlation Clustering with Noisy Oracle.

Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen

CoRR, 2024

2023

A study on modularity density maximization: Column generation acceleration and computational complexity analysis.

Issey Sukeda, Atsushi Miyauchi, Akiko Takeda

Eur. J. Oper. Res., September, 2023

A Survey on the Densest Subgraph Problem and its Variants.

Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi

CoRR, 2023

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.

Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity.

Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022

Finding Cheeger cuts in hypergraphs via heat equation.

Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida

Theor. Comput. Sci., 2022

Dense and well-connected subgraph detection in dual networks.

Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis

Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021

Additive approximation algorithms for modularity maximization.

Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi

J. Comput. Syst. Sci., 2021

Finding densest k-connected subgraphs.

Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis

Discret. Appl. Math., 2021

A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion.

Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020

Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback.

Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama

Neural Comput., 2020

Hypergraph Clustering Based on PageRank.

Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Online Dense Subgraph Discovery via Blurred-Graph Feedback.

Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback.

Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama

CoRR, 2019

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation.

Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

The Densest Subgraph Problem with a Convex/Concave Size Function.

Yasushi Kawase, Atsushi Miyauchi

Algorithmica, 2018

Robust Densest Subgraph Discovery.

Atsushi Miyauchi, Akiko Takeda

Proceedings of the IEEE International Conference on Data Mining, 2018

Finding a Dense Subgraph with Sparse Cut.

Atsushi Miyauchi, Naonori Kakimura

Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

Exact Clustering via Integer Programming and Maximum Satisfiability.

Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2015

Maximizing Barber's bipartite modularity is also hard.

Atsushi Miyauchi, Noriyoshi Sukegawa

Optim. Lett., 2015

Redundant constraints in the standard formulation for the clique partitioning problem.

Atsushi Miyauchi, Noriyoshi Sukegawa

Optim. Lett., 2015

Z-score-based modularity for community detection in networks.

Atsushi Miyauchi, Yasushi Kawase

CoRR, 2015

Threshold Influence Model for Allocating Advertising Budgets.

Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura

Proceedings of the 32nd International Conference on Machine Learning, 2015

What Is a Network Community?: A Novel Quality Function and Detection Algorithms.

Atsushi Miyauchi, Yasushi Kawase

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Fractional programming formulation for the vertex coloring problem.

Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi

Inf. Process. Lett., 2014

2013

A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number.

Noriyoshi Sukegawa, Atsushi Miyauchi

Discret. Optim., 2013