Pages that link to "Item:Q3521948"
From MaRDI portal
The following pages link to Faster Algebraic Algorithms for Path and Packing Problems (Q3521948):
Displayed 50 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast (Q391229) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← 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)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Partial information network queries (Q2018546) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- A fast parallel algorithm for minimum-cost small integral flows (Q2354029) (← 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)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS (Q2875680) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)