( en | de | ru )

 

Disambiguation of "Nagao, Atsuki"

Author of the publication

copydeleteadd this publication to your clipboard
K3 Edge Cover Problem in a Wide Sense.

, , , , , and . J. Inf. Process., (2020)

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.

No persons found for author name Nagao, Atsuki
add a person with the name Nagao, Atsuki
 

Other publications of authors with the same name

Read-Once Branching Programs for Tree Evaluation Problems., and . ACM Trans. Comput. Theory, 11 (1): 5:1-5:12 (2019)Efficient Algorithms for Sorting k-Sets in Bins., , and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 225-236. Springer, (2014)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 215-226. Springer, (2016)Satisfiability Algorithm for Syntactic Read-k-times Branching Programs., , and . Theory Comput. Syst., 64 (8): 1392-1407 (2020)K3 Edge Cover Problem in a Wide Sense., , , , , and . J. Inf. Process., (2020)Efficient Algorithms for Sorting k-Sets in Bins., , and . IEICE Trans. Inf. Syst., 98-D (10): 1736-1743 (2015)A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments., , , , and . J. Inf. Process., (2017)Light Cryptography., , , and . World Conference on Information Security Education, volume 557 of IFIP Advances in Information and Communication Technology, page 89-101. Springer, (2019)Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems.. Kyoto University, Japan, (2015)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 554-565. Springer, (2015)