default search action
Yu Nakahata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j2]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi
, Yu Nakahata
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - [c6]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - 2022
- [c5]Takehiro Ito
Independent Set Reconfiguration on Directed Graphs. MFCS 2022: 58:1-58:15 - [i9]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent set reconfiguration on directed graphs. CoRR abs/2203.13435 (2022) - [i8]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - 2021
- [b1]Yu Nakahata:
Studies on Implicit Graph Enumeration Using Decision Diagrams. Kyoto University, Japan, 2021 - [c4]Takehiro Ito
Reconfiguring Directed Trees in a Digraph. COCOON 2021: 343-354 - [i7]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. CoRR abs/2107.03092 (2021) - 2020
- [c3]Yu Nakahata
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. WALCOM 2020: 211-222 - [c2]Yu Nakahata
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. SEA 2020: 9:1-9:14 - [i6]Yu Nakahata
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. CoRR abs/2001.08899 (2020) - [i5]Yasuaki Kobayashi, Yu Nakahata:
A Note on Exponential-Time Algorithms for Linearwidth. CoRR abs/2010.02388 (2020)
2010 – 2019
- 2019
- [i4]Takashi Horiyama, Jun Kawahara, Shin-ichi Minato, Yu Nakahata
Decomposing a Graph into Unigraphs. CoRR abs/1904.09438 (2019) - [i3]Yu Nakahata
On the Clique-Width of Unigraphs. CoRR abs/1905.12461 (2019) - [i2]Yu Nakahata
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration. CoRR abs/1911.07465 (2019) - 2018
- [j1]Yu Nakahata
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1363-1374 (2018) - [c1]Yu Nakahata
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. SEA 2018: 21:1-21:13 - [i1]Yu Nakahata
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams. CoRR abs/1804.02160 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: