Multivariate Parameterized Algorithms
Multivariate Parameterized Algorithms is a parameterized algorithmic framework that simultaneously incorporates multiple independent parameters to analyze computational tractability, distinguishing itself from univariate approaches by enabling a more granular complexity assessment through the joint dependency on several structural or numerical input measures.
4
Publications
327
Citations
9
Authors
5
Institutions
Publications per year
2017–2026
0
Parents
4
Multivariate Algorithmics for NP-Hard String Problems
Laurent Bulteau, Falk Hüffner, Christian Komusiewicz et al. · 2014 · 35 citations · Full text
1–4 of 4
9
3
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 9
5
Institut Für Angewandte Kulturforschung
Göttingen, Germany
1 h-index
1 publications
117 citations

Charles Darwin University
Darwin, Australia
1 h-index
2 publications
208 citations
Helmholtz Institute Jena
Jena, Germany
1 h-index
1 publications
71 citations
Friedrich Schiller University Jena
Jena, Germany
1 h-index
2 publications
142 citations
Utrecht University
Utrecht, The Netherlands
1 h-index
1 publications
104 citations
1–5 of 5
1 publications · 104 citations
1
h-index
Repository · 1 publications · 117 citations
1
h-index
1–2