Atsushi Miyauchi

59 papers A* 12A 7B 2Journal 38

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Survey on Centrality and Importance Measures in Hypergraphs: Categorization and Empirical Insights. CoRR Jaewan Chun, Fanchen Bu, Yeongho Kim, Atsushi Miyauchi, Francesco Bonchi, Kijung Shin
2025	A*	`conf`	An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale. ICML Fabian Christian Spaeh, Atsushi Miyauchi
2025	J	`jnl`	An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale. CoRR Fabian Spaeh, Atsushi Miyauchi
2025	A*	`conf`	Minimizing Polarization and Disagreement in the Friedkin-Johnsen Model with Unknown Innate Opinions. IJCAI Federico Cinus, Atsushi Miyauchi, Yuko Kuroki, Francesco Bonchi
2025	J	`jnl`	Minimizing Polarization and Disagreement in the Friedkin-Johnsen Model with Unknown Innate Opinions. CoRR Federico Cinus, Atsushi Miyauchi, Yuko Kuroki, Francesco Bonchi
2025	J	`jnl`	Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits. CoRR Federico Cinus, Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi
2025	A	`conf`	Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. WSDM Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
2025	A	`conf`	Untapping the Power of Indirect Relationships in Entity Summarization. WSDM Atefeh Moradan, Mohammad Sorkhpar, Atsushi Miyauchi, Davide Mottin, Ira Assent
2024	J	`jnl`	A Survey on the Densest Subgraph Problem and its Variants. ACM Comput. Surv. Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi
2024	A*	`conf`	Bandits with Abstention under Expert Advice. NeurIPS Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster
2024	J	`jnl`	Bandits with Abstention under Expert Advice. CoRR Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster
2024	A*	`conf`	Local Centrality Minimization with Quality Guarantees. WWW Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi
2024	J	`jnl`	Local Centrality Minimization with Quality Guarantees. CoRR Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi
2024	J	`jnl`	Multilayer Correlation Clustering. CoRR Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti
2024	J	`jnl`	Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information. CoRR Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
2024	A*	`conf`	Query-Efficient Correlation Clustering with Noisy Oracle. NeurIPS Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen
2024	J	`jnl`	Query-Efficient Correlation Clustering with Noisy Oracle. CoRR Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen
2023	J	`jnl`	A Survey on the Densest Subgraph Problem and its Variants. CoRR Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi
2023	J	`jnl`	A study on modularity density maximization: Column generation acceleration and computational complexity analysis. Eur. J. Oper. Res. Issey Sukeda, Atsushi Miyauchi, Akiko Takeda
2023	A*	`conf`	Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2023	J	`jnl`	Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis
2023	A	`conf`	Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
2022	J	`jnl`	A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis. CoRR Issey Sukeda, Atsushi Miyauchi, Akiko Takeda
2022	A	`conf`	Dense and well-connected subgraph detection in dual networks. SDM Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2022	J	`jnl`	Finding Cheeger cuts in hypergraphs via heat equation. Theor. Comput. Sci. Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida
2022	J	`jnl`	Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
2021	A	`conf`	A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CIKM Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka
2021	J	`jnl`	A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CoRR Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka
2021	J	`jnl`	Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2021	J	`jnl`	Dense and well-connected subgraph detection in dual networks. CoRR Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2021	J	`jnl`	Finding densest k-connected subgraphs. Discret. Appl. Math. Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2020	J	`jnl`	Finding Densest k-Connected Subgraphs. CoRR Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis
2020	A*	`conf`	Hypergraph Clustering Based on PageRank. KDD Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida
2020	J	`jnl`	Hypergraph Clustering Based on PageRank. CoRR Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida
2020	A*	`conf`	Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
2020	J	`jnl`	Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
2020	J	`jnl`	Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback. Neural Comput. Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
2019	A*	`conf`	Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
2019	J	`jnl`	Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi
2019	J	`jnl`	Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback. CoRR Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
2018	A*	`conf`	Exact Clustering via Integer Programming and Maximum Satisfiability. AAAI Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa
2018	J	`jnl`	Finding Cheeger Cuts in Hypergraphs via Heat Equation. CoRR Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida
2018	A	`conf`	Finding a Dense Subgraph with Sparse Cut. CIKM Atsushi Miyauchi, Naonori Kakimura
2018	A*	`conf`	Robust Densest Subgraph Discovery. ICDM Atsushi Miyauchi, Akiko Takeda
2018	J	`jnl`	Robust Densest Subgraph Discovery. CoRR Atsushi Miyauchi, Akiko Takeda
2018	J	`jnl`	The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica Yasushi Kawase, Atsushi Miyauchi
2017	J	`jnl`	The Densest Subgraph Problem with a Convex/Concave Size Function. CoRR Yasushi Kawase, Atsushi Miyauchi
2016	B	`conf`	Additive Approximation Algorithms for Modularity Maximization. ISAAC Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2016	J	`jnl`	Additive Approximation Algorithms for Modularity Maximization. CoRR Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
2016	B	`conf`	The Densest Subgraph Problem with a Convex/Concave Size Function. ISAAC Yasushi Kawase, Atsushi Miyauchi
2015	J	`jnl`	Maximizing Barber's bipartite modularity is also hard. Optim. Lett. Atsushi Miyauchi, Noriyoshi Sukegawa
2015	J	`jnl`	Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. Atsushi Miyauchi, Noriyoshi Sukegawa
2015	A*	`conf`	Threshold Influence Model for Allocating Advertising Budgets. ICML Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
2015	A	`conf`	What Is a Network Community?: A Novel Quality Function and Detection Algorithms. CIKM Atsushi Miyauchi, Yasushi Kawase
2015	J	`jnl`	Z-score-based modularity for community detection in networks. CoRR Atsushi Miyauchi, Yasushi Kawase
2014	J	`jnl`	Fractional programming formulation for the vertex coloring problem. CoRR Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
2014	J	`jnl`	Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
2013	J	`jnl`	A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. Noriyoshi Sukegawa, Atsushi Miyauchi
2013	J	`jnl`	Maximizing Barber's bipartite modularity is also hard. CoRR Atsushi Miyauchi, Noriyoshi Sukegawa