Kazuhisa Seto

According to our database, Kazuhisa Seto authored at least 19 papers between 2010 and 2024.

Collaborative distances:

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

2024

Shortest cover after edit.

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama

CoRR, 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

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

2020

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

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Theory Comput. Syst., 2020

2019

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

2018

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Algorithmica, 2018

2017

Improved exact algorithms for mildly sparse instances of Max SAT.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama

Theor. Comput. Sci., 2017

2016

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

Kazuhisa Seto, Junichi Teruyama

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

2015

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

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki

Theory Comput. Syst., 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

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

2013

A satisfiability algorithm and average-case hardness for formulas over the full binary basis.

Kazuhisa Seto, Suguru Tamaki

Comput. Complex., 2013

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