Birs- 15w5118: Approximation Algorithms and Parameterized Complexity

  1. Title:
    Fixed-Parameter Tractability and Approximability: A Survey of Connections

    Speaker:

    Link:

  2. Title:
    Complexity and Approximability of Parameterized CSP

    Speaker:

    Link:

  3. Title:
    FPT approximation schemes for Shift Bribery

    Speaker:

    Link:

  4. Title:
    Balanced Optimization with vector costs

    Speaker:

    Link:

  5. Title:
    A brief introduction to kernelization

    Speaker:

    Link:

  6. Title:
    Using Parameterization to Move Approximation into Problem Legislation

    Speaker:

    Link:

  7. Title:
    Estimating The Makespan of The Two-Valued Restricted Assignment Problem

    Speaker:

    Link:

  8. Title:
    A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem

    Speaker:

    Link:

  9. Title:
    Lower bounds on the running time for packing and scheduling problems

    Speaker:

    Link:

  10. Title:
    A Fully Polynomial (3/2 + ∈)-Approximation for Scheduling Monotone Moldable Jobs

    Speaker:

    Link:

  11. Title:
    An O(log m)-Competitive Algorithm for Online Machine Minimization

    Speaker:

    Link:

  12. Title:
    Packing group items

    Speaker:

    Link:

  13. Title:
    Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments

    Speaker:

    Link:

  14. Title:
    Fully Dynamic Bin Packing Revisited

    Speaker:

    Link:

  15. Title:
    Maximum Spanning k-Tree: A Case Study

    Speaker:

    Link:

  16. Title:
    The FPT wiki

    Speaker:

    Link:

  17. Title:
    Multi-Clique-Width, a Powerful New Width Parameter

    Speaker:

    Link:

  18. Title:
    On Temporal Graph Exploration

    Speaker:

    Link: