Yu Nakahata

Orcid: 0000-0002-8947-0994

According to our database¹, Yu Nakahata authored at least 13 papers between 2018 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Reconfiguring (non-spanning) arborescences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022

Independent Set Reconfiguration on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Studies on Implicit Graph Enumeration Using Decision Diagrams.

[BibT_eX]

[DOI]

Yu Nakahata

PhD thesis, 2021

Reconfiguring Directed Trees in a Digraph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

A Note on Exponential-Time Algorithms for Linearwidth.

[BibT_eX]

[DOI]

Yasuaki Kobayashi

Yu Nakahata

CoRR, 2020

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019

On the Clique-Width of Unigraphs.

[BibT_eX]

[DOI]

Yu Nakahata

CoRR, 2019

Decomposing a Graph into Unigraphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.

[BibT_eX]

[DOI]

Yu Nakahata

Jun Kawahara

Shoji Kasahara

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Yu Nakahata

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...