| 2026 | COLT | Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs. | Nicol Cesa-Bianchi, Junya Honda, Yuko Kuroki, Atsushi Miyauchi, Lukas Zierahn |
| 2025 | IJCAI | Minimizing Polarization and Disagreement in the Friedkin-Johnsen Model with Unknown Innate Opinions. | Federico Cinus, Atsushi Miyauchi, Yuko Kuroki, Francesco Bonchi |
| 2024 | AISTATS | Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. | Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicol Cesa-Bianchi |
| 2023 | ICLR | Collaborative Pure Exploration in Kernel Bandit. | Yihan Du, Wei Chen, Yuko Kuroki, Longbo Huang |
| 2021 | AAAI | Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback. | Yihan Du, Yuko Kuroki, Wei Chen |
| 2020 | ICML | Online Dense Subgraph Discovery via Blurred-Graph Feedback. | Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama |
| 2019 | IJCAI | Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation. | Yasushi Kawase, Yuko Kuroki, Atsushi Miyauchi |
| 2019 | PRICAI | Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. | Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi |
| 2017 | WALCOM | Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. | Yuko Kuroki, Tomomi Matsui |