Yu Nakahata

23 papers B 5Misc 1Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Independent Set Reconfiguration on Directed Graphs.
SIAM J. Discret. Math.
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2025 J jnl
Computing Time-varying Network Reliability using Binary Decision Diagrams.
CoRR
Yu Nakahata, Shun Arizono, Shoji Kasahara
2025 — conf
Reconfiguring Multiple Connected Components with Size Multiset Constraints.
COCOON (2)
Yu Nakahata
2025 J jnl
Reconfiguring Multiple Connected Components with Size Multiset Constraints.
CoRR
Yu Nakahata
2025 — conf
zkSABER: Zero-knowledge Succinct Authentication using Biometric Embedding Representation.
BRAINS
Tomoki Chinen, Christopher Wiraatmaja, Yu Nakahata, Takanori Hara, Shoji Kasahara
2023 J jnl
Reconfiguring (non-spanning) arborescences.
Theor. Comput. Sci.
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2023 B conf
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CPAIOR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2022 B conf
Independent Set Reconfiguration on Directed Graphs.
MFCS
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022 J jnl
Independent set reconfiguration on directed graphs.
CoRR
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022 J jnl
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CoRR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2021 Misc conf
Reconfiguring Directed Trees in a Digraph.
COCOON
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021 J jnl
Reconfiguring Directed Trees in a Digraph.
CoRR
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021 — —
Studies on Implicit Graph Enumeration Using Decision Diagrams.
Yu Nakahata
2020 J jnl
A Note on Exponential-Time Algorithms for Linearwidth.
CoRR
Yasuaki Kobayashi, Yu Nakahata
2020 J jnl
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.
CoRR
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka
2020 B conf
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams.
SEA
Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato
2020 B conf
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.
WALCOM
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
2019 J jnl
Decomposing a Graph into Unigraphs.
CoRR
Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata
2019 J jnl
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.
CoRR
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
2019 J jnl
On the Clique-Width of Unigraphs.
CoRR
Yu Nakahata
2018 J jnl
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara
2018 B conf
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.
SEA
Yu Nakahata, Jun Kawahara, Shoji Kasahara
2018 J jnl
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.
CoRR
Yu Nakahata, Jun Kawahara, Shoji Kasahara