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

Authors

42

  1. NT
    Nimrod Talmon

    Ben-Gurion University of the Negev, Israel

    1 publications · 31 citations

    2

    h-index

  2. PQ
    Patrice Quinton

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    2 publications · 47 citations

    2

    h-index

  3. DS
    Dvir Shabtay

    Ben-Gurion University of the Negev, Israel

    2 publications · 42 citations

    2

    h-index

  4. CM
    Christophe Mauras

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    2 publications · 47 citations

    2

    h-index

  5. RV
    René van Bevern

    Technische Universität Berlin, Germany

    1 publications · 65 citations

    2

    h-index

1–5 of 42

Venues

  1. Journal of Scheduling

    JOS · 2 publications · 43 citations

    2

    h-index

  2. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 1 publications · 28 citations

    1

    h-index

  3. Algorithmica

    1 publications · 11 citations

    1

    h-index

  4. Acta Informatica

    1 publications · 33 citations

    1

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 18 citations

    1

    h-index

1–5