The following pages link to (Q4904144):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Efficiently approximating color-spanning balls (Q284593) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Concerning infeasibility of the wave functions of the universe (Q747858) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Coloring invariants of knots and links are often intractable (Q1983547) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- Metric dimension parameterized by treewidth (Q2041987) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Defensive alliances in graphs (Q2079875) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- On the complexity of detecting hazards (Q2203575) (← links)
