Pages that link to "Item:Q383833"

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

Displaying 50 items.

• Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
• Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
• Structured proportional representation (Q1686072) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
• A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Parameterized complexity of team formation in social networks (Q1704854) (← links)
• Corrigendum to: ``Advice classes of parameterized tractability'' (Q1706270) (← links)
• Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic (Q1711514) (← links)
• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
• Computational complexity aspects of point visibility graphs (Q1720342) (← links)
• Backdoors for linear temporal logic (Q1725638) (← links)
• Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
• Approximate inference in Bayesian networks: parameterized complexity results (Q1726381) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
• Co-clustering under the maximum norm (Q1736769) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
• A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
• Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
• Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
• FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
• The complexity of routing with collision avoidance (Q1741493) (← links)
• \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
• Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
• On two extensions of equimatchable graphs (Q1751251) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
• Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
• Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
• \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
• The Turing way to parameterized complexity (Q1877697) (← links)
• On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
• The complexity of finding small separators in temporal graphs (Q2009634) (← links)