Limits and Applications of Group Algebras for Parameterized Problems

DOI10.1007/978-3-642-02927-1_54zbMath1248.68251OpenAlexW2100239335MaRDI QIDQ3638070

Ioannis Koutis, R. Ryan Williams

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6149

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (36)

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

This page was built for publication: Limits and Applications of Group Algebras for Parameterized Problems