| Enumeration of enumeration algorithms K Wasa arXiv preprint arXiv:1605.05102, 2016 | 53 | 2016 |
| CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration R Shibukawa, S Ishida, K Yoshizoe, K Wasa, K Takasu, Y Okuno, ... Journal of cheminformatics 12, 1-14, 2020 | 34 | 2020 |
| Exact algorithms for the max-min dispersion problem T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ... International Workshop on Frontiers in Algorithmics, 263-272, 2018 | 32 | 2018 |
| Efficient enumeration of induced subtrees in a K-degenerate graph K Wasa, H Arimura, T Uno International Symposium on Algorithms and Computation, 94-102, 2014 | 32 | 2014 |
| The perfect matching reconfiguration problem M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ... arXiv preprint arXiv:1904.06184, 2019 | 28 | 2019 |
| Constant time enumeration of bounded-size subtrees in trees and its application K Wasa, Y Kaneta, T Uno, H Arimura Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 21 | 2012 |
| Reconfiguration of spanning trees with many or few leaves N Bousquet, T Ito, Y Kobayashi, H Mizuta, P Ouvrard, A Suzuki, K Wasa arXiv preprint arXiv:2006.14309, 2020 | 15 | 2020 |
| 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 |
| Diameter of colorings under Kempe changes M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M Mühlenthaler, ... Theoretical Computer Science 838, 45-57, 2020 | 12 | 2020 |
| Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph A Conte, MM Kanté, Y Otachi, T Uno, K Wasa International Computing and Combinatorics Conference, 150-161, 2017 | 12 | 2017 |
| Reconfiguration of spanning trees with degree constraints or diameter constraints N Bousquet, T Ito, Y Kobayashi, H Mizuta, P Ouvrard, A Suzuki, K Wasa Algorithmica 85 (9), 2779-2816, 2023 | 11 | 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 | 11 | 2018 |
| Max-min 3-dispersion problems T Horiyama, S Nakano, T Saitoh, K Suetsugu, A Suzuki, R Uehara, T Uno, ... IEICE Transactions on Fundamentals of Electronics, Communications and …, 2021 | 9 | 2021 |
| Shortest reconfiguration of colorings under Kempe changes M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M Mühlenthaler, ... 37th International Symposium on Theoretical Aspects of Computer Science …, 2020 | 8 | 2020 |
| Efficient enumeration of bipartite subgraphs in graphs K Wasa, T Uno International Computing and Combinatorics Conference, 454-466, 2018 | 8 | 2018 |
| Reconfiguring (non-spanning) arborescences T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, K Wasa Theoretical Computer Science 943, 131-141, 2023 | 6 | 2023 |
| Independent set reconfiguration on directed graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, M Takahashi, ... arXiv preprint arXiv:2203.13435, 2022 | 6 | 2022 |
| The complexity of induced tree reconfiguration problems K Wasa, K Yamanaka, H Arimura Language and Automata Theory and Applications: 10th International Conference …, 2016 | 6 | 2016 |
| Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph K Wasa, T Uno, K Hirata, H Arimura International Conference on Discovery Science, 308-323, 2013 | 6 | 2013 |
| 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 | 5 | 2022 |
Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
