| ZDD-based algorithmic framework for solving shortest reconfiguration problems T Ito, J Kawahara, Y Nakahata, T Soh, A Suzuki, J Teruyama, T Toda International Conference on Integration of Constraint Programming …, 2023 | 7 | 2023 |
| Enumerating all spanning shortest path forests with distance and capacity constraints Y Nakahata, J Kawahara, T Horiyama, S Kasahara IEICE Transactions on Fundamentals of Electronics, Communications and …, 2018 | 6 | 2018 |
| Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams Y Nakahata, J Kawahara, S Kasahara arXiv preprint arXiv:1804.02160, 2018 | 6 | 2018 |
| Independent set reconfiguration on directed graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, M Takahashi, ... arXiv preprint arXiv:2203.13435, 2022 | 4 | 2022 |
| Reconfiguring directed trees in a digraph T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, K Wasa International Computing and Combinatorics Conference, 343-354, 2021 | 4 | 2021 |
| Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration Y Nakahata, J Kawahara, T Horiyama, S Minato International Workshop on Algorithms and Computation, 211-222, 2020 | 4 | 2020 |
| Compiling crossing-free geometric graphs with connectivity constraint for fast enumeration, random sampling, and optimization Y Nakahata, T Horiyama, S Minato, K Yamanaka arXiv preprint arXiv:2001.08899, 2020 | 4 | 2020 |
| Reconfiguring (non-spanning) arborescences T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, Y Otachi, K Wasa Theoretical Computer Science 943, 131-141, 2023 | 3 | 2023 |
| A Note on Exponential-Time Algorithms for Linearwidth Y Kobayashi, Y Nakahata arXiv preprint arXiv:2010.02388, 2020 | 3 | 2020 |
| Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams Y Nakahata, M Nishino, J Kawahara, S Minato 18th International Symposium on Experimental Algorithms (SEA 2020), 2020 | 2 | 2020 |
| Decomposing a graph into unigraphs T Horiyama, J Kawahara, S Minato, Y Nakahata arXiv preprint arXiv:1904.09438, 2019 | 2 | 2019 |
| Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs S Denzumi, T Horiyama, K Kurita, Y Nakahata, H Suzuki, K Wasa, ... IEICE Technical Report; IEICE Tech. Rep. 118 (216), 55-62, 2018 | 1 | 2018 |
| Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming Y Nakahata IEICE Technical Report; IEICE Tech. Rep. 121 (407), 26-30, 2022 | | 2022 |
| Token Sliding on Directed Graphs T Ito, Y Iwamasa, Y Kobayashi, Y Nakahata, M Takahashi, Y Otachi, ... IEICE Technical Report; IEICE Tech. Rep. 121 (285), 11-18, 2021 | | 2021 |
| Studies on Implicit Graph Enumeration Using Decision Diagrams Y Nakahata Kyoto University, 2021 | | 2021 |
| On the Clique-Width of Unigraphs Y Nakahata arXiv preprint arXiv:1905.12461, 2019 | | 2019 |
| Enumerating and Indexing Constrained Graph Partitions Using Decision Diagrams Y Nakahata | | 2018 |
Jun KawaharaKyoto UniversityVerified email at i.kyoto-u.ac.jp
