The following pages link to (Q5446124):
Displaying 16 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Enhanced string covering (Q393116) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- (Q3021055) (← links)
- (Q4788070) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- String Covering: A Survey (Q6145625) (← links)
- Approximation and fixed parameter algorithms for the approximate cover problem (Q6545414) (← links)