Kazuhisa Seto

42 papers A* 1A 2B 10Journal 24Unranked 5
YearRankTypeTitle / Venue / Authors
2025 B conf
Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas.
IPEC
Takashi Horiyama, Yuto Okura, Kazuhisa Seto, Junichi Teruyama
2025 B conf
Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3.
FCT
Takashi Horiyama, Fumiya Sakamoto, Kazuhisa Seto, Ryu Suzuki
2025 — conf
Maximal α-Gapped Repeats in a Fibonacci String.
SOFSEM (2)
Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama
2025 — conf
On the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries.
CCCG
Shoon Mineyoshi, Kazuhisa Seto, Takashi Horiyama
2025 — conf
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.
SOFSEM (2)
Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama
2025 J jnl
The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs.
Theory Comput. Syst.
Takashi Horiyama, Kazuhisa Seto, Ryu Suzuki
2024 J jnl
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuhisa Seto
2024 J jnl
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.
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
2024 J jnl
On the complexity of finding a spanning even tree in a graph.
CoRR
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto
2024 J jnl
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.
CoRR
Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama
2024 B conf
Shortest Cover After Edit.
CPM
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2024 J jnl
Shortest cover after edit.
CoRR
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2024 A* conf
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.
AAAI
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2023 J jnl
Finding top-
Theor. Comput. Sci.
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023 B conf
Internal Longest Palindrome Queries in Optimal Time.
WALCOM
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2023 — conf
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs.
CCCG
Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh
2023 B conf
Optimal LZ-End Parsing Is Hard.
CPM
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Optimal LZ-End Parsing is Hard.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.
CoRR
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
2022 J jnl
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama
2022 J jnl
Internal Longest Palindrome Queries in Optimal Time.
CoRR
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
2020 J jnl
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
Theory Comput. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2019 J jnl
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression.
J. Comput. Syst. Sci.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2018 J jnl
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
Algorithmica
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2017 J jnl
Improved exact algorithms for mildly sparse instances of Max SAT.
Theor. Comput. Sci.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2017 B conf
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.
ISAAC
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2016 J jnl
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuhisa Seto, Junichi Teruyama
2016 B conf
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
MFCS
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2016 J jnl
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
Electron. Colloquium Comput. Complex.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015 B conf
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
WADS
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015 J jnl
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom.
Electron. Colloquium Comput. Complex.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015 J jnl
Efficient Algorithms for Sorting
IEICE Trans. Inf. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015 B conf
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.
IPEC
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015 J jnl
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
Theory Comput. Syst.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
2014 B conf
Efficient Algorithms for Sorting k-Sets in Bins.
WALCOM
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2014 A conf
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction.
SAT
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki
2013 J jnl
A satisfiability algorithm and average-case hardness for formulas over the full binary basis.
Comput. Complex.
Kazuhisa Seto, Suguru Tamaki
2012 A conf
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
CCC
Kazuhisa Seto, Suguru Tamaki
2012 J jnl
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis.
Electron. Colloquium Comput. Complex.
Kazuhisa Seto, Suguru Tamaki
2010 — conf
Improved Randomized Algorithms for 3-SAT.
ISAAC (1)
Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
2010 J jnl
The Planar Hajós Calculus for Bounded Degree Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki
2010 J jnl
The complexity of the Hajós calculus for planar graphs.
Theor. Comput. Sci.
Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki