Pages that link to "Item:Q3638070"

The following pages link to Limits and Applications of Group Algebras for Parameterized Problems (Q3638070):

Displaying 36 items.

• Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
• Parameterized approximation algorithms for packing problems (Q313963) (← links)
• On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
• Evaluation of permanents in rings and semirings (Q407582) (← links)
• On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
• Faster algorithms for finding and counting subgraphs (Q439930) (← links)
• Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
• Detecting monomials with \(k\) distinct variables (Q477587) (← links)
• Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
• A new algorithm for finding trees with many leaves (Q652536) (← links)
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
• Interval scheduling and colorful independent sets (Q892898) (← links)
• Representative families: a unified tradeoff-based approach (Q899582) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
• Narrow sieves for parameterized paths and packings (Q2396725) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
• Improved parameterized algorithms for network query problems (Q2414861) (← links)
• Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
• Fast monotone summation over disjoint sets (Q2446070) (← links)
• Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
• Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
• Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
• Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
• Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
• A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• On Counting Parameterized Matching and Packing (Q4632178) (← links)
• Detecting and Counting Small Pattern Graphs (Q5502097) (← links)
• (Q5743488) (← links)
• (Q5743515) (← links)
• The Maximum Binary Tree Problem. (Q5874498) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)