( en | de | ru )

 

Disambiguation of "Nakahata, Yu"

Author of the publication

copydeleteadd this publication to your clipboard
On the Clique-Width of Unigraphs.

. CoRR, (2019)

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)

Yu Chen

Na Yu

 

Other publications of authors with the same name

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)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)Reconfiguring Directed Trees in a Digraph., , , , , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 343-354. Springer, (2021)Independent Set Reconfiguration on Directed Graphs., , , , , , and . MFCS, volume 241 of LIPIcs, page 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Clique-Width of Unigraphs.. CoRR, (2019)Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams., , and . SEA, volume 103 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems., , , , , , and . CPAIOR, volume 13884 of Lecture Notes in Computer Science, page 167-183. Springer, (2023)Studies on Implicit Graph Enumeration Using Decision Diagrams.. Kyoto University, Japan, (2021)Decomposing a Graph into Unigraphs., , , and . CoRR, (2019)