Talks by Atsushi Miyauchi

Invited Talks


Very recent developments in dense subgraph discovery

Algorithmic Data Analytics Group, ISI Foundation, Turin, Italy, October 2018. 

Invited by Deputy Director Dr. Francesco Bonchi


Graph clustering with performance guarantees: Mathematical programming approaches,

Department of Computer Science, School of Engineering, Virginia Commonwealth University, Richmond, Virginia, USA, February 2018. 

Invited by Assistant Professor Dr. Thang N. Dinh

International Conferences


Local centrality minimization with quality guarantees,

The ACM Web Conference 2024 (TheWebConf 2024), Singapore, May 2024.


Densest diverse subgraphs: How to plan a successful cocktail party with diversity,

The 29th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2023), Long Beach, California, USA, August 2023.


Stochastic solutions for dense subgraph discovery in multilayer networks

The 16th ACM International Conference on Web Search and Data Mining (WSDM 2023), Singapore, February 2023.


Finding densest k-connected subgraphs

The 6th RIKEN-IMI-ISM-NUS-ZIB-MODAL-NHR Workshop on Advances in Classical and Quantum Algorithms for Optimization and Machine Learning, Tokyo and Fukuoka, September 2022. 


A projected gradient method for opinion optimization with limited changes of susceptibility to persuasion

The 30th ACM International Conference on Information and Knowledge Management (CIKM 2021), Online, November 2021.


Finding a dense subgraph with sparse cut

IIT–RIKEN Joint Workshop for Advanced Intelligence, Genova, Italy, September 2019.


Robust densest subgraph discovery,

The 18th IEEE International Conference on Data Mining (ICDM 2018), Singapore, November 2018.


Finding a dense subgraph with sparse cut

The 27th ACM International Conference on Information and Knowledge Management (CIKM 2018), Turin, Italy, October 2018. 


Exact clustering via integer programming and maximum satisfiability,

Discrete Optimization and Machine Learning, Tokyo, Japan, July 2018.  


Exact clustering via integer programming and maximum satisfiability,

The 23rd International Symposium on Mathematical Programming (ISMP 2018), Bordeaux, France, July 2018.


Exact clustering via integer programming and maximum satisfiability,

The 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), New Orleans, Louisiana, USA, February 2018.


What is a network community? A novel quality function and detection algorithms,

Machine Learning Summer School 2017 (MLSS 2017), Tuebingen, Germany, June 2017.


Additive approximation algorithms for modularity maximization,

The 27th International Symposium on Algorithms and Computation (ISAAC 2016), Sydney, Australia, December 2016.


The densest subgraph problem with a convex/concave size function,

The 27th International Symposium on Algorithms and Computation (ISAAC 2016), Sydney, Australia, December 2016.


What is a network community? A novel quality function and detection algorithms,

The 24th ACM International Conference on Information and Knowledge Management (CIKM 2015), Melbourne, Australia, October 2015.


Threshold influence model for allocating advertising budgets,

The 32nd International Conference on Machine Learning (ICML 2015), Lille, France, July 2015.


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

International School and Conference on Network Science 2015 (NetSci 2015), Zaragoza, Spain, June 2015.

Copyright © 2017–2024 Atsushi Miyauchi All Rights Reserved.