default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuko Kuroki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Yuko Kuroki, Tomomi Matsui:
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case. Discret. Appl. Math. 349: 201-214 (2024)- 2020
- [j2]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) - 2019
- [j1]Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. J. Graph Algorithms Appl. 23(1): 93-110 (2019)
Conference and Workshop Papers
- 2024
- [c8]Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. AISTATS 2024: 1216-1224 - 2023
- [c7]Yihan Du, Wei Chen, Yuko Kuroki, Longbo Huang:
Collaborative Pure Exploration in Kernel Bandit. ICLR 2023 - 2021
- [c6]Yihan Du, Yuko Kuroki, Wei Chen:
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback. AAAI 2021: 7262-7270 - [c5]Yihan Du, Yuko Kuroki, Wei Chen:
Combinatorial Pure Exploration with Bottleneck Reward Function. NeurIPS 2021: 23956-23967 - 2020
- [c4]Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. ICML 2020: 5522-5532 - 2019
- [c3]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. IJCAI 2019: 1272-1279 - [c2]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) 2019: 568-582 - 2017
- [c1]Yuko Kuroki, Tomomi Matsui
:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. WALCOM 2017: 397-408
Informal and Other Publications
- 2024
- [i13]Yuko Kuroki, Atsushi Miyauchi, Francesco Bonchi, Wei Chen:
Query-Efficient Correlation Clustering with Noisy Oracle. CoRR abs/2402.01400 (2024) - 2023
- [i12]Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. CoRR abs/2312.15433 (2023) - 2022
- [i11]Motoya Ohnishi, Isao Ishikawa, Yuko Kuroki, Masahiro Ikeda:
Dynamic Structure Estimation from Bandit Feedback. CoRR abs/2206.00861 (2022) - 2021
- [i10]Yihan Du, Yuko Kuroki, Wei Chen:
Combinatorial Pure Exploration with Bottleneck Reward Function and its Extension to General Reward Functions. CoRR abs/2102.12094 (2021) - [i9]Yihan Du, Wei Chen, Yuko Kuroki, Longbo Huang:
Collaborative Pure Exploration in Kernel Bandit. CoRR abs/2110.15771 (2021) - 2020
- [i8]Wei Chen, Yihan Du, Yuko Kuroki:
Combinatorial Pure Exploration with Partial or Full-Bandit Linear Feedback. CoRR abs/2006.07905 (2020) - [i7]Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama:
Online Dense Subgraph Discovery via Blurred-Graph Feedback. CoRR abs/2006.13642 (2020) - [i6]Yuko Kuroki, Junya Honda, Masashi Sugiyama:
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation. CoRR abs/2012.15584 (2020) - 2019
- [i5]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) - [i4]Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi:
Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. CoRR abs/1905.08088 (2019) - [i3]Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi:
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR abs/1906.05998 (2019) - 2018
- [i2]Yuko Kuroki, Tomomi Matsui:
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case. CoRR abs/1803.06114 (2018) - 2016
- [i1]Yuko Kuroki, Tomomi Matsui:
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. CoRR abs/1612.02990 (2016)
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-07-25 20: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:
