Atsushi Miyauchi

Available identifiers

Publication	Date of Publication	Type
A study on modularity density maximization: column generation acceleration and computational complexity analysis	2023-07-10	Paper
Finding Cheeger cuts in hypergraphs via heat equation	2022-08-25	Paper
Finding densest \(k\)-connected subgraphs	2021-10-21	Paper
Additive approximation algorithms for modularity maximization	2021-02-02	Paper
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback	2021-01-04	Paper
Hypergraph Clustering Based on PageRank	2020-06-15	Paper
The densest subgraph problem with a convex/concave size function	2018-10-18	Paper
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number	2018-10-18	Paper
Finding Cheeger Cuts in Hypergraphs via Heat Equation	2018-09-12	Paper
The Densest Subgraph Problem with a Convex/Concave Size Function	2018-04-19	Paper
Additive Approximation Algorithms for Modularity Maximization	2018-04-19	Paper
Maximizing Barber's bipartite modularity is also hard	2015-07-22	Paper
Redundant constraints in the standard formulation for the clique partitioning problem	2015-02-23	Paper
Fractional programming formulation for the vertex coloring problem	2014-08-28	Paper

This page was built for person: Atsushi Miyauchi