Meta-theorems In Parameterized Complexity

Meta-Theorems in Parameterized Complexity is a theoretical framework in parameterized algorithmics that identifies broad syntactic or structural properties of computational problems—such as definability in a certain logic or sparsity of underlying graphs—enabling the derivation of uniform fixed-parameter tractability results for entire problem classes based on these shared characteristics.

16

Publications

892

Citations

40

Authors

30

Institutions

Publications per year

2017–2026

1

Authors

40

  1. FV
    Fedor V. Fomin

    University of Bergen, Norway

    4 publications · 315 citations

    4

    h-index

  2. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    4 publications · 337 citations

    4

    h-index

  3. DM
    Dimitrios M. Thilikos

    National and Kapodistrian University of Athens, Greece

    3 publications · 292 citations

    3

    h-index

  4. HL
    Hans L. Bodlaender

    Utrecht University, Netherlands

    3 publications · 292 citations

    3

    h-index

  5. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    3 publications · 292 citations

    3

    h-index

1–5 of 40

Venues

  1. Theoretical Computer Science

    3 publications · 99 citations

    3

    h-index

  2. The Computer Journal

    2 publications · 39 citations

    2

    h-index

  3. Journal of Computer and System Sciences

    1 publications · 23 citations

    1

    h-index

  4. Discrete Applied Mathematics

    1 publications · 16 citations

    1

    h-index

  5. 1

    h-index

1–5