Publication:5417644
From MaRDI portal
zbMath1288.68099MaRDI QIDQ5417644
Stefan Szeider, Eun Jung Kim, Noga Alon, Gregory Gutin, Anders Yeo
Publication date: 22 May 2014
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Going Far from Degeneracy, Unnamed Item, Unnamed Item, Detours in directed graphs, Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables, Lower bounds on kernelization, Confronting intractability via parameters, A probabilistic approach to problems parameterized above or below tight bounds, Note on Max Lin-2 above average, Note on maximal bisection above tight lower bound, Betweenness parameterized above tight lower bound, Hitting Forbidden Minors: Approximation and Kernelization, Improved Parameterized Algorithms for above Average Constraint Satisfaction, Kernelization – Preprocessing with a Guarantee