The following pages link to Color-coding (Q4369883):
Displaying 50 items.
- Partial information network queries (Q2018546) (← links)
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Parameterized complexity of small weight automorphisms and isomorphisms (Q2067668) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- Colored cut games (Q2087453) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Lengths of words accepted by nondeterministic finite automata (Q2203588) (← links)
- First-order definitions of subgraph isomorphism through the adjacency and order relations (Q2211263) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← 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)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
