Gutin, Gregory Z.Gregory Z.GutinMnich, MatthiasMatthiasMnich2022-07-272022-07-272022arXiv: 2207.12278 (2022)http://hdl.handle.net/11420/13299We survey the field of algorithms and complexity for graph problems parameterized above or below guaranteed values, a research area which was pioneered by Venkatesh Raman. Those problems seek, for a given graph G, a solution whose value is at least g(G)+k or at most g(G)−k, where g(G) is a guarantee on the value that any solution on G takes. The goal is to design algorithms which find such solution in time whose complexity in k is decoupled from that in the guarantee, or to rule out the existence of such algorithms by means of intractability results. We discuss a large number of algorithms and intractability results, and complement them by several open problems.enhttp://rightsstatements.org/vocab/InC/1.0/MathematikPreprint10.15480/882.452710.48550/arXiv.2207.1227810.15480/882.45272207.12278Preprint