default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuhisa Seto
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Kazuhisa Seto:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1440 (2024)- [j13]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): 732-740 (2024) - [c13]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: 20726-20734 - [c12]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest Cover After Edit. CPM 2024: 24:1-24:15 - [i8]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Shortest cover after edit. CoRR abs/2402.17428 (2024) - [i7]Takuya Mieno, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama:
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees. CoRR abs/2409.19576 (2024) - 2023
- [j12]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Finding top-k longest palindromes in substrings. Theor. Comput. Sci. 979: 114183 (2023) - [c11]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: 191-196 - [c10]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11 - [c9]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto
, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. WALCOM 2023: 127-138 - [i6]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 (2023) - [i5]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 abs/2312.10599 (2023) - 2022
- [j11]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. 105-A(9): 1298-1308 (2022) - [i4]Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama:
Internal Longest Palindrome Queries in Optimal Time. CoRR abs/2210.02000 (2022) - 2020
- [j10]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory Comput. Syst. 64(8): 1392-1407 (2020)
2010 – 2019
- 2019
- [j9]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: 87-103 (2019) - 2018
- [j8]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. Algorithmica 80(10): 2725-2741 (2018) - 2017
- [j7]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved exact algorithms for mildly sparse instances of Max SAT. Theor. Comput. Sci. 697: 58-68 (2017) - [c8]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC 2017: 58:1-58:10 - 2016
- [j6]Kazuhisa Seto, Junichi Teruyama:
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1019-1024 (2016) - [c7]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. MFCS 2016: 82:1-82:16 - [i3]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j5]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. IEICE Trans. Inf. Syst. 98-D(10): 1736-1743 (2015) - [j4]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Theory Comput. Syst. 57(2): 426-443 (2015) - [c6]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC 2015: 90-101 - [c5]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. WADS 2015: 554-565 - [i2]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. TR15 (2015) - 2014
- [c4]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki:
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. SAT 2014: 32-47 - [c3]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. WALCOM 2014: 225-236 - 2013
- [j3]Kazuhisa Seto, Suguru Tamaki:
A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Comput. Complex. 22(2): 245-274 (2013) - 2012
- [c2]Kazuhisa Seto, Suguru Tamaki:
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. CCC 2012: 107-116 - [i1]Kazuhisa Seto, Suguru Tamaki:
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [j2]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The Planar Hajós Calculus for Bounded Degree Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1000-1007 (2010) - [j1]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The complexity of the Hajós calculus for planar graphs. Theor. Comput. Sci. 411(7-9): 1182-1191 (2010) - [c1]Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki:
Improved Randomized Algorithms for 3-SAT. ISAAC (1) 2010: 73-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
