Bounded Search Trees

Bounded Search Trees is a parameterized algorithm design technique that belongs to the class of branching algorithms, distinguished by its systematic exploration of a polynomially bounded search tree whose depth and branching factor are controlled by the parameter to achieve fixed-parameter tractability.

7

Publications

393

Citations

18

Authors

11

Institutions

Publications per year

2017–2026

1

Authors

18

  1. CW
    Carsten Witt

    Technical University of Denmark, Denmark

    2 publications · 229 citations

    2

    h-index

  2. AR
    Atri Rudra

    University at Buffalo, State University of New York, United States

    1 publications · 43 citations

    1

    h-index

  3. AN
    Arumugam Nallanathan

    Queen Mary University of London, United Kingdom

    1 publications · 33 citations

    1

    h-index

  4. JU
    Johannes Uhlmann

    Friedrich Schiller University Jena, Germany

    1 publications · 54 citations

    1

    h-index

  5. YG
    Yong Gao

    Peking University, China

    1 publications · 17 citations

    1

    h-index

1–5 of 18

Venues

  1. Evolutionary Computation

    2 publications · 229 citations

    2

    h-index

  2. 1

    h-index

  3. SIAM Journal on Discrete Mathematics

    1 publications · 54 citations

    1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5