( en | de | ru )

 

Disambiguation of "Nakahata, Yu"

Author of the publication

copydeleteadd this publication to your clipboard
Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams.

, , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yu-Ting Yu

Yu-Yu Su

Sze-Man Yu

Metal complexes with enolatoimine ligands for controlled olefin polymerizations. Uni Konstanz, (2009)

Xin Yu

Yu Chen

 

Other publications of authors with the same name

A Note on Exponential-Time Algorithms for Linearwidth., and . CoRR, (2020)ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems., , , , , , and . CoRR, (2022)Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration., , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 211-222. Springer, (2020)Reconfiguring (non-spanning) arborescences., , , , , and . Theor. Comput. Sci., (2023)Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization., , , and . CoRR, (2020)Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams., , and . CoRR, (2018)On the Clique-Width of Unigraphs.. CoRR, (2019)ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems., , , , , , and . CPAIOR, volume 13884 of Lecture Notes in Computer Science, page 167-183. Springer, (2023)Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams., , , and . SEA, volume 160 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration., , , and . CoRR, (2019)