Turán’s Theorem Through Algorithmic Lens

Cites Work

Reducibility among combinatorial problems
Parameterizing above or below guaranteed values
Clique is hard to approximate within \(n^{1-\epsilon}\)
Which problems have strongly exponential complexity?
Parameterizing above Guaranteed Values: MaxSat and MaxCut
Independent sets near the lower bound in bounded degree graphs
Parameterized algorithms
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Solving MAX-\(r\)-SAT above a tight lower bound
Kernelization Lower Bounds by Cross-Composition
The linear arrangement problem parameterized above guaranteed value
Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
Title not available (Why is that?)
Large independent sets in triangle-free planar graphs
Faster parameterized algorithms using linear programming
Vertex cover problem parameterized above and below tight bounds
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
Exact stability for Turán's theorem
Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
(Meta) kernelization
Kernelization. Theory of parameterized preprocessing
Exact algorithms for maximum independent set
Hamiltonicity below Dirac's condition
Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
Going far from degeneracy
Parameterized traveling salesman problem: beating the average

This page was built for publication: Turán’s Theorem Through Algorithmic Lens

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496554)