Pages that link to "Item:Q1034100"

The following pages link to Almost 2-SAT is fixed-parameter tractable (Q1034100):

Displaying 11 items.

• Backdoors to q-Horn (Q261394) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
• Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
• Multi-budgeted directed cuts (Q786027) (← links)
• A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)