Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. - Yu Nakahata; Jun Kawahara; Shoji Kasahara (SEA, 2018)

Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. - Yu Nakahata; Jun Kawahara; Takashi Horiyama; Shoji Kasahara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Decomposing a Graph into Unigraphs. - Takashi Horiyama; Jun Kawahara; Shin-ichi Minato; Yu Nakahata (CoRR, 2019)

On the Clique-Width of Unigraphs. - Yu Nakahata (CoRR, 2019)

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. - Yu Nakahata; Jun Kawahara; Takashi Horiyama; Shin-ichi Minato (WALCOM, 2020)

Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. - Yu Nakahata; Masaaki Nishino; Jun Kawahara; Shin-ichi Minato (SEA, 2020)

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. - Yu Nakahata; Takashi Horiyama; Shin-ichi Minato; Katsuhisa Yamanaka (CoRR, 2020)

A Note on Exponential-Time Algorithms for Linearwidth. - Yasuaki Kobayashi; Yu Nakahata (CoRR, 2020)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

Studies on Implicit Graph Enumeration Using Decision Diagrams. - Yu Nakahata (2021)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 2023)

Reconfiguring Multiple Connected Components with Size Multiset Constraints. - Yu Nakahata (COCOON (2), 2025)

Computing Time-varying Network Reliability using Binary Decision Diagrams. - Yu Nakahata; Shun Arizono; Shoji Kasahara (CoRR, 2025)