On the Number of Non-equivalent Parameterized Squares in a String
Fuente:
arXiv
Saved in:
| Main Authors: | Hamai, Rikuya, Taketsugu, Kazushi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025)
by: Kishi, Kaisei, et al.
Published: (2025)
On the compressiveness of the Burrows-Wheeler transform
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Constant sensitivity on the CDAWGs
by: Hamai, Rikuya, et al.
Published: (2025)
by: Hamai, Rikuya, et al.
Published: (2025)
Faster Space-Efficient STR-IC-LCS Computation
by: Yonemoto, Yuki, et al.
Published: (2022)
by: Yonemoto, Yuki, et al.
Published: (2022)
Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)
by: Giuliani, Sara, et al.
Published: (2024)
Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)
by: Molter, Hendrik, et al.
Published: (2025)
Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)
by: Bannai, Hideo, et al.
Published: (2026)
Edit and Alphabet-Ordering Sensitivity of Lex-parse
by: Nakashima, Yuto, et al.
Published: (2024)
by: Nakashima, Yuto, et al.
Published: (2024)
On the Parameterized Intractability of Determinant Maximization
by: Ohsaka, Naoto
Published: (2022)
by: Ohsaka, Naoto
Published: (2022)
String Matching with a Dynamic Pattern
by: Monteiro, Bruno, et al.
Published: (2025)
by: Monteiro, Bruno, et al.
Published: (2025)
Parameterized Complexity of Path Set Packing
by: Aravind, N. R., et al.
Published: (2022)
by: Aravind, N. R., et al.
Published: (2022)
Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)
by: Chaudhary, Juhi, et al.
Published: (2025)
On the Structural Parameterizations of 2-Club with Triangle Constraints
by: Jacob, Ashwin, et al.
Published: (2025)
by: Jacob, Ashwin, et al.
Published: (2025)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Parameterized Algorithms for Balanced Cluster Edge Modification Problems
by: Madathil, Jayakrishnan, et al.
Published: (2024)
by: Madathil, Jayakrishnan, et al.
Published: (2024)
The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
by: Bentert, Matthias, et al.
Published: (2024)
by: Bentert, Matthias, et al.
Published: (2024)
Exploring Repetitiveness Measures for Two-Dimensional Strings
by: Romana, Giuseppe, et al.
Published: (2024)
by: Romana, Giuseppe, et al.
Published: (2024)
Counting distinct (non-)crossing substrings
by: Umezaki, Haruki, et al.
Published: (2025)
by: Umezaki, Haruki, et al.
Published: (2025)
Computing maximal palindromes in non-standard matching models
by: Mieno, Takuya, et al.
Published: (2022)
by: Mieno, Takuya, et al.
Published: (2022)
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
by: Mathur, Yashaswini, et al.
Published: (2025)
by: Mathur, Yashaswini, et al.
Published: (2025)
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025)
by: Marin, Malory
Published: (2025)
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)
by: Komusiewicz, Christian, et al.
Published: (2026)
Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
by: Gaikwad, Ajinkya
Published: (2025)
by: Gaikwad, Ajinkya
Published: (2025)
Isomorphism Testing Parameterized by Genus and Beyond
by: Neuen, Daniel
Published: (2021)
by: Neuen, Daniel
Published: (2021)
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)
by: Kaul, Matthias, et al.
Published: (2024)
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)
by: Deligkas, Argyrios, et al.
Published: (2025)
Graph parameters that are coarsely equivalent to path-length
by: Dragan, Feodor F., et al.
Published: (2025)
by: Dragan, Feodor F., et al.
Published: (2025)
Tight Additive Sensitivity on LZ-style Compressors and String Attractors
by: Fujie, Yuto, et al.
Published: (2025)
by: Fujie, Yuto, et al.
Published: (2025)
Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)
by: Oostveen, Jelle J., et al.
Published: (2022)
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026)
by: Aute, Shubhada, et al.
Published: (2026)
Hardness of Burning Number Problem on Regular Graphs
by: Antony, Dhanyamol, et al.
Published: (2026)
by: Antony, Dhanyamol, et al.
Published: (2026)
Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)
by: Leonard, Laurentius, et al.
Published: (2023)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Finding Minimum Distance Preservers: A Parameterized Study
by: Simonov, Kirill, et al.
Published: (2026)
by: Simonov, Kirill, et al.
Published: (2026)
Tree Independence Number IV. Even-hole-free Graphs
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
by: Conrado, Giovanna K., et al.
Published: (2023)
by: Conrado, Giovanna K., et al.
Published: (2023)
Tight bounds for the sensitivity of CDAWGs with left-end edits
by: Fujimaru, Hiroto, et al.
Published: (2023)
by: Fujimaru, Hiroto, et al.
Published: (2023)
Similar Items
-
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025) -
On the compressiveness of the Burrows-Wheeler transform
by: Bannai, Hideo, et al.
Published: (2024) -
Constant sensitivity on the CDAWGs
by: Hamai, Rikuya, et al.
Published: (2025) -
Faster Space-Efficient STR-IC-LCS Computation
by: Yonemoto, Yuki, et al.
Published: (2022) -
Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)