Improved Randomized Algorithms for 3-SAT. - Kazuo Iwama; Kazuhisa Seto; Tadashi Takai; Suguru Tamaki (ISAAC (1), 2010)

The Planar Hajós Calculus for Bounded Degree Graphs. - Kazuo Iwama; Kazuhisa Seto; Suguru Tamaki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

The complexity of the Hajós calculus for planar graphs. - Kazuo Iwama; Kazuhisa Seto; Suguru Tamaki (Theor. Comput. Sci., 2010)

A satisfiability algorithm and average-case hardness for formulas over the full binary basis. - Kazuhisa Seto; Suguru Tamaki (Comput. Complex., 2013)

Efficient Algorithms for Sorting k-Sets in Bins. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (WALCOM, 2014)

A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (Electron. Colloquium Comput. Complex., 2015)

Efficient Algorithms for Sorting k-Sets in Bins. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Inf. Syst., 2015)

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki (Theory Comput. Syst., 2015)

An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability. - Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Improved exact algorithms for mildly sparse instances of Max SAT. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (Theor. Comput. Sci., 2017)

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (Algorithmica, 2018)

Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (J. Comput. Syst. Sci., 2019)

Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (Theory Comput. Syst., 2020)

A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. - Tomu Makita; Atsuki Nagao; Tatsuki Okada; Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Optimal LZ-End Parsing Is Hard. - Hideo Bannai; Mitsuru Funakoshi; Kazuhiro Kurita; Yuto Nakashima 001; Kazuhisa Seto; Takeaki Uno (CPM, 2023)

Internal Longest Palindrome Queries in Optimal Time. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (WALCOM, 2023)

Finding top-k longest palindromes in substrings. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (Theor. Comput. Sci., 2023)

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. - Takashi Horiyama; Yasuaki Kobayashi; Hirotaka Ono 001; Kazuhisa Seto; Ryu Suzuki (AAAI, 2024)

Shortest Cover After Edit. - Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama (CPM, 2024)

On the complexity of finding a spanning even tree in a graph. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Atsuki Nagao; Hirotaka Ono 001; Kazuhisa Seto (CoRR, 2024)

Foreword. - Kazuhisa Seto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. - Yuki Kawakami; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama; Yuki Kobayashi; Yuya Higashikawa; Naoki Katoh (IEICE Trans. Inf. Syst., 2024)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. - Takuya Mieno; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama (SOFSEM (2), 2025)

Maximal α-Gapped Repeats in a Fibonacci String. - Kazuma Yamane; Yuto Nakashima 001; Kazuhisa Seto; Takashi Horiyama (SOFSEM (2), 2025)