Atsushi Miyauchi

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A study on modularity density maximization: column generation acceleration and computational complexity analysis European Journal of Operational Research	2023-07-10	Paper
Finding Cheeger cuts in hypergraphs via heat equation Theoretical Computer Science	2022-08-25	Paper
Finding densest \(k\)-connected subgraphs Discrete Applied Mathematics	2021-10-21	Paper
Additive approximation algorithms for modularity maximization Journal of Computer and System Sciences	2021-02-02	Paper
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback Neural Computation	2021-01-04	Paper
Hypergraph Clustering Based on PageRank	2020-06-15	Paper
The densest subgraph problem with a convex/concave size function Algorithmica	2018-10-18	Paper
The densest subgraph problem with a convex/concave size function Algorithmica	2018-10-18	Paper
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number Discrete Optimization	2018-10-18	Paper
Finding Cheeger Cuts in Hypergraphs via Heat Equation (available as arXiv preprint)	2018-09-12	Paper
The densest subgraph problem with a convex/concave size function	2018-04-19	Paper
Additive approximation algorithms for modularity maximization (available as arXiv preprint)	2018-04-19	Paper
Maximizing Barber's bipartite modularity is also hard Optimization Letters	2015-07-22	Paper
Redundant constraints in the standard formulation for the clique partitioning problem Optimization Letters	2015-02-23	Paper
Fractional programming formulation for the vertex coloring problem Information Processing Letters	2014-08-28	Paper

Research outcomes over time

This page was built for person: Atsushi Miyauchi