Atsushi Miyauchi

Orcid: 0000-0002-6033-6433

Affiliations:
  • CENTAI Institute, Turin, Italy
  • University of Tokyo, Tokyo, Japan (former)
  • RIKEN, Center for Advanced Intelligence Project (AIP), Wakō, Japan (former)


According to our database1, Atsushi Miyauchi authored at least 29 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Survey on the Densest Subgraph Problem and its Variants.
ACM Comput. Surv., August, 2024

Multilayer Correlation Clustering.
CoRR, 2024

Bandits with Abstention under Expert Advice.
CoRR, 2024

Query-Efficient Correlation Clustering with Noisy Oracle.
CoRR, 2024

Local Centrality Minimization with Quality Guarantees.
Proceedings of the ACM on Web Conference 2024, 2024

2023
A study on modularity density maximization: Column generation acceleration and computational complexity analysis.
Eur. J. Oper. Res., September, 2023

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.
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.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Finding Cheeger cuts in hypergraphs via heat equation.
Theor. Comput. Sci., 2022

Dense and well-connected subgraph detection in dual networks.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

2021
Additive approximation algorithms for modularity maximization.
J. Comput. Syst. Sci., 2021

Finding densest k-connected subgraphs.
Discret. Appl. Math., 2021

A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion.
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.
Neural Comput., 2020

Hypergraph Clustering Based on PageRank.
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.
Proceedings of the 37th International Conference on Machine Learning, 2020

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

Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

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

Robust Densest Subgraph Discovery.
Proceedings of the IEEE International Conference on Data Mining, 2018

Finding a Dense Subgraph with Sparse Cut.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018

Exact Clustering via Integer Programming and Maximum Satisfiability.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2015
Maximizing Barber's bipartite modularity is also hard.
Optim. Lett., 2015

Redundant constraints in the standard formulation for the clique partitioning problem.
Optim. Lett., 2015

Z-score-based modularity for community detection in networks.
CoRR, 2015

Threshold Influence Model for Allocating Advertising Budgets.
Proceedings of the 32nd International Conference on Machine Learning, 2015

What Is a Network Community?: A Novel Quality Function and Detection Algorithms.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Fractional programming formulation for the vertex coloring problem.
Inf. Process. Lett., 2014

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


  Loading...