Generating derangements by interchanging at most four elements. - Kenji Mikawa; Ichiro Semba (Syst. Comput. Jpn., 2004)

A Heuristic Algorithm for Reconstructing a Packet Filter with Dependent Rules. - Ken Tanaka; Kenji Mikawa; Manabu Hikin (IEICE Trans. Commun., 2013)

Lexicographic ranking and unranking of derangements in cycle notation. - Kenji Mikawa; Ken Tanaka (Discret. Appl. Math., 2014)

Run-Based Trie Involving the Structure of Arbitrary Bitmask Rules. - Kenji Mikawa; Ken Tanaka (IEICE Trans. Inf. Syst., 2015)

Linear-time generation of uniform random derangements encoded in cycle notation. - Kenji Mikawa; Ken Tanaka (Discret. Appl. Math., 2017)

Acceleration of Packet Classification via Inclusive Rules. - Takashi Harada; Ken Tanaka; Kenji Mikawa (CNS, 2018)

A Heuristic Algorithm for Relaxed Optimal Rule Ordering Problem. - Takashi Harada; Ken Tanaka; Kenji Mikawa (CSNet, 2018)

Acceleration of Packet Classification Using Adjacency List of Rules. - Takashi Fuchino; Takashi Harada; Ken Tanaka; Kenji Mikawa (ICCCN, 2019)

A Packet Classification Method via Cascaded Circular-Run-Based Trie. - Takashi Harada; Yuki Ishikawa; Ken Tanaka; Kenji Mikawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

A Rule Reordering Method via Pairing Dependent Rules. - Takashi Harada; Ken Tanaka; Ryohei Ogasawara; Kenji Mikawa (CNS, 2020)

Simulated Annealing Method for Relaxed Optimal Rule Ordering. - Takashi Harada; Ken Tanaka; Kenji Mikawa (IEICE Trans. Inf. Syst., 2020)

Efficient linear-time ranking and unranking of derangements. - Kenji Mikawa; Ken Tanaka (Inf. Process. Lett., 2023)

Computational Complexity of Allow Rule Ordering and Its Greedy Algorithm. - Takashi Fuchino; Takashi Harada; Ken Tanaka; Kenji Mikawa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

Gray code generation of binary trees encoded in left-child sequences. - Sawaka Hori; Kenji Mikawa (Theor. Comput. Sci., 2025)