We stand with Ukraine  

Atsuki Nagao

Orcid: 0000-0002-1370-5240

Affiliations:
  • University of Electro-Communications, Chofu, Department of Information and Communication Engineering, Japan
  • Kyoto University, Graduate School of Informatics, Japan


According to our database1, Atsuki Nagao authored at least 16 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of finding a spanning even tree in a graph.
[BibTeX]
[DOI]
Tesshu Hanaka
,
Yasuaki Kobayashi
,
Kazuhiro Kurita
,
Yasuko Matsui
,
Atsuki Nagao
,
Hirotaka Ono
,
Kazuhisa Seto
CoRR, 2024

2022
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.
[BibTeX]
[DOI]
Tomu Makita
,
Atsuki Nagao
,
Tatsuki Okada
,
Kazuhisa Seto
,
Junichi Teruyama
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

2021
Card-Based ZKP Protocols for Takuzu and Juosan.
[BibTeX]
[DOI]
Daiki Miyahara
,
Léo Robert
,
Pascal Lafourcade
,
So Takeshige
,
Takaaki Mizuki
,
Kazumasa Shinagawa
,
Atsuki Nagao
,
Hideaki Sone
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
[BibTeX]
[DOI]
Atsuki Nagao
,
Kazuhisa Seto
,
Junichi Teruyama
Theory Comput. Syst., 2020

<i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense.
[BibTeX]
[DOI]
Kyohei Chiba
,
Rémy Belmonte
,
Hiro Ito
,
Michael Lampis
,
Atsuki Nagao
,
Yota Otachi
J. Inf. Process., 2020

Feedback game on Eulerian graphs.
[BibTeX]
[DOI]
Naoki Matsumoto
,
Atsuki Nagao
CoRR, 2020

2019
Read-Once Branching Programs for Tree Evaluation Problems.
[BibTeX]
[DOI]
Kazuo Iwama
,
Atsuki Nagao
ACM Trans. Comput. Theory, 2019

Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable.
[BibTeX]
[DOI]
Hiro Ito
,
Atsuki Nagao
,
Teagun Park
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Light Cryptography.
[BibTeX]
[DOI]
Pascal Lafourcade
,
Takaaki Mizuki
,
Atsuki Nagao
,
Kazumasa Shinagawa
Proceedings of the Information Security Education. Education in Proactive Information Security, 2019

2018
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
[BibTeX]
[DOI]
Atsuki Nagao
,
Kazuhisa Seto
,
Junichi Teruyama
Algorithmica, 2018

Physical Zero-Knowledge Proof for Makaro.
[BibTeX]
[DOI]
Xavier Bultel
,
Jannik Dreier
,
Jean-Guillaume Dumas
,
Pascal Lafourcade
,
Daiki Miyahara
,
Takaaki Mizuki
,
Atsuki Nagao
,
Tatsuya Sasaki
,
Kazumasa Shinagawa
,
Hideaki Sone
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2017
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.
[BibTeX]
[DOI]
Etsuji Tomita
,
Sora Matsuzaki
,
Atsuki Nagao
,
Hiro Ito
,
Mitsuo Wakatsuki
J. Inf. Process., 2017

2016
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
[BibTeX]
[DOI]
Etsuji Tomita
,
Kohei Yoshida
,
Takuro Hatta
,
Atsuki Nagao
,
Hiro Ito
,
Mitsuo Wakatsuki
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
Computational Complexity of Tree Evaluation Problems and Branching Program Satisfiability Problems.
[BibTeX]
[DOI]
Atsuki Nagao
PhD thesis, 2015

Efficient Algorithms for Sorting <i>k</i>-Sets in Bins.
[BibTeX]
[DOI]
Atsuki Nagao
,
Kazuhisa Seto
,
Junichi Teruyama
IEICE Trans. Inf. Syst., 2015

2014
Efficient Algorithms for Sorting k-Sets in Bins.
[BibTeX]
[DOI]
Atsuki Nagao
,
Kazuhisa Seto
,
Junichi Teruyama
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014


  Loading...