Type-2 Computability and Moore's Recursive Functions. - Akitoshi Kawamura (CCA, 2004)

Differential Recursion and Differentially Algebraic Functions - Akitoshi Kawamura (CoRR, 2007)

Differential recursion. - Akitoshi Kawamura (ACM Trans. Comput. Log., 2009)

Distance k-sectors exist. - Keiko Imai; Akitoshi Kawamura; Jirí Matousek 001; Daniel Reem; Takeshi Tokuyama (SCG, 2010)

Zone diagrams in Euclidean spaces and in other normed spaces. - Akitoshi Kawamura; Jirí Matousek 001; Takeshi Tokuyama (SCG, 2010)

Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. - Akitoshi Kawamura (Comput. Complex., 2010)

Distance k-sectors exist. - Keiko Imai; Akitoshi Kawamura; Jirí Matousek 001; Daniel Reem; Takeshi Tokuyama (Comput. Geom., 2010)

VC Dimensions of Principal Component Analysis. - Yohji Akama; Kei Irie; Akitoshi Kawamura; Yasutaka Uwano (Discret. Comput. Geom., 2010)

Generalized Semimagic Squares for Digital Halftoning. - Akitoshi Kawamura (Theory Comput. Syst., 2011)

Computational Complexity in Analysis and Geometry. - Akitoshi Kawamura (2011)

Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime - Akitoshi Kawamura; Norbert Th. Müller; Carsten Rösnick; Martin Ziegler 001 (CoRR, 2012)

Complexity Theory for Operators in Analysis. - Akitoshi Kawamura; Stephen A. Cook (ACM Trans. Comput. Theory, 2012)

Morpion Solitaire 5D: a new upper bound 121 on the maximum score. - Akitoshi Kawamura; Takuma Okamoto; Yuichi Tatsu; Yushi Uno; Masahide Yamato (CCCG, 2013)

The Distance 4-Sector of Two Points Is Unique. - Robert Fraser; Meng He 001; Akitoshi Kawamura; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson (ISAAC, 2013)

Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). - Akitoshi Kawamura; Jean-Yves Marion; David Nowak (NII Shonan Meet. Rep., 2013)

Function Spaces for Second-Order Polynomial Time. - Akitoshi Kawamura; Arno Pauly (CiE, 2014)

Weight Balancing on Boundaries and Skeletons. - Luis Barba; Otfried Cheong; Jean-Lou De Carufel; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot; et al. (SoCG, 2014)

Small Complexity Classes for Computable Analysis. - Akitoshi Kawamura; Hiroyuki Ota (MFCS (2), 2014)

Computational Complexity of Smooth Differential Equations. - Akitoshi Kawamura; Hiroyuki Ota; Carsten Rösnick; Martin Ziegler 001 (Log. Methods Comput. Sci., 2014)

On function spaces and polynomial-time computability. - Akitoshi Kawamura; Arno Pauly (CoRR, 2014)

Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). - Vasco Brattka; Akitoshi Kawamura; Alberto Marcone; Arno Pauly (Dagstuhl Reports, 2015)

Fence patrolling by mobile agents with distinct speeds. - Akitoshi Kawamura; Yusuke Kobayashi 001 (Distributed Comput., 2015)

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. - Akitoshi Kawamura; Norbert Th. Müller; Carsten Rösnick; Martin Ziegler 001 (J. Complex., 2015)

On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. - Reza Dorrigiv; Robert Fraser; Meng He 001; Shahin Kamali; Akitoshi Kawamura; Alejandro López-Ortiz; Diego Seco (Theory Comput. Syst., 2015)

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (CiE, 2016)

Complexity Theory of (Functions on) Compact Metric Spaces. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (LICS, 2016)

Polynomial Running Times for Polynomial-Time Oracle Machines. - Akitoshi Kawamura; Florian Steinberg 001 (FSCD, 2017)

Thin strip graphs. - Takashi Hayashi 002; Akitoshi Kawamura; Yota Otachi; Hidehiro Shinohara; Koichi Yamazaki (Discret. Appl. Math., 2017)

Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. - Akitoshi Kawamura; Yuichi Tatsu; Yushi Uno; Masahide Yamato (Inf. Process. Lett., 2017)

Folding and Punching Paper. - Yasuhiko Asao; Erik D. Demaine; Martin L. Demaine; Hideaki Hosaka; Akitoshi Kawamura; Tomohiro Tachi; Kazune Takahashi (J. Inf. Process., 2017)

On the computational complexity of the Dirichlet Problem for Poisson's Equation. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (Math. Struct. Comput. Sci., 2017)

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. - Akitoshi Kawamura; Holger Thies; Martin Ziegler 001 (MFCS, 2018)

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. - Akitoshi Kawamura; Florian Steinberg 001; Holger Thies (WoLLIC, 2018)

On characterizations of randomized computation using plain Kolmogorov complexity. - Shuichi Hirahara; Akitoshi Kawamura (Comput., 2018)

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. - Akitoshi Kawamura; Martin Ziegler 001 (CoRR, 2018)

Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. - Akitoshi Kawamura; Donghyun Lim; Svetlana Selivanova; Martin Ziegler 001 (CoRR, 2018)

Second-Order Linear-Time Computability with Applications to Computable Analysis. - Akitoshi Kawamura; Florian Steinberg 001; Holger Thies (TAMC, 2019)

A lower bound on opaque sets. - Akitoshi Kawamura; Sonoko Moriyama; Yota Otachi; János Pach (Comput. Geom., 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). - Bruce M. Kapron; Akitoshi Kawamura; Florian Steinberg 001 (NII Shonan Meet. Rep., 2019)

Simple strategies versus optimal schedules in multi-agent patrolling. - Akitoshi Kawamura; Makoto Soejima (Theor. Comput. Sci., 2020)

Online Scheduling on Identical Machines with a Metric State Space. - Hiromichi Goko; Akitoshi Kawamura; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita (STACS, 2022)

Weight balancing on boundaries. - Luis Barba; Otfried Cheong; Michael Gene Dobbins; Rudolf Fleischer; Akitoshi Kawamura; Matias Korman; Yoshio Okamoto; János Pach; Yuan Tang; Takeshi Tokuyama; Sander Verdonschot (J. Comput. Geom., 2022)

Elementarily Traceable Irrational Numbers. - Keita Hiroshima; Akitoshi Kawamura (CiE, 2023)

Trade-offs among degree, diameter, and number of paths. - Toshimasa Ishii; Akitoshi Kawamura; Yusuke Kobayashi 001; Kazuhisa Makino (Discret. Appl. Math., 2023)

Reachability in Linear Recurrence Automata. - Mika Hirvensalo; Akitoshi Kawamura; Igor Potapov; Takao Yuyama (RP, 2024)

Proof of the Density Threshold Conjecture for Pinwheel Scheduling. - Akitoshi Kawamura (STOC, 2024)

Pinwheel Covering. - Akitoshi Kawamura; Yusuke Kobayashi 001; Yosuke Kusano (CIAC (2), 2025)

The Ultimate Signs of Second-Order Holonomic Sequences. - Fugen Hagihara; Akitoshi Kawamura (ICALP, 2025)