| 2025 | FCT | Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3. | Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki |
| 2025 | SOFSEM | Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. | Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama |
| 2025 | SOFSEM | Maximal α-Gapped Repeats in a Fibonacci String. | Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama |
| 2024 | AAAI | Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. | Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki |
| 2024 | CPM | Shortest Cover After Edit. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2023 | CPM | Optimal LZ-End Parsing Is Hard. | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | WALCOM | Internal Longest Palindrome Queries in Optimal Time. | Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2017 | ISAAC | Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
| 2016 | MFCS | Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama |
| 2015 | WADS | A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
| 2014 | SAT | Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki |
| 2014 | WALCOM | Efficient Algorithms for Sorting k-Sets in Bins. | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
| 2010 | ISAAC | Improved Randomized Algorithms for 3-SAT. | Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki |