Kazuhisa Seto

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 20

Top Topics

Maximum Satisfiability

Top Venues

Theor. Comput. Sci.

Publications

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest Cover After Edit. CPM (2024)
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 107 (6) (2024)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Shortest cover after edit. CoRR (2024)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. AAAI (2024)
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. CoRR (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing is Hard. CoRR (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
longest palindromes in substrings. Theor. Comput. Sci. 979 (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. WALCOM (2023)
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
Optimal LZ-End Parsing Is Hard. CPM (2023)
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG (2023)
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
Internal Longest Palindrome Queries in Optimal Time. CoRR (2022)
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory Comput. Syst. 64 (8) (2020)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. J. Comput. Syst. Sci. 105 (2019)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. Algorithmica 80 (10) (2018)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
Improved exact algorithms for mildly sparse instances of Max SAT. Theor. Comput. Sci. 697 (2017)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC (2017)
Kazuhisa Seto, Junichi Teruyama
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2016)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex. 23 (2016)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. MFCS (2016)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. WADS (2015)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
-Sets in Bins. IEICE Trans. Inf. Syst. (10) (2015)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Electron. Colloquium Comput. Complex. 22 (2015)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Theory Comput. Syst. 57 (2) (2015)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC (2015)
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. SAT (2014)
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
Efficient Algorithms for Sorting k-Sets in Bins. WALCOM (2014)
Kazuhisa Seto, Suguru Tamaki
A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Comput. Complex. 22 (2) (2013)
Kazuhisa Seto, Suguru Tamaki
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Electron. Colloquium Comput. Complex. 19 (2012)
Kazuhisa Seto, Suguru Tamaki
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Computational Complexity Conference (2012)
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
The complexity of the Hajós calculus for planar graphs. Theor. Comput. Sci. 411 (7-9) (2010)
Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
Improved Randomized Algorithms for 3-SAT. ISAAC (1) (2010)
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
The Planar Hajós Calculus for Bounded Degree Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2010)