default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtsushi Miyauchi 0001
Person information
- unicode name: 宮内 敦史
- affiliation: CENTAI Institute, Turin, Italy
- affiliation (former): University of Tokyo, Tokyo, Japan
- affiliation (former): RIKEN, Center for Advanced Intelligence Project (AIP), Wakō, Japan
Other persons with the same name
- Atsushi Miyauchi 0002 — Research Organization for Information Science and Technology (RIST), Kobe, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Tommaso Lanciano
, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi:
A Survey on the Densest Subgraph Problem and its Variants. ACM Comput. Surv. 56(8): 208:1-208:40 (2024)- [c15]Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi:
Local Centrality Minimization with Quality Guarantees. WWW 2024: 410-421 - [i22]Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen:
Query-Efficient Correlation Clustering with Noisy Oracle. CoRR abs/2402.01400 (2024) - [i21]Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi:
Local Centrality Minimization with Quality Guarantees. CoRR abs/2402.07718 (2024) - [i20]Stephen Pasteris, Alberto Rumi, Maximilian Thiessen, Shota Saito, Atsushi Miyauchi, Fabio Vitale, Mark Herbster:
Bandits with Abstention under Expert Advice. CoRR abs/2402.14585 (2024) - [i19]Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi, Nikolaj Tatti:
Multilayer Correlation Clustering. CoRR abs/2404.16676 (2024) - 2023
- [j10]Issey Sukeda, Atsushi Miyauchi, Akiko Takeda:
A study on modularity density maximization: Column generation acceleration and computational complexity analysis. Eur. J. Oper. Res. 309(2): 516-528 (2023) - [c14]Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. KDD 2023: 1710-1721 - [c13]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM 2023: 886-894 - [i18]Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi:
A Survey on the Densest Subgraph Problem and its Variants. CoRR abs/2303.14467 (2023) - [i17]Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. Tsourakakis:
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. CoRR abs/2306.02338 (2023) - 2022
- [j9]Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger cuts in hypergraphs via heat equation. Theor. Comput. Sci. 930: 1-23 (2022) - [c12]Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Dense and well-connected subgraph detection in dual networks. SDM 2022: 361-369 - [i16]Issey Sukeda, Atsushi Miyauchi, Akiko Takeda:
A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis. CoRR abs/2206.10901 (2022) - [i15]Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR abs/2211.03306 (2022) - 2021
- [j8]Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding densest k-connected subgraphs. Discret. Appl. Math. 305: 34-47 (2021) - [j7]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117: 182-201 (2021) - [c11]Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka:
A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CIKM 2021: 1274-1283 - [i14]Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka:
A Projected Gradient Method for Opinion Optimization with Limited Changes of Susceptibility to Persuasion. CoRR abs/2108.09865 (2021) - [i13]Tianyi Chen, Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Dense and well-connected subgraph detection in dual networks. CoRR abs/2112.03337 (2021) - 2020
- [j6]Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback. Neural Comput. 32(9): 1733-1773 (2020) - [c10]Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML 2020: 5522-5532 - [c9]Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. KDD 2020: 1970-1978 - [i12]Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. CoRR abs/2006.08302 (2020) - [i11]Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR abs/2006.13642 (2020) - [i10]Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding Densest k-Connected Subgraphs. CoRR abs/2007.01533 (2020)
2010 – 2019
- 2019
- [c8]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI 2019: 1272-1279 - [i9]Yuko Kuroki, Liyuan Xu, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback. CoRR abs/1902.10582 (2019) - [i8]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR abs/1905.08088 (2019) - 2018
- [j5]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica 80(12): 3461-3480 (2018) - [c7]Atsushi Miyauchi, Tomohiro Sonobe, Noriyoshi Sukegawa:
Exact Clustering via Integer Programming and Maximum Satisfiability. AAAI 2018: 1387-1394 - [c6]Atsushi Miyauchi, Naonori Kakimura:
Finding a Dense Subgraph with Sparse Cut. CIKM 2018: 547-556 - [c5]Atsushi Miyauchi, Akiko Takeda:
Robust Densest Subgraph Discovery. ICDM 2018: 1188-1193 - [i7]Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger Cuts in Hypergraphs via Heat Equation. CoRR abs/1809.04396 (2018) - [i6]Atsushi Miyauchi, Akiko Takeda:
Robust Densest Subgraph Discovery. CoRR abs/1809.04802 (2018) - 2017
- [i5]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. CoRR abs/1703.03603 (2017) - 2016
- [c4]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. ISAAC 2016: 43:1-43:13 - [c3]Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. ISAAC 2016: 44:1-44:12 - [i4]Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive Approximation Algorithms for Modularity Maximization. CoRR abs/1601.03316 (2016) - 2015
- [j4]Atsushi Miyauchi, Noriyoshi Sukegawa:
Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. 9(1): 199-207 (2015) - [j3]Atsushi Miyauchi, Noriyoshi Sukegawa:
Maximizing Barber's bipartite modularity is also hard. Optim. Lett. 9(5): 897-913 (2015) - [c2]Atsushi Miyauchi, Yasushi Kawase:
What Is a Network Community?: A Novel Quality Function and Detection Algorithms. CIKM 2015: 1471-1480 - [c1]Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura:
Threshold Influence Model for Allocating Advertising Budgets. ICML 2015: 1395-1404 - [i3]Atsushi Miyauchi, Yasushi Kawase:
Z-score-based modularity for community detection in networks. CoRR abs/1501.01909 (2015) - 2014
- [j2]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. 114(12): 706-709 (2014) - [i2]Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi:
Fractional programming formulation for the vertex coloring problem. CoRR abs/1402.5769 (2014) - 2013
- [j1]Noriyoshi Sukegawa, Atsushi Miyauchi:
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. 10(4): 331-332 (2013) - [i1]Atsushi Miyauchi, Noriyoshi Sukegawa:
Maximizing Barber's bipartite modularity is also hard. CoRR abs/1310.4656 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
