| Finding diverse trees, paths, and more T Hanaka, Y Kobayashi, K Kurita, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3778-3786, 2021 | 34 | 2021 |
| Computing diverse shortest paths efficiently: A theoretical and experimental study T Hanaka, Y Kobayashi, K Kurita, SW Lee, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3758-3766, 2022 | 27 | 2022 |
| A framework to design approximation algorithms for finding diverse solutions in combinatorial problems T Hanaka, M Kiyomi, Y Kobayashi, Y Kobayashi, K Kurita, Y Otachi Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 3968-3976, 2023 | 22 | 2023 |
| Efficient enumeration of induced matchings in a graph without cycles with length four K Kurita, K Wasa, T Uno, H Arimura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2018 | 13 | 2018 |
| Efficient enumeration of dominating sets for sparse graphs K Kurita, K Wasa, H Arimura, T Uno Discrete Applied Mathematics 303, 283-295, 2021 | 12 | 2021 |
| Optimal LZ-end parsing is hard H Bannai, M Funakoshi, K Kurita, Y Nakashima, K Seto, T Uno arXiv preprint arXiv:2302.02586, 2023 | 7 | 2023 |
| Polynomial-delay and polynomial-space enumeration of large maximal matchings Y Kobayashi, K Kurita, K Wasa International Workshop on Graph-Theoretic Concepts in Computer Science, 342-355, 2022 | 7 | 2022 |
| Efficient enumerations for minimal multicuts and multiway cuts K Kurita, Y Kobayashi arXiv preprint arXiv:2006.16222, 2020 | 7 | 2020 |
| Linear-delay enumeration for minimal steiner problems Y Kobayashi, K Kurita, K Wasa Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022 | 6 | 2022 |
| Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with cardinality constraints Y Kobayashi, K Kurita, K Wasa arXiv preprint arXiv:2009.08830, 72, 2020 | 6 | 2020 |
| An improved deterministic parameterized algorithm for cactus vertex deletion Y Aoike, T Gima, T Hanaka, M Kiyomi, Y Kobayashi, Y Kobayashi, ... Theory of Computing Systems 66 (2), 502-515, 2022 | 5 | 2022 |
| Enumeration of enumeration algorithms and its complexity K Wasa, K Kurita | 5 | 2019 |
| A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number K Kurita, K Wasa, T Uno, H Arimura Theoretical Computer Science 874, 32-41, 2021 | 4 | 2021 |
| Finding the anticover of a string M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, K Kurita, ... 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2: 1-2: 11, 2020 | 4 | 2020 |
| Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs A Conte, K Kurita, K Wasa, T Uno Combinatorial Optimization and Applications: 11th International Conference …, 2017 | 4 | 2017 |
| Constant amortized time enumeration of Eulerian trails K Kurita, K Wasa Theoretical Computer Science 923, 1-12, 2022 | 3 | 2022 |
| Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints Y Kobayashi, K Kurita, K Wasa arXiv preprint arXiv:2009.08830, 2020 | 3 | 2020 |
| Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond Y Kobayashi, K Kurita, K Wasa Information and Computation, 105282, 2025 | 2 | 2025 |
| Polynomial-delay enumeration of large maximal matchings Y Kobayashi, K Kurita, K Wasa arXiv preprint arXiv:2105.04146, 2021 | 2 | 2021 |
| Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints Y Kobayashi, K Kurita, K Mann, Y Matsui, H Ono Algorithms 18 (2), 112, 2025 | 1 | 2025 |
Kunihiro WasaHosei UniversityZweryfikowany adres z hosei.ac.jp
