Pages that link to "Item:Q3499744"

The following pages link to Kernels: Annotated, Proper and Induced (Q3499744):

Displaying 19 items.

• A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
• Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
• A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
• Approximability of clique transversal in perfect graphs (Q724231) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• Meta-kernelization with structural parameters (Q896025) (← links)
• Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
• Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Parameterized mixed graph coloring (Q2424815) (← links)
• A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
• A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
• Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
• Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)