Ngā hua rapu - Seto, Kazuhisa

Finding Top-k Longest Palindromes in Substrings mā Mitani, Kazuki, Mieno, Takuya, Seto, Kazuhisa, Horiyama, Takashi

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

Shortest cover after edit mā Mitani, Kazuki, Mieno, Takuya, Seto, Kazuhisa, Horiyama, Takashi

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees mā Mieno, Takuya, Takahashi, Shun, Seto, Kazuhisa, Horiyama, Takashi

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

On gapped repeats in a cyclic Fibonacci word mā Horiyama, Takashi, Numata, Yasuhide, Seto, Kazuhisa, Tsujie, Shuhei

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover mā Horiyama, Takashi, Kobayashi, Yasuaki, Ono, Hirotaka, Seto, Kazuhisa, Suzuki, Ryu

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

The Complexity of Boolean Connectivity Problem of $k$-Horn Formulas mā Horiyama, Takashi, Mineyoshi, Shoon, Okura, Yuto, Seto, Kazuhisa, Teruyama, Junichi

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

Optimal LZ-End Parsing is Hard mā Bannai, Hideo, Funakoshi, Mitsuru, Kurita, Kazuhiro, Nakashima, Yuto, Seto, Kazuhisa, Uno, Takeaki

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

On the complexity of finding a spanning even tree in a graph mā Hanaka, Tesshu, Kobayashi, Yasuaki, Kurita, Kazuhiro, Matsui, Yasuko, Nagao, Atsuki, Ono, Hirotaka, Seto, Kazuhisa

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa

Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3 mā Aoshima, Ryoma, Horiyama, Takashi, Nagao, Atsuki, Sakamoto, Fumiya, Sato, Hibiki, Seto, Kazuhisa, Umebayashi, Karin

Whiwhi kuputuhi katoa
Whiwhi kuputuhi katoa