Pages that link to "Item:Q383833"

The following pages link to Fundamentals of parameterized complexity (Q383833):

Displaying 50 items.

• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
• A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Some results on more flexible versions of Graph Motif (Q2354588) (← links)
• A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
• On the complexity of the identifiable subgraph problem, revisited (Q2357777) (← links)
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
• Parameterized complexity classes beyond para-NP (Q2396719) (← links)
• Paradigms for parameterized enumeration (Q2398214) (← links)
• Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← 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)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← links)
• Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
• On the minimum eccentricity shortest path problem (Q2404081) (← links)
• On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
• Editing to a connected graph of given degrees (Q2407094) (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) (← links)
• On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
• Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
• Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
• Quick but odd growth of cacti (Q2408205) (← links)
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
• Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
• Line segment covering of cells in arrangements (Q2410576) (← links)
• On compiling structured CNFs to OBDDs (Q2411046) (← links)
• Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
• From tree-decompositions to clique-width terms (Q2413974) (← links)
• Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
• Knapsack problems: a parameterized point of view (Q2419116) (← links)
• Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Edge-disjoint packing of stars and cycles (Q2629232) (← links)
• Weighted proper orientations of trees and graphs of bounded treewidth (Q2632010) (← links)
• Are there any nicely structured preference profiles nearby? (Q2634484) (← links)
• On the kernelization of split graph problems (Q2636501) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
• On degree sequence optimization (Q2661577) (← links)
• Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
• Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)