The following pages link to (Q2934608):
Displaying 44 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)
- On Counting Parameterized Matching and Packing (Q4632178) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5075762) (← links)
- (Q5075790) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Detours in directed graphs (Q6113279) (← links)
