Atsushi Miyauchi

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information 2024 Tianyi Chen
Atsushi Miyauchi
Charalampos E. Tsourakakis
+ PDF Chat Local Centrality Minimization with Quality Guarantees 2024 Atsushi Miyauchi
Lorenzo Severini
Francesco Bonchi
+ PDF Chat Multilayer Correlation Clustering 2024 Atsushi Miyauchi
Florian Adriaens
Francesco Bonchi
Nikolaj Tatti
+ PDF Chat A Survey on the Densest Subgraph Problem and its Variants 2024 Tommaso Lanciano
Atsushi Miyauchi
Adriano Fazzone
Francesco Bonchi
+ PDF Chat Bandits with Abstention under Expert Advice 2024 Stephen Pasteris
Alberto Rumi
Maximilian Thiessen
Shota Saito
Atsushi Miyauchi
Fabio Vitale
Mark Herbster
+ PDF Chat Local Centrality Minimization with Quality Guarantees 2024 Atsushi Miyauchi
Lorenzo Severini
Francesco Bonchi
+ PDF Chat Query-Efficient Correlation Clustering with Noisy Oracle 2024 Yuko Kuroki
Atsushi Miyauchi
Francesco Bonchi
Wei Chen
+ Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity 2023 Atsushi Miyauchi
Tianyi Chen
Konstantinos Sotiropoulos
Charalampos E. Tsourakakis
+ Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks 2023 Yasushi Kawase
Atsushi Miyauchi
Hanna Sumita
+ PDF Chat A study on modularity density maximization: Column generation acceleration and computational complexity analysis 2023 Issey Sukeda
Atsushi Miyauchi
Akiko Takeda
+ A Survey on the Densest Subgraph Problem and its Variants 2023 Tommaso Lanciano
Atsushi Miyauchi
Adriano Fazzone
Francesco Bonchi
+ PDF Chat Finding Cheeger cuts in hypergraphs via heat equation 2022 Masahiro Ikeda
Atsushi Miyauchi
Yuuki Takai
Yuichi Yoshida
+ PDF Chat Dense and well-connected subgraph detection in dual networks 2022 Tianyi Chen
Francesco Bonchi
David GarcĂ­a-Soriano
Atsushi Miyauchi
Charalampos E. Tsourakakis
+ A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis 2022 Issey Sukeda
Atsushi Miyauchi
Akiko Takeda
+ PDF Chat A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion 2021 Naoki Marumo
Atsushi Miyauchi
Akiko Takeda
Akira Tanaka
+ PDF Chat Finding densest <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e349" altimg="si11.svg"><mml:mi>k</mml:mi></mml:math>-connected subgraphs 2021 Francesco Bonchi
David GarcĂ­a-Soriano
Atsushi Miyauchi
Charalampos E. Tsourakakis
+ Dense and well-connected subgraph detection in dual networks 2021 Tianyi Chen
Francesco Bonchi
David GarcĂ­a-Soriano
Atsushi Miyauchi
Charalampos E. Tsourakakis
+ PDF Chat Additive approximation algorithms for modularity maximization 2020 Yasushi Kawase
Tomomi Matsui
Atsushi Miyauchi
+ PDF Chat Hypergraph Clustering Based on PageRank 2020 Yuuki Takai
Atsushi Miyauchi
Masahiro Ikeda
Yuichi Yoshida
+ PDF Chat Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback 2020 Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
+ Online Dense Subgraph Discovery via Blurred-Graph Feedback 2020 Yuko Kuroki
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
+ Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation 2019 Yasushi Kawase
Yuko Kuroki
Atsushi Miyauchi
+ Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation 2019 Yasushi Kawase
Yuko Kuroki
Atsushi Miyauchi
+ Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback 2019 Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
+ Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback 2019 Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
+ PDF Chat Robust Densest Subgraph Discovery 2018 Atsushi Miyauchi
Akiko Takeda
+ Robust Densest Subgraph Discovery 2018 Atsushi Miyauchi
Akiko Takeda
+ Finding Cheeger Cuts in Hypergraphs via Heat Equation 2018 Masahiro Ikeda
Atsushi Miyauchi
Yuuki Takai
Yuichi Yoshida
+ PDF Chat The Densest Subgraph Problem with a Convex/Concave Size Function 2017 Yasushi Kawase
Atsushi Miyauchi
+ The Densest Subgraph Problem with a Convex/Concave Size Function 2017 Yasushi Kawase
Atsushi Miyauchi
+ PDF Chat Z-Score-Based Modularity for Community Detection in Networks 2016 Atsushi Miyauchi
Yasushi Kawase
+ Additive Approximation Algorithms for Modularity Maximization 2016 Yasushi Kawase
Tomomi Matsui
Atsushi Miyauchi
+ pSpatiocyte: A Parallel Stochastic Method for Particle Reaction-Diffusion Systems 2016 Atsushi Miyauchi
Kazunari Iwamoto
Satya N.V. Arjunan
Koichi Takahashi
+ What Is a Network Community? 2015 Atsushi Miyauchi
Yasushi Kawase
+ PDF Chat Maximizing Barber’s bipartite modularity is also hard 2014 Atsushi Miyauchi
Noriyoshi Sukegawa
+ PDF Chat Fractional programming formulation for the vertex coloring problem 2014 Tomomi Matsui
Noriyoshi Sukegawa
Atsushi Miyauchi
+ Linear Order Matrix Inversion Method with Help from Quantum Searching Algorithm 2001 Atsushi Miyauchi
+ Predicting the Amount of Purchase by a Procedure Using Multidimensional Scaling: An Application to Scanner Data on Beer 1998 Akinori Okada
Atsushi Miyauchi
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Greedy Approximation Algorithms for Finding Dense Components in a Graph 2000 Moses Charikar
12
+ PDF Chat The Densest Subgraph Problem with a Convex/Concave Size Function 2017 Yasushi Kawase
Atsushi Miyauchi
12
+ Greedily Finding a Dense Subgraph 2000 Yuichi Asahiro
Kazuo Iwama
Hisao Tamaki
Takeshi Tokuyama
10
+ Core decomposition of uncertain graphs 2014 Francesco Bonchi
Francesco Gullo
Andreas Kaltenbrunner
Yana Volkovich
8
+ PDF Chat Densest subgraph in streaming and MapReduce 2012 Bahman Bahmani
Ravi Kumar
Sergei Vassilvitskii
8
+ PDF Chat Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams 2015 Sayan Bhattacharya
Monika Henzinger
Danupon Nanongkai
Charalampos E. Tsourakakis
7
+ PDF Chat Finding and evaluating community structure in networks 2004 Michelle G. Newman
Michelle Girvan
7
+ PDF Chat Community detection in graphs 2009 Santo Fortunato
7
+ PDF Chat Modularity-maximizing graph communities via mathematical programming 2008 Gunjan Agarwal
David Kempe
6
+ PDF Chat Dense subgraph maintenance under streaming edge weight updates for real-time story identification 2012 Albert Angel
Nikos Sarkas
Nick Koudas
Divesh Srivastava
6
+ PDF Chat On Modularity Clustering 2008 Ulrik Brandes
Daniel Delling
Marco Gaertler
Robert Görke
Martin Hoefer
Zoran Nikoloski
Dorothea Wagner
5
+ PDF Chat Identifying communities within energy landscapes 2005 Claire P. Massen
Jonathan P. K. Doye
5
+ PDF Chat Performance of modularity maximization in practical contexts 2010 Benjamin H. Good
Yves-Alexandre de Montjoye
Aaron Clauset
5
+ Finding community structure in very large networks 2004 Aaron Clauset
M. E. J. Newman
Cristopher Moore
5
+ PDF Chat Robust Densest Subgraph Discovery 2018 Atsushi Miyauchi
Akiko Takeda
5
+ Modularity and community structure in networks 2006 M. E. J. Newman
5
+ Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation 2019 Yasushi Kawase
Yuko Kuroki
Atsushi Miyauchi
5
+ PDF Chat Fast unfolding of communities in large networks 2008 Vincent D. Blondel
Jean‐Loup Guillaume
Renaud Lambiotte
Etienne Lefebvre
5
+ Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph 2010 Aditya Bhaskara
Moses Charikar
Eden Chlamtáč
Uriel Feige
Aravindan Vijayaraghavan
5
+ PDF Chat Densest Subgraph in Dynamic Graph Streams 2015 Andrew McGregor
David Tench
Sofya Vorotnikova
Hoa T. Vu
5
+ Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph 2010 Aditya Bhaskara
Moses Charikar
Eden Chlamtáč
Uriel Feige
Aravindan Vijayaraghavan
5
+ PDF Chat Finding lasting dense subgraphs 2018 Konstantinos Semertzidis
Evaggelia Pitoura
Evimaria Terzi
Panayiotis Tsaparas
4
+ PDF Chat Towards realistic team formation in social networks based on densest subgraphs 2013 Syama Sundar Rangapuram
Thomas BĂŒhler
Matthias Hein
4
+ PDF Chat Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries 2020 Charalampos E. Tsourakakis
Tianyi Chen
Naonori Kakimura
Jakub Pachocki
4
+ PDF Chat The Generalized Mean Densest Subgraph Problem 2021 Nate Veldt
Austin R. Benson
Jon Kleinberg
4
+ PDF Chat Resolution limit in community detection 2006 Santo Fortunato
Marc Barthélemy
4
+ PDF Chat Flowless: Extracting Densest Subgraphs Without Flow Computations 2020 Digvijay Boob
Yu Gao
Richard Peng
Saurabh Sawlani
Charalampos E. Tsourakakis
Di Wang
Junxing Wang
4
+ PDF Chat Community detection in complex networks using extremal optimization 2005 Jordi Duch
Àlex Arenas
4
+ PDF Chat Dense subgraph maintenance under streaming edge weight updates for real-time story identification 2013 Albert Angel
Nick Koudas
Nikos Sarkas
Divesh Srivastava
Michael Svendsen
Srikanta Tirthapura
4
+ PDF Chat Spectral tripartitioning of networks 2009 Thomas Richardson
Peter J. Mucha
Mason A. Porter
4
+ PDF Chat Functional cartography of complex metabolic networks 2005 Roger GuimerĂ 
Luı́s A. Nunes Amaral
4
+ PDF Chat Column generation algorithms for exact modularity maximization in networks 2010 Daniel Aloise
Sonia Cafieri
Gilles Caporossi
Pierre Hansen
Sylvain Perron
Leo Liberti
4
+ PDF Chat An Information Flow Model for Conflict and Fission in Small Groups 1977 Wayne Zachary
3
+ On the Abstract Properties of Linear Dependence1 2009 Hassler Whitney
3
+ Best-Arm Identification in Linear Bandits 2014 Marta Soare
Alessandro Lazaric
RĂ©mi Munos
3
+ PDF Chat Near-optimal fully dynamic densest subgraph 2020 Saurabh Sawlani
Junxing Wang
3
+ PDF Chat Explainable Classification of Brain Networks via Contrast Subgraphs 2020 Tommaso Lanciano
Francesco Bonchi
Aristides Gionis
3
+ PDF Chat Approximation of the Quadratic Knapsack Problem 2016 Richard Taylor
3
+ PDF Chat A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization 2015 Yin Tat Lee
Aaron Sidford
Sam Chiu-wai Wong
3
+ PDF Chat Mining Density Contrast Subgraphs 2018 Yang Yu
Lingyang Chu
Yanyan Zhang
Zhefeng Wang
Jian Pei
Enhong Chen
3
+ On Finding Dense Common Subgraphs 2018 Moses Charikar
Yonatan Naamad
Jimmy Ming‐Tai Wu
3
+ PDF Chat Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming 1995 Michel X. Goemans
David P. Williamson
3
+ Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration 2017 Lijie Chen
Anupam Gupta
Jian Li
Mingda Qiao
Ruosong Wang
3
+ Pure Exploration of Multi-armed Bandit Under Matroid Constraints 2016 Lijie Chen
Anupam Gupta
Jian Li
3
+ Community structure in social and biological networks 2002 Michelle Girvan
M. E. J. Newman
3
+ PDF Chat Modularity and community detection in bipartite networks 2007 Michael Barber
3
+ PDF Chat Fully Dynamic Algorithm for Top- <i>k</i> Densest Subgraphs 2017 Muhammad Anis Uddin Nasir
Aristides Gionis
Gianmarco De Francisci Morales
Ơarƫnas Girdzijauskas
3
+ On the Optimal Sample Complexity for Best Arm Identification 2015 Lijie Chen
Jian Li
3
+ Disagreement-based combinatorial pure exploration: Efficient algorithms and an analysis with localization 2017 Tongyi Cao
Akshay Krishnamurthy
3
+ PDF Chat Multi-skill Collaborative Teams based on Densest Subgraphs 2012 Amita Gajewar
Atish Das Sarma
3