The following pages link to Edge-Deletion Problems (Q3921260):
Displaying 50 items.
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Matching interdiction (Q602686) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Edge-contraction problems (Q794164) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- The complexity of the reliable connectivity problem (Q1183401) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Composition of graphs and the triangle-free subgraph polytope (Q1810860) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\) (Q1900147) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- A spectral method for bipartizing a network and detecting a large anti-community (Q1989180) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Properties of \(\pi\)-skew graphs with applications (Q2025257) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- On the skewness of Cartesian products with trees (Q2322877) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
