Akitoshi Kawamura

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 25

Top Topics

Minimum Spanning Trees

Complexity Theory

Top Venues

Discret. Appl. Math.

Publications

Akitoshi Kawamura
Proof of the Density Threshold Conjecture for Pinwheel Scheduling. STOC (2024)
Toshimasa Ishii, Akitoshi Kawamura, Yusuke Kobayashi, Kazuhisa Makino
Trade-offs among degree, diameter, and number of paths. Discret. Appl. Math. 327 (2023)
Keita Hiroshima, Akitoshi Kawamura
Elementarily Traceable Irrational Numbers. CiE (2023)
Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita
Online Scheduling on Identical Machines with a Metric State Space. STACS (2022)
Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot
Weight balancing on boundaries. J. Comput. Geom. 13 (1) (2022)
Akitoshi Kawamura, Makoto Soejima
Simple strategies versus optimal schedules in multi-agent patrolling. Theor. Comput. Sci. 839 (2020)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23 (1) (2019)
Bruce M. Kapron, Akitoshi Kawamura, Florian Steinberg
Higher-order Complexity Theory and its Applications (NII Shonan Meeting 151). NII Shonan Meet. Rep. 2019 (2019)
Akitoshi Kawamura, Florian Steinberg, Holger Thies
Second-Order Linear-Time Computability with Applications to Computable Analysis. TAMC (2019)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
A lower bound on opaque sets. Comput. Geom. 80 (2019)
Akitoshi Kawamura, Martin Ziegler
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. CoRR (2018)
Shuichi Hirahara, Akitoshi Kawamura
On characterizations of randomized computation using plain Kolmogorov complexity. Comput. 7 (1) (2018)
Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler
Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. CoRR (2018)
Akitoshi Kawamura, Holger Thies, Martin Ziegler
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. MFCS (2018)
Akitoshi Kawamura, Florian Steinberg, Holger Thies
Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving. WoLLIC (2018)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Math. Struct. Comput. Sci. 27 (8) (2017)
Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. Inf. Process. Lett. 121 (2017)
Yasuhiko Asao, Erik D. Demaine, Martin L. Demaine, Hideaki Hosaka, Akitoshi Kawamura, Tomohiro Tachi, Kazune Takahashi
Folding and Punching Paper. J. Inf. Process. 25 (2017)
Akitoshi Kawamura, Florian Steinberg
Polynomial running times for polynomial-time oracle machines. CoRR (2017)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. WALCOM (2017)
Akitoshi Kawamura, Florian Steinberg
Polynomial Running Times for Polynomial-Time Oracle Machines. FSCD (2017)
Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki
Thin strip graphs. Discret. Appl. Math. 216 (2017)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
Complexity Theory of (Functions on) Compact Metric Spaces. LICS (2016)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
A Lower Bound on Opaque Sets. SoCG (2016)
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE (2016)
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, Tianhao Wang
Weight Balancing on Boundaries and Skeletons. CoRR (2015)
Akitoshi Kawamura, Makoto Soejima
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling. CIAC (2015)
Akitoshi Kawamura, Yusuke Kobayashi
Fence patrolling by mobile agents with distinct speeds. Distributed Comput. 28 (2) (2015)
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. Theory Comput. Syst. 56 (1) (2015)
Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. J. Complex. 31 (5) (2015)
Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5 (9) (2015)
Akitoshi Kawamura, Makoto Soejima
Simple strategies versus optimal schedules in multi-agent patrolling. CoRR (2014)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
A lower bound on opaque sets. CoRR (2014)
Akitoshi Kawamura, Hiroyuki Ota
Small Complexity Classes for Computable Analysis. MFCS (2) (2014)
Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler
Computational Complexity of Smooth Differential Equations. Log. Methods Comput. Sci. 10 (1) (2014)
Shuichi Hirahara, Akitoshi Kawamura
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. MFCS (2) (2014)
Akitoshi Kawamura, Arno Pauly
On function spaces and polynomial-time computability. CoRR (2014)
Akitoshi Kawamura, Yusuke Kobayashi
Fence patrolling by mobile agents with distinct speeds. CoRR (2014)
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, Tianhao Wang
Weight Balancing on Boundaries and Skeletons. SoCG (2014)
Akitoshi Kawamura, Arno Pauly
Function Spaces for Second-Order Polynomial Time. CiE (2014)
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. CoRR (2013)
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. CCCG (2013)
Akitoshi Kawamura, Stephen A. Cook
Complexity Theory for Operators in Analysis CoRR (2013)
Akitoshi Kawamura, Jean-Yves Marion, David Nowak
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). NII Shonan Meet. Rep. 2013 (2013)
Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson
The Distance 4-Sector of Two Points Is Unique. ISAAC (2013)
Akitoshi Kawamura, Stephen A. Cook
Complexity Theory for Operators in Analysis. ACM Trans. Comput. Theory 4 (2) (2012)
Akitoshi Kawamura, Yusuke Kobayashi
Fence Patrolling by Mobile Agents with Distinct Speeds. ISAAC (2012)
Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler
Computational Complexity of Smooth Differential Equations. MFCS (2012)
Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime CoRR (2012)
Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA (2012)
Akitoshi Kawamura
Generalized Semimagic Squares for Digital Halftoning. Theory Comput. Syst. 49 (3) (2011)
Yohji Akama, Kei Irie, Akitoshi Kawamura, Yasutaka Uwano
VC Dimensions of Principal Component Analysis. Discret. Comput. Geom. 44 (3) (2010)
Akitoshi Kawamura, Stephen A. Cook
Complexity theory for operators in analysis. STOC (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-sectors exist. Comput. Geom. 43 (9) (2010)
Akitoshi Kawamura
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. Comput. Complex. 19 (2) (2010)
Akitoshi Kawamura
Generalized Semimagic Squares for Digital Halftoning CoRR (2010)
Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
Zone diagrams in Euclidean spaces and in other normed spaces. SCG (2010)
Akitoshi Kawamura
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete CoRR (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
-sectors exist. SCG (2010)
Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama
Distance k-Sectors Exist CoRR (2009)
Akitoshi Kawamura, Jirí Matousek, Takeshi Tokuyama
Zone Diagrams in Euclidean Spaces and in Other Normed Spaces CoRR (2009)
Akitoshi Kawamura
Differential recursion. ACM Trans. Comput. Log. 10 (3) (2009)
Akitoshi Kawamura
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete. Computational Complexity Conference (2009)
Akitoshi Kawamura
Differential Recursion and Differentially Algebraic Functions CoRR (2007)
Akitoshi Kawamura
Type-2 Computability and Moore's Recursive Functions. Electron. Notes Theor. Comput. Sci. 120 (2005)