Author:
Crowston Robert,Gutin Gregory,Jones Mark
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. N. Alon, G. Gutin, E.J. Kim, S. Szeider, A. Yeo, Solving MAX-r-SAT above a tight lower bound, in: Proc. SODA 2010, pp. 511–517
2. Parameterized Complexity;Downey,1999
3. Parameterized Complexity Theory;Flum,2006
4. A probabilistic approach to problems parameterized above tight lower bound;Gutin,2009
5. The linear arrangement problem parameterized above guaranteed value;Gutin;Theory Comput. Syst.,2007
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the complexity of and solutions to the minimum stopping and trapping set problems;Theoretical Computer Science;2022-05
2. Index;Kernelization;2018-12-31
3. Author Index;Kernelization;2018-12-31
4. Problem Definitions;Kernelization;2018-12-31
5. Graphs and SAT Notation;Kernelization;2018-12-31