| 2026 | AAAI | Finding One Local Optimum Is Easy - but What About Two? | Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi |
| 2026 | WALCOM | Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff |
| 2026 | WALCOM | On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs. | Kazuhiro Kurita, Kevin Mann |
| 2025 | WADS | On the Complexity of Minimising the Moving Distance for Dispersing Objects. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | FAW | Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | IWOCA | Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. | Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono |
| 2024 | WALCOM | Dichotomies for Tree Minor Containment with Structural Parameters. | Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi |
| 2023 | AAAI | A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. | Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2023 | CPM | Optimal LZ-End Parsing Is Hard. | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | MFCS | Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | AAAI | Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi |
| 2022 | PODS | Linear-Delay Enumeration for Minimal Steiner Problems. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | WG | Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2021 | AAAI | Finding Diverse Trees, Paths, and More. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2020 | CPM | Finding the Anticover of a String. | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
| 2020 | MFCS | Efficient Enumerations for Minimal Multicuts and Multiway Cuts. | Kazuhiro Kurita, Yasuaki Kobayashi |
| 2019 | IWOCA | An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
| 2018 | ISAAC | Efficient Enumeration of Dominating Sets for Sparse Graphs. | Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2018 | IWOCA | Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
| 2017 | COCOA | Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. | Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno |