Follow
Atsushi Miyauchi
Atsushi Miyauchi
Verified email at mist.i.u-tokyo.ac.jp - Homepage
Title
Cited by
Cited by
Year
Z-score-based modularity for community detection in networks
A Miyauchi, Y Kawase
PloS one 11 (1), e0147805, 2016
292016
Redundant constraints in the standard formulation for the clique partitioning problem
A Miyauchi, N Sukegawa
Optimization Letters 9 (1), 199-207, 2015
262015
The densest subgraph problem with a convex/concave size function
Y Kawase, A Miyauchi
Algorithmica 80 (12), 3461-3480, 2018
232018
Hypergraph clustering based on pagerank
Y Takai, A Miyauchi, M Ikeda, Y Yoshida
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020
192020
Polynomial-time algorithms for multiple-arm identification with full-bandit feedback
Y Kuroki, L Xu, A Miyauchi, J Honda, M Sugiyama
Neural Computation 32 (9), 1733-1773, 2020
18*2020
Exact clustering via integer programming and maximum satisfiability
A Miyauchi, T Sonobe, N Sukegawa
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
182018
Maximizing Barber’s bipartite modularity is also hard
A Miyauchi, N Sukegawa
Optimization Letters 9 (5), 897-913, 2015
172015
Threshold influence model for allocating advertising budgets
A Miyauchi, Y Iwamasa, T Fukunaga, N Kakimura
International Conference on Machine Learning, 1395-1404, 2015
162015
Computing an upper bound of modularity
A Miyauchi, Y Miyamoto
The European Physical Journal B 86 (7), 1-7, 2013
152013
Finding Cheeger cuts in hypergraphs via heat equation
M Ikeda, A Miyauchi, Y Takai, Y Yoshida
Theoretical Computer Science, 2022
142022
What is a network community? A novel quality function and detection algorithms
A Miyauchi, Y Kawase
Proceedings of the 24th ACM international on conference on information and …, 2015
142015
Finding a dense subgraph with sparse cut
A Miyauchi, N Kakimura
Proceedings of the 27th ACM International Conference on Information and …, 2018
112018
Graph mining meets crowdsourcing: Extracting experts for answer aggregation
Y Kawase, Y Kuroki, A Miyauchi
arXiv preprint arXiv:1905.08088, 2019
102019
Additive approximation algorithms for modularity maximization
Y Kawase, T Matsui, A Miyauchi
Journal of Computer and System Sciences 117, 182-201, 2021
92021
Online dense subgraph discovery via blurred-graph feedback
Y Kuroki, A Miyauchi, J Honda, M Sugiyama
International Conference on Machine Learning, 5522-5532, 2020
92020
Fractional programming formulation for the vertex coloring problem
T Matsui, N Sukegawa, A Miyauchi
Information Processing Letters 114 (12), 706-709, 2014
62014
Robust densest subgraph discovery
A Miyauchi, A Takeda
2018 IEEE International Conference on Data Mining (ICDM), 1188-1193, 2018
52018
Finding densest k-connected subgraphs
F Bonchi, D García-Soriano, A Miyauchi, CE Tsourakakis
Discrete Applied Mathematics 305, 34-47, 2021
22021
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number.
N Sukegawa, A Miyauchi
Discret. Optim. 10 (4), 331-332, 2013
22013
A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis
I Sukeda, A Miyauchi, A Takeda
arXiv preprint arXiv:2206.10901, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20