Research Output per year

## Fingerprint Dive into the research topics where Akitoshi Kawamura is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

Polynomials
Engineering & Materials Science

Complexity Theory
Mathematics

Computability
Mathematics

Computational complexity
Engineering & Materials Science

Computational Complexity
Mathematics

Polynomial time
Mathematics

Computable Analysis
Mathematics

Fences
Engineering & Materials Science

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2005 2019

### A lower bound on opaque sets

Kawamura, A., Moriyama, S., Otachi, Y. & Pach, J., Jul 2019, In : Computational Geometry: Theory and Applications. 80, p. 13-22 10 p.Research output: Contribution to journal › Article

Intersect

Straight Line

Convex Sets

Triangle

Union

### Second-order linear-time computability with applications to computable analysis

Kawamura, A., Steinberg, F. & Thies, H., Jan 1 2019,*Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Proceedings.*Watada, J. & Gopal, T. V. (eds.). Springer Verlag, p. 337-358 22 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11436 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Computable Analysis

Computability

Linear Time

Costs

Complexity Classes

### Sequentially swapping colored tokens on graphs

Yamanaka, K., Demaine, E. D., Horiyama, T., Kawamura, A., Nakano, S. I., Okamoto, Y., Saitoh, T., Suzuki, A., Uehara, R. & Uno, T., Jan 1 2019, In : Journal of Graph Algorithms and Applications. 23, 1, p. 3-27 25 p.Research output: Contribution to journal › Article

Path

Graph in graph theory

Vertex of a graph

Distinct

Target

1
Citation
(Scopus)

### Average-case polynomial-time computability of hamiltonian dynamics

Kawamura, A., Thies, H. & Ziegler, M., Aug 1 2018,*43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018.*Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hamiltonians

Trajectories

Polynomials

Computational complexity

Dynamical systems

### On characterizations of randomized computation using plain Kolmogorov complexity

Hirahara, S. & Kawamura, A., Jan 1 2018, In : Bladder Cancer. 4, 1, p. 45-56 12 p.Research output: Contribution to journal › Article

Language

2-bromo-3-phenylpropionic acid