Skip to contents

  1. C. S., Karthik [Author]; Chalermsook, Parinya [Author]; Spoerhase, Joachim [Author]; Zehavi, Meirav [Author]; Herold, Martin [Author] ; Karthik C. S. and Parinya Chalermsook and Joachim Spoerhase and Meirav Zehavi and Martin Herold [Contributor]

    Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024

  2. Chakaravarthy, Venkatesan T. [Author]; Pandit, Vinayaka [Author]; Roy, Sambuddha [Author]; Sabharwal, Yogish [Author] ; Venkatesan T. Chakaravarthy and Vinayaka Pandit and Sambuddha Roy and Yogish Sabharwal [Contributor]

    Finding Independent Sets in Unions of Perfect Graphs

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2010

  3. Chuzhoy, Julia [Author]; Dalirrooyfard, Mina [Author]; Grinberg, Vadim [Author]; Tan, Zihan [Author] ; Julia Chuzhoy and Mina Dalirrooyfard and Vadim Grinberg and Zihan Tan [Contributor]

    A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023