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
Parents
7
Beyond worst-case analysis for joins with minesweeper
Hung Q. Ngo, Dung T. Nguyen, Christopher Ré et al. · 2014 · 43 citations
1–5 of 7
18
2
h-index
University at Buffalo, State University of New York, United States
1 publications · 43 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 18
11
TU Dortmund University
Dortmund, Germany
2 h-index
2 publications
229 citations

University of British Columbia
Vancouver, Canada
1 h-index
2 publications
34 citations
Queen Mary University of London
London, United Kingdom
1 h-index
1 publications
33 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
17 citations
Guangzhou University
Guangzhou, China
1 h-index
2 publications
66 citations
University of British Columbia, Okanagan Campus
Kelowna, Canada
1 h-index
2 publications
34 citations
Technische Universität Berlin
Berlin, Germany
1 h-index
1 publications
54 citations

Southwest Jiaotong University
Chengdu, China
1 h-index
3 publications
99 citations
1–8 of 11
2 publications · 229 citations
2
h-index
1 publications · 17 citations
1
h-index
1 publications · 54 citations
1
h-index
1 publications · 17 citations
1
h-index
TCCN · 1 publications · 33 citations
1
h-index
1–5