Author

Naonori Kakimura

h-index 18 View on Semantic Scholar

We have 2 of 106 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Refined Analysis of the Sequential Access Theorem for Splay Trees

A splay tree is a self-adjusting binary search tree that allows access, insertion, and deletion to be performed in amortized $O(\log n)$ time, where $n$ is the number of stored elements. The sequential access theorem states that, when the elements of a splay tree are accessed in increasing order, the amortized cost per...

Naonori Kakimura, Y. Terai · 0 citations

Preprint Sep 2026

Vertex Cover Interdiction in Bipartite Graphs

In the vertex cover interdiction problem, we are given an undirected graph $G=(V,E)$, two integers $t$ and $k$ and a vertex subset $B\subseteq V$, and we are asked to find a set $X \subseteq B$ with $|X|\leq t$ such that $X$ hits (i.e., intersects) all the vertex covers of $G$ of size at most $k$. Recently, Gr\"une and...

Takehiro Ito, Naonori Kakimura, N. Kamiyama et al. · 0 citations