Pages that link to "Item:Q2429325"

The following pages link to Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325):

Displaying 21 items.

• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
• Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
• Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
• On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
• (Q5091230) (← links)
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)