Pages that link to "Item:Q262282"

The following pages link to Constrained multilinear detection and generalized graph motifs (Q262282):

Displaying 19 items.

• Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
• Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
• Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
• Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• (Q4993296) (← links)
• (Q5090495) (← links)
• (Q5090939) (← links)
• Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
• Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
• On the Complexity of Bounded Context Switching. (Q5111714) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• (Q5140739) (← links)
• The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
• Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
• Fine-grained complexity of safety verification (Q5919003) (← links)