Turán’s Theorem Through Algorithmic Lens

Cites work

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

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)