The following pages link to Patterns with bounded treewidth (Q476169):
Displaying 20 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- Pattern avoidance in binary trees (Q986111) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- A logic for document spanners (Q2322723) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Efficient pattern matching on graph patterns of bounded treewidth (Q2840694) (← links)
- Patterns with Bounded Treewidth (Q2890220) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- (Q5091134) (← links)
- (Q5091271) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
