Pages that link to "Item:Q383833"

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

Displaying 50 items.

• Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
• Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
• FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
• Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
• The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
• Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
• Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
• Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
• Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
• On computing the Hamiltonian index of graphs (Q2699968) (← links)
• Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
• Group activity selection with few agent types (Q2701380) (← links)
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
• Parametrized complexity: New developments and research frontiers (Q2776269) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Capital Budgeting Problems: A Parameterized Point of View (Q2806927) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Faster Computation of Path-Width (Q2819521) (← links)
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
• Recognizing k-equistable Graphs in FPT Time (Q2827831) (← links)
• Parameterized complexity of discrete Morse theory (Q2828168) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
• A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
• The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
• Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
• Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
• Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
• Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
• Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
• Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)