Pages that link to "Item:Q2963897"
From MaRDI portal
The following pages link to On the parameterised complexity of string morphism problems (Q2963897):
Displaying 9 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- (Q4608614) (← links)
- (Q5136316) (← links)
- Variant Satisfiability of Parameterized Strings (Q6486037) (← links)