Concepedia

Parameterized Algorithms For Packing Problems

Parameterized Algorithms for Packing Problems is a systematic framework within parameterized algorithmics that addresses combinatorial packing problems by confining problem complexity to a specific parameter, thereby enabling efficient exact solutions when the parameter is fixed or small.

40

Publications

1.9K

Citations

80

Authors

55

Institutions

Publications per year

2017–2026

7

Parents

Publications

40

Packing directed circuits fractionally

Paul Seymour · COMBINATORICA · 1995 · 227 citations

, , +6

Mathematical model and efficient algorithms for object packing problem

N. Chernov, Yu. G. Stoyan · Computational Geometry · 2010 · 146 citations

, , +12

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

S�ndor P. Fekete, J�rg Schepers · Mathematical Methods of Operations Research · 2004 · 111 citations

, , +11

Improved approximations of packing and covering problems

Aravind Srinivasan · 1995 · 104 citations · Full text

, , +14

Robust dimension reduction, fusion frames, and Grassmannian packings

Gitta Kutyniok, Ali Pezeshki, Robert Calderbank · Applied and Computational Harmonic Analysis · 2008 · 98 citations

, , +11

1–5 of 40

Authors

80

  1. KJ
    Klaus Jansen

    Christian-Albrechts-Universität zu Kiel, Germany

    3 publications · 80 citations

    3

    h-index

  2. JC
    Jianer Chen

    Texas A&M University, United States

    3 publications · 159 citations

    3

    h-index

  3. TT
    Till Tantau

    University of Lübeck, Germany

    2 publications · 25 citations

    2

    h-index

  4. GZ
    Guochuan Zhang

    Zhejiang University, China

    2 publications · 26 citations

    2

    h-index

  5. MK
    Mikko Koivisto

    University of Helsinki, Finland

    2 publications · 120 citations

    2

    h-index

1–5 of 80

Institutions

55

  1. Zhejiang University

    Hangzhou, China

    3 h-index

    3 publications

    42 citations

  2. Texas A&M University

    College Station, United States

    3 h-index

    3 publications

    159 citations

  3. Central South University

    Changsha, China

    2 h-index

    8 publications

    336 citations

  4. University of Haifa

    Haifa, Israel

    2 h-index

    3 publications

    118 citations

  5. Aalto University

    Espoo, Finland

    2 h-index

    2 publications

    120 citations

  6. University of Lübeck

    Lübeck, Germany

    2 h-index

    6 publications

    75 citations

  7. Helsinki Institute for Information Technology

    Espoo, Finland

    2 h-index

    3 publications

    181 citations

  8. University of Warsaw

    Warsaw, Poland

    2 h-index

    3 publications

    87 citations

1–8 of 55

Venues

  1. Algorithmica

    4 publications · 138 citations

    4

    h-index

  2. Journal of Combinatorial Optimization

    3 publications · 77 citations

    3

    h-index

  3. Discrete Mathematics

    2 publications · 104 citations

    2

    h-index

  4. ACM Transactions on Algorithms

    TALG · 2 publications · 35 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 103 citations

    2

    h-index

1–5