The following pages link to Color-coding (Q4369883):
Displaying 50 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- A randomized algorithm for long directed cycle (Q264199) (← links)
- On finding rainbow and colorful paths (Q266284) (← links)
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Quell (Q500997) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Looking at the stars (Q820158) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
