Branching Algorithms

Branching Algorithms is a design paradigm in parameterized algorithms that solves problems by recursively reducing an instance to smaller instances through systematic case analysis, distinguished by its use of branching rules to explore solution spaces based on parameterized subproblems.

214

Publications

10.6K

Citations

427

Authors

227

Institutions

Publications per year

2017–2026

45

Authors

427

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    9 publications · 561 citations

    9

    h-index

  2. FV
    Fedor V. Fomin

    University of Bergen, Norway

    7 publications · 330 citations

    7

    h-index

  3. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    6 publications · 381 citations

    6

    h-index

  4. VR
    Venkatesh Raman

    Institute of Mathematical Sciences, India

    5 publications · 274 citations

    5

    h-index

  5. AL
    Andrea Lodi

    University of Bologna, Italy

    5 publications · 304 citations

    5

    h-index

1–5 of 427

Venues

  1. European Journal of Operational Research

    9 publications · 449 citations

    9

    h-index

  2. Journal of Computer and System Sciences

    8 publications · 603 citations

    8

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 7 publications · 504 citations

    7

    h-index

  4. INFORMS journal on computing

    6 publications · 454 citations

    6

    h-index

  5. arXiv (Cornell University)

    Repository · 6 publications · 107 citations

    6

    h-index

1–5