Kazuhisa Seto

According to our database, Kazuhisa Seto authored at least 25 papers between 2010 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Maximal α-Gapped Repeats in a Fibonacci String.

Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.

Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

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

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2024

Foreword.

Kazuhisa Seto

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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, Kazuhisa Seto

CoRR, 2024

Shortest Cover After Edit.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

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

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Finding top-<i>k</i> longest palindromes in substrings.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Theor. Comput. Sci., November, 2023

Internal Longest Palindrome Queries in Optimal Time.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

Proceedings of the WALCOM: Algorithms and Computation, 2023

Optimal LZ-End Parsing Is Hard.

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

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

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

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., September, 2022

2017

Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability.

Kazuhisa Seto, Junichi Teruyama

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Efficient Algorithms for Sorting <i>k</i>-Sets in Bins.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

IEICE Trans. Inf. Syst., 2015

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

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Efficient Algorithms for Sorting k-Sets in Bins.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2012

A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.

Kazuhisa Seto, Suguru Tamaki

Proceedings of the 27th Conference on Computational Complexity, 2012

2010

The complexity of the Hajós calculus for planar graphs.

Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki

Theor. Comput. Sci., 2010

The Planar Hajós Calculus for Bounded Degree Graphs.

Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Improved Randomized Algorithms for 3-SAT.

Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010