Pages that link to "Item:Q876698"

The following pages link to An efficient fixed-parameter algorithm for 3-hitting set (Q876698):

Displaying 37 items.

• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
• Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
• An improved upper bound for SAT (Q820534) (← links)
• Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
• A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
• A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
• On problems without polynomial kernels (Q1034099) (← links)
• Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
• The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
• Call control with \(k\) rejections (Q1877703) (← links)
• A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
• Temporal vertex cover with a sliding time window (Q2009637) (← links)
• Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
• Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Parameterizations of hitting set of bundles and inverse scope (Q2344004) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
• There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (Q2875538) (← links)
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
• A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
• Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
• THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
• (Q5089171) (← links)
• 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)