Color-coding
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 1.61-approximation for min-power strong connectivity with two power levels
- Fast Output-Sensitive Matrix Multiplication
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Kernel and fast algorithm for dense triplet inconsistency
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks
- Kernel bounds for path and cycle problems
- Parameterized maximum path coloring
- Parameterized complexity of connected even/odd subgraph problems
- Parameterized algorithms for weighted matching and packing problems
- First-order definitions of subgraph isomorphism through the adjacency and order relations
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
- Improved distance queries and cycle counting by Frobenius normal form
- Packing arc-disjoint cycles in oriented graphs
- Parameterised and fine-grained subgraph counting, modulo 2
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
- Parameterized complexity of incomplete connected fair division
- New extremal bounds for reachability and strong-connectivity preservers under failures
- Long directed detours: reduction to 2-disjoint paths
- Studies in Computational Aspects of Voting
- Randomised enumeration of small witnesses using a decision oracle
- scientific article; zbMATH DE number 7559154 (Why is no real title available?)
- Parameterized complexity of the anchored k-core problem for directed graphs
- Edge-disjoint packing of stars and cycles
- The \(k\)-distinct language: parameterized automata constructions
- A randomized algorithm for long directed cycle
- On finding rainbow and colorful paths
- An approximation algorithm for the longest cycle problem in solid grid graphs
- Parameterized complexity of even/odd subgraph problems
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Collaborating with Hans: Some Remaining Wonderments
- The parameterized complexity of finding point sets with hereditary properties
- On the maximum colorful arborescence problem and color hierarchy graph structure
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
- Parameterized approximation algorithms for packing problems
- Parameterizing role coloring on forests
- Fast exact algorithms using Hadamard product of polynomials
- Parameterized complexity of categorical clustering with size constraints
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Two edge-disjoint paths with length constraints
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
- Grundy Coloring and friends, half-graphs, bicliques
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
- Inapproximability of shortest paths on perfect matching polytopes
- scientific article; zbMATH DE number 866027 (Why is no real title available?)
- Designing FPT algorithms for cut problems using randomized contractions
- Finding approximate and constrained motifs in graphs
- Improved Upper Bounds for Partial Vertex Cover
- The maximum binary tree problem
- Improved approximation bounds for the minimum rainbow subgraph problem
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
- Networks of polynomial pieces with application to the analysis of point clouds and images
- Fooling views: a new lower bound technique for distributed computations under congestion
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Comparing incomplete sequences via longest common subsequence
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Open problems around exact algorithms
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Finding and counting given length cycles
- Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- What's next? Future directions in parameterized complexity
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
- To close is easier than to open: dual parameterization to \(k\)-median
- Efficient algorithms for clique problems
- A polynomial excluded-minor approximation of treedepth
- On the tractability of finding disjoint clubs in a network
- Fixed-parameter tractability of maximum colored path and beyond
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- On computing the k-shortcut Fréchet distance
- Looking at the stars
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup
- scientific article; zbMATH DE number 7561381 (Why is no real title available?)
- The Budgeted Unique Coverage Problem and Color-Coding
- Extended formulations in combinatorial optimization
- Colored Nested Words
- Clustering with Local Restrictions
- Patching colors with tensors
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
- Evaluation and enumeration problems for regular path queries
- Unique subgraphs are not easier to find
- Computing small partial coverings
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- An approximation algorithm for computing longest paths.
- Testing network correlation efficiently via counting trees
- A trichotomy for regular simple path queries on graphs
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- On problems without polynomial kernels
- New results for the longest haplotype reconstruction problem
- A faster parameterized algorithm for set packing
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- A note on algebraic techniques for subgraph detection
- Learning large-alphabet and analog circuits with value injection queries
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)
