Yuta Nozaki

26 papers A* 5B 1C 2Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
SIAM J. Discret. Math.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026 J jnl
Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free.
Eur. J. Comb.
Soichiro Fujii, Kei Kimura, Yuta Nozaki
2025 — conf
Efficient Vocabulary Reduction for Small Language Models.
COLING (Industry)
Yuta Nozaki, Dai Nakashima, Ryo Sato, Naoki Asaba, Shintaro Kawamura
2025 J jnl
Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles.
J. Appl. Comput. Topol.
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Yuta Nozaki, Akira Suzuki
2025 J jnl
Reconfiguration and enumeration of optimal cyclic ladder lotteries.
Theor. Comput. Sci.
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2025 J jnl
Reconfiguration of colorings in triangulations of the sphere.
J. Comput. Geom.
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
Reforming an Envy-Free Matching.
Algorithmica
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
Rerouting Planar Curves and Disjoint Paths.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 — conf
VRCP: Vocabulary Replacement Continued Pretraining for Efficient Multilingual Language Models.
COLING Workshops
Yuta Nozaki, Dai Nakashima, Ryo Sato, Naoki Asaba, Shintaro Kawamura
2024 J jnl
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.
CoRR
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2023 A* conf
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
ICALP
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 J jnl
On reachable assignments under dichotomous preferences.
Theor. Comput. Sci.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 C conf
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.
IWOCA
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2023 A* conf
Reconfiguration of Colorings in Triangulations of the Sphere.
SoCG
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 A* conf
Rerouting Planar Curves and Disjoint Paths.
ICALP
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 A* conf
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
SODA
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 B conf
On Reachable Assignments Under Dichotomous Preferences.
PRIMA
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
On Reachable Assignments under Dichotomous Preferences.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Reconfiguration of colorings in triangulations of the sphere.
CoRR
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 A* conf
Reforming an Envy-Free Matching.
AAAI
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Reforming an Envy-Free Matching.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Rerouting Planar Curves and Disjoint Paths.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 C conf
Tweet Review Mining focusing on Celebrities by Machine Reading Comprehension based on BERT.
PACLIC
Yuta Nozaki, Kotoe Sugawara, Yuki Zenimoto, Takehito Utsuro
2021 J jnl
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki