Color-coding
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the parameterized complexity of multiple-interval graph problems
- The complexity of nonrepetitive coloring
- Computing small partial coverings
- Learning large-alphabet and analog circuits with value injection queries
- Detecting directed 4-cycles still faster
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- On problems without polynomial kernels
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- On counting 3-D matchings of size \(k\)
- A faster parameterized algorithm for set packing
- On the complexity of database queries
- Formally verified algorithms for upper-bounding state space diameters
- Chain minors are FPT
- Are unique subgraphs not easier to find?
- Randomised enumeration of small witnesses using a decision oracle
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Multivariate complexity analysis of Swap Bribery
- Fast minor testing in planar graphs
- Towards better models of externalities in sponsored search auctions
- An approximation algorithm for computing longest paths.
- Improved approximation bounds for the minimum rainbow subgraph problem
- A shortest cycle for each vertex of a graph
- Parameterized random complexity
- Quasi-hamiltonian paths in semicomplete multipartite digraphs
- Finding and counting vertex-colored subtrees
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
- A trichotomy for regular simple path queries on graphs
- Partial information network queries
- Parameterized complexity of \textsc{maximum edge colorable subgraph}
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Hardness and tractability of the \(\gamma\)-complete subgraph problem
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- The maximum binary tree problem
- Beating treewidth for average-case subgraph isomorphism
- New and improved algorithms for unordered tree inclusion
- Fine-grained complexity of rainbow coloring and its variants
- Parameterized complexity of small weight automorphisms and isomorphisms
- Univariate ideal membership parameterized by rank, degree, and number of generators
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants
- Parameterized complexity of multi-node hubs
- On the complexity of approximately matching a string to a directed graph
- Finding colorful paths in temporal graphs
- Colored cut games
- Parameterized complexity of maximum edge colorable subgraph
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- To close is easier than to open: dual parameterization to \(k\)-median
- Parameterized complexity of \((A,\ell)\)-path packing
- A polynomial excluded-minor approximation of treedepth
- A note on algebraic techniques for subgraph detection
- Parameterized complexity of reconfiguration of atoms
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- The balanced connected subgraph problem for geometric intersection graphs
- Parameterized analysis and crossing minimization problems
- Lengths of words accepted by nondeterministic finite automata
- First-order definitions of subgraph isomorphism through the adjacency and order relations
- Parameterized low-rank binary matrix approximation
- Fooling views: a new lower bound technique for distributed computations under congestion
- Parameterized \(k\)-clustering: tractability island
- Algorithms for topology-free and alignment network queries
- The parameterised complexity of counting connected subgraphs and graph motifs
- Faster deterministic parameterized algorithm for k-path
- Parameterized complexity of a coupled-task scheduling problem
- Improved distance queries and cycle counting by Frobenius normal form
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Two edge-disjoint paths with length constraints
- Comparing incomplete sequences via longest common subsequence
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- A completeness theory for polynomial (Turing) kernelization
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- The parameterized complexity of unique coverage and its variants
- Narrow sieves for parameterized paths and packings
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- A multivariate framework for weighted FPT algorithms
- Answering conjunctive queries with inequalities
- Green, greener or brown: choosing the right color of the product
- Parameterized complexity of secluded connectivity problems
- The parameterized space complexity of embedding along a path
- Mind the gap!
- Improved parameterized algorithms for network query problems
- On the tractability of finding disjoint clubs in a network
- Grad and classes with bounded expansion. II: Algorithmic aspects
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
- Parameterized complexity of Eulerian deletion problems
- Open problems around exact algorithms
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Fixed-parameter algorithms for scaffold filling
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Parameterized complexity of the anchored k-core problem for directed graphs
- Edge-disjoint packing of stars and cycles
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- A randomized algorithm for long directed cycle
- Networks of polynomial pieces with application to the analysis of point clouds and images
- QUBO formulations of the longest path problem
- On finding rainbow and colorful paths
This page was built for publication: Color-coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369883)
