Pages that link to "Item:Q2396725"
From MaRDI portal
The following pages link to Narrow sieves for parameterized paths and packings (Q2396725):
Displaying 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)
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← 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)
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Partial information network queries (Q2018546) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- TOWARD RANDOMIZED TESTING OF q-MONOMIALS IN MULTIVARIATE POLYNOMIALS (Q2875680) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- (Q5090495) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
