Parameterized Scheduling
Parameterized Scheduling is a computational scheduling framework that belongs to the class of parameterized algorithms, distinguished by its use of specific instance-related parameters to achieve fixed-parameter tractability in the context of makespan minimization problems.
19
Publications
481
Citations
42
Authors
28
Institutions
Publications per year
2017–2026
7
Parents
19
1–5 of 19
42
2
h-index
Institut de Recherche en Informatique et Systèmes Aléatoires, France
2 publications · 47 citations
2
h-index
2
h-index
Institut de Recherche en Informatique et Systèmes Aléatoires, France
2 publications · 47 citations
2
h-index
2
h-index
1–5 of 42
28
Novosibirsk State University
Novosibirsk, Russia
3 h-index
2 publications
91 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
7 publications
137 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
5 publications
78 citations
New York University
New York, United States
2 h-index
2 publications
42 citations
Technische Universität Berlin
Berlin, Germany
2 h-index
1 publications
26 citations
University of Oregon
Eugene, United States
2 h-index
2 publications
47 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
1 h-index
1 publications
65 citations
Maastricht University
Maastricht, The Netherlands
1 h-index
1 publications
65 citations
1–8 of 28
JOS · 2 publications · 43 citations
2
h-index
Repository · 1 publications · 28 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 33 citations
1
h-index
Repository · 1 publications · 18 citations
1
h-index
1–5