Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 50 items.
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Classification using proximity catch digraphs (Q782440) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- Directed NLC-width (Q906393) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
