The following pages link to Color-coding (Q4369883):
Displaying 50 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Parity check matrices and product representations of squares (Q949791) (← 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)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Computing small partial coverings (Q1007552) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- Detecting directed 4-cycles still faster (Q1014385) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- On the complexity of database queries (Q1307689) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Formally verified algorithms for upper-bounding state space diameters (Q1663245) (← links)
- Chain minors are FPT (Q1679223) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Are unique subgraphs not easier to find? (Q1707980) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Towards better models of externalities in sponsored search auctions (Q1786603) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- A shortest cycle for each vertex of a graph (Q1944201) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
