Atsuki Nagao

20 papers A 1B 3C 1Misc 2Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Meta Theorem for Hardness on FCP-Problem.
CoRR
Atsuki Nagao, Mei Sekiguchi
2024 J jnl
On the complexity of finding a spanning even tree in a graph.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2022 J jnl
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama
2022 — conf
Algorithms for Burning Schedule Reconfiguration Problem on Path Forests.
JCDCGGG
Atsuki Nagao, Sawako Ogawa
2021 Misc conf
Card-Based ZKP Protocols for Takuzu and Juosan.
FUN
Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone
2020 J jnl
Feedback game on Eulerian graphs.
CoRR
Naoki Matsumoto, Atsuki Nagao
2020 J jnl
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
Theory Comput. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2019 J jnl
Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiro Ito, Atsuki Nagao, Teagun Park
2019 — conf
Light Cryptography.
World Conference on Information Security Education
Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa
2019 J jnl
Read-Once Branching Programs for Tree Evaluation Problems.
ACM Trans. Comput. Theory
Kazuo Iwama, Atsuki Nagao
2018 J jnl
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
Algorithmica
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2018 C conf
Physical Zero-Knowledge Proof for Makaro.
SSS
Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone
2017 J jnl
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.
J. Inf. Process.
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2017 B conf
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.
ISAAC
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2016 Misc conf
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
FAW
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2015 B conf
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
WADS
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015 — —
Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems.
Atsuki Nagao
2015 J jnl
Efficient Algorithms for Sorting
IEICE Trans. Inf. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2014 B conf
Efficient Algorithms for Sorting k-Sets in Bins.
WALCOM
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2014 A conf
Read-Once Branching Programs for Tree Evaluation Problems.
STACS
Kazuo Iwama, Atsuki Nagao