Parameterized Graph Coloring

Parameterized Graph Coloring is a computational framework within graph theory that refines the classical graph coloring problem by analyzing its complexity and solvability in terms of a specific parameter, such as treewidth or vertex cover size, to enable fixed-parameter tractable algorithms.

12

Publications

406

Citations

27

Authors

23

Institutions

Publications per year

2017–2026

4

Authors

27

  1. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    3 publications · 96 citations

    3

    h-index

  2. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    2 publications · 91 citations

    2

    h-index

  3. JL
    Juho Lauri

    1 publications · 15 citations

    1

    h-index

  4. RC
    Rajesh Chitnis

    University of Maryland, College Park, United States

    1 publications · 21 citations

    1

    h-index

  5. DP
    Daniël Paulusma

    Durham University, United Kingdom

    1 publications · 34 citations

    1

    h-index

1–5 of 27

Venues

  1. Theoretical Computer Science

    3 publications · 127 citations

    3

    h-index

  2. Journal of Combinatorial Optimization

    1 publications · 23 citations

    1

    h-index

  3. SIAM Journal on Discrete Mathematics

    1 publications · 13 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 102 citations

    1

    h-index

  5. 1

    h-index

1–5