Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Atsushi Miyauchi 0001
CENTAI Institute, Turin, Italy - Atsushi Miyauchi 0002
Research Organization for Information Science and Technology (RIST), Kobe, Japan
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 61 matches
- 2024
- Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen:
Query-Efficient Correlation Clustering with Noisy Oracle. CoRR abs/2402.01400 (2024) - Atsushi Miyauchi, Lorenzo Severini, Francesco Bonchi:
Local Centrality Minimization with Quality Guarantees. CoRR abs/2402.07718 (2024) - 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) - 2023
- 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) - 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 - Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM 2023: 886-894 - Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi:
A Survey on the Densest Subgraph Problem and its Variants. CoRR abs/2303.14467 (2023) - 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
- Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger cuts in hypergraphs via heat equation. Theor. Comput. Sci. 930: 1-23 (2022) - 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 - Issey Sukeda, Atsushi Miyauchi, Akiko Takeda:
A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis. CoRR abs/2206.10901 (2022) - Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita:
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR abs/2211.03306 (2022) - 2021
- Hikaru Takeuchi, Yasuyuki Taki, Rui Nouchi, Ryoichi Yokoyama, Yuka Kotozaki, Seishu Nakagawa, Atsushi Sekiguchi, Kunio Iizuka, Sugiko Hanawa, Tsuyoshi Araki, Carlos Makoto Miyauchi, Kohei Sakaki, Yuko Sassa, Takayuki Nozawa, Shigeyuki Ikeda, Susumu Yokota, Daniele Magistro, Ryuta Kawashima:
General Intelligence Is Associated with Working Memory-Related Functional Connectivity Change: Evidence from a Large-Sample Study. Brain Connect. 11(2): 89-102 (2021) - Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding densest k-connected subgraphs. Discret. Appl. Math. 305: 34-47 (2021) - Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi:
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117: 182-201 (2021) - 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 - 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) - 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
- Satya Nanda Vel Arjunan, Atsushi Miyauchi, Kazunari Iwamoto, Koichi Takahashi:
pSpatiocyte: a high-performance simulator for intracellular reaction-diffusion systems. BMC Bioinform. 21(1): 33 (2020) - 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) - Hikaru Takeuchi, Yasuyuki Taki, Rui Nouchi, Ryoichi Yokoyama, Yuka Kotozaki, Seishu Nakagawa, Atsushi Sekiguchi, Kunio Iizuka, Sugiko Hanawa, Tsuyoshi Araki, Carlos Makoto Miyauchi, Kohei Sakaki, Yuko Sassa, Takayuki Nozawa, Shigeyuki Ikeda, Susumu Yokota, Daniele Magistro, Ryuta Kawashima:
Originality of divergent thinking is associated with working memory-related brain activity: Evidence from a large sample study. NeuroImage 216: 116825 (2020) - Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML 2020: 5522-5532 - Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. KDD 2020: 1970-1978 - Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. CoRR abs/2006.08302 (2020) - Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR abs/2006.13642 (2020) - Francesco Bonchi, David García-Soriano, Atsushi Miyauchi, Charalampos E. Tsourakakis:
Finding Densest k-Connected Subgraphs. CoRR abs/2007.01533 (2020) - 2019
- Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI 2019: 1272-1279 - Aoi Shinjo, Atsushi Saito, Tetsuya Takakuwa, Shigehito Yamada, Hidekata Hontani, Hiroshi Matsuzoe, Shoko Miyauchi, Ken'ichi Morooka, Akinobu Shimizu:
Spatiotemporal Statistical Model of Anatomical Landmarks on a Human Embryonic Brain. UNSURE/CLIP@MICCAI 2019: 94-103 - 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) - Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR abs/1905.08088 (2019)
skipping 31 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-08 02:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint