This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algorithms 41(2):280–301
Courcelle B (1990) The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inf Comput 85:12–75
Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Cham. http://www.springer.com/us/book/9783319212746
Fellows MR, Lokshtanov D, Misra N, Rosamond FA, Saurabh S (2008) Graph layout problems parameterized by vertex cover. In: 19th international symposium on algorithms and computation (ISAAC). Lecture notes in computer science, vol 5369. Springer, Berlin, pp 294–305
Fellows M, Lokshtanov D, Misra N, Mnich M, Rosamond F, Saurabh S (2009) The complexity ecology of parameters: an illustration using bounded max leaf number. ACM Trans Comput Syst 45:822–848
Fellows MR, Jansen BMP, Rosamond FA (2013) Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur J Comb 34(3):541–566
Ganian R, Hlinený P, Kneis J, Meister D, Obdrzálek J, Rossmanith P, Sikdar S (2010) Are there any good digraph width measures? In: IPEC, vol 6478. Springer, Berlin, pp 135–146
Ganian R, Slivovsky F, Szeider S (2013) Meta-kernelization with structural parameters. In: 38th international symposium on mathematical foundations of computer science, MFCS 2013. Lecture notes in computer science, vol 8087. Springer, Heidelberg, pp 457–468
Gaspers S, Szeider S (2012) Backdoors to satisfaction. In: Bodlaender HL, Downey R, Fomin FV, Marx D (eds) The multivariate algorithmic revolution and beyond. Lecture notes in computer science, vol 7370. Springer, Berlin/Heidelberg, pp 287–317
Grohe M, Kreutzer S (2011) Methods for algorithmic meta theorems. In: Grohe M, Makowsky J (eds) Model theoretic methods in finite combinatorics. Contemporary mathematics, vol 558. American Mathematical Society, Providence, pp 181–206
Henglein F, Mairson HG (1991) The complexity of type inference for higher-order typed lambda calculi. J Funct Program 4:119–130
Lokshtanov D, Narayanaswamy NS, Raman V, Ramanujan MS, Saurabh S (2014) Faster parameterized algorithms using linear programming. ACM Trans Algorithms 11(2):15:1–15:31
Mahajan M, Raman V (1999) Parameterizing above guaranteed values: maxsat and maxcut. J Algorithms 31(2):335–354
Marx D, Pilipczuk M (2014) Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). In: 31st international symposium on theoretical aspects of computer science (STACS), Lyon, pp 542–553
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Misra, N. (2016). Alternate Parameterizations. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_786
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_786
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering