Dagstuhl Seminar Proceedings 09511

Parameterized complexity and approximation algorithms

E. D. Demaine, M. Hajiaghayi, D. Marx (Eds.)

published by LZI
Host

ISSN  1862 - 4405

Dagstuhl Seminar 09511, 13.12. - 17.12.2009
Additional Information
Seminar Homepage
License
Search Publication Server

Authors
  • Dell, Holger
  • Demaine, Erik D.
  • Fomin, Fedor V.
  • Golovach, Petr
  • Gupta, Anupam
  • Hajiaghayi, MohammadTaghi
  • Kortsarz, Guy
  • Ligett, Katrina
  • Marx, Dániel
  • McSherry, Frank
  • Nutov, Zeev
  • Roth, Aaron
  • Talwar, Kunal
  • Thilikos, Dimitrios M.
  • van Melkebeek, Dieter

  •   
    09511 Abstracts Collection -- Parameterized complexity and approximation algorithms
    Authors: Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel

    Abstract | Document (207 KB) | BibTeX

    09511 Executive Summary -- Parameterized complexity and approximation algorithms
    Authors: Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel

    Abstract | Document (56 KB) | BibTeX

    09511 Open Problems -- Parameterized complexity and approximation algorithms
    Authors: Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel

    Abstract | Document (184 KB) | BibTeX

    Approximating minimum cost connectivity problems
    Authors: Kortsarz, Guy ; Nutov, Zeev

    Abstract | Document (347 KB) | BibTeX

    Contraction Bidimensionality: the Accurate Picture
    Authors: Fomin, Fedor V. ; Golovach, Petr ; Thilikos, Dimitrios M.

    Abstract | Document (197 KB) | BibTeX

    Differentially Private Combinatorial Optimization
    Authors: Talwar, Kunal ; Gupta, Anupam ; Ligett, Katrina ; McSherry, Frank ; Roth, Aaron

    Abstract | Document (658 KB) | BibTeX

    Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
    Authors: Dell, Holger ; van Melkebeek, Dieter

    Abstract | Document (389 KB) | BibTeX

      




    DROPS-Home | Fulltext Search | Imprint
    Published by LZI