Pages that link to "Item:Q3637312"

The following pages link to Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312):

Displaying 14 items.

• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
• Separator-based data reduction for signed graph balancing (Q613659) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
• Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
• (Q5743380) (← links)
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)