Parameterizing Above Guarantee

Parameterizing Above Guarantee is a parameterized algorithmic paradigm that addresses optimization problems by measuring the parameter as the difference between the solution size and a guaranteed lower bound, thereby focusing on instances where the solution exceeds this intrinsic threshold.

5

Publications

508

Citations

6

Authors

3

Institutions

Publications per year

2017–2026

0

Authors

6

  1. MM
    Meena Mahajan

    Institute of Mathematical Sciences, India

    3 publications · 475 citations

    3

    h-index

  2. VR
    Venkatesh Raman

    Institute of Mathematical Sciences, India

    3 publications · 475 citations

    3

    h-index

  3. GP
    Geevarghese Philip

    Institute of Mathematical Sciences, India

    2 publications · 33 citations

    2

    h-index

  4. SG
    Shivam Garg

    San Diego State University, United States

    1 publications · 18 citations

    1

    h-index

  5. SG
    Shivam Garg

    Indian Institute of Technology Bombay, India

    1 publications · 15 citations

    1

    h-index

1–5 of 6

Institutions

3

  1. Institute of Mathematical Sciences

    Chennai, India

    2 h-index

    5 publications

    1K citations

  2. Chennai Mathematical Institute

    Chennai, India

    2 h-index

    2 publications

    33 citations

  3. Indian Institute of Technology Bombay

    Mumbai, India

    2 h-index

    2 publications

    33 citations

1–3 of 3

Venues

  1. MPG.PuRe (Max Planck Society)

    Repository · 1 publications · 15 citations

    1

    h-index

  2. Journal of Algorithms

    1 publications · 310 citations

    1

    h-index

  3. Journal of Computer and System Sciences

    1 publications · 140 citations

    1

    h-index

1–3