Pages that link to "Item:Q383833"

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

Displaying 50 items.

• Matrix Rigidity from the Viewpoint of Parameterized Complexity (Q4638994) (← links)
• Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
• On the Space Complexity of Parameterized Problems (Q4899254) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• (Q4993600) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• Kernelization of Whitney Switches (Q4997132) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
• How to Navigate Through Obstacles (Q5002723) (← links)
• Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
• Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
• Consensus strings with small maximum distance and small distance sum (Q5005095) (← links)
• (Q5005177) (← links)
• (Q5009471) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• (Q5009475) (← links)
• (Q5009477) (← links)
• Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
• (Q5009483) (← links)
• Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
• (Q5009486) (← links)
• A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
• (Q5009589) (← links)
• (Q5009615) (← links)
• Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
• (Q5015396) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• Computable Complex Analysis (Q5024570) (← links)
• Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
• Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
• On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
• On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
• Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
• Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
• As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
• Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
• Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
• Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
• Labelled well-quasi-order for permutation classes (Q5051473) (← links)
• Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
• Harary polynomials (Q5056203) (← links)
• On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) (Q5062116) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• (Q5075791) (← links)