Pages that link to "Item:Q2389218"

The following pages link to Additive approximation for edge-deletion problems (Q2389218):

Displaying 22 items.

• Efficient stabilization of cooperative matching games (Q526875) (← links)
• Additive approximation of generalized Turán questions (Q832525) (← links)
• Finding small stabilizers for unstable graphs (Q896265) (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
• Hardness of edge-modification problems (Q1034612) (← links)
• Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
• On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
• \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
• Strategyproof mechanisms for 2-facility location games with minimax envy (Q2039669) (← links)
• Strategyproof mechanisms for \(2\)-facility location games with minimax envy (Q2156318) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
• Hardness of fully dense problems (Q2643075) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• Edit distance measure for graphs (Q3466188) (← links)
• Graph Stabilization: A Survey (Q4689625) (← links)
• On the Query Complexity of Estimating the Distance to Hereditary Graph Properties (Q4992842) (← links)
• Estimating parameters associated with monotone properties (Q4993108) (← links)
• Many disjoint triangles in co-triangle-free graphs (Q4993125) (← links)
• Local-vs-global combinatorics (Q6198642) (← links)
• Complexity of near-3-choosability problem (Q6632143) (← links)
• Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)