Skip to contents

  1. Eder, Günther [Author]; Held, Martin [Author]; de Lorenzo, Stefan [Author]; Palfrader, Peter [Author] ; Günther Eder and Martin Held and Stefan de Lorenzo and Peter Palfrader [Contributor]

    Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)

    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, 2020

  2. Chan, Timothy M. [Author]; van Dijk, Thomas C. [Author]; Fleszar, Krzysztof [Author]; Spoerhase, Joachim [Author]; Wolff, Alexander [Author] ; Timothy M. Chan and Thomas C. van Dijk and Krzysztof Fleszar and Joachim Spoerhase and Alexander Wolff [Contributor]

    Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

    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, 2018

  3. Wagner, Andrea [Author] ; Tammer, Christiane [Degree supervisor]; Martinez-Legaz, Juan-Enrique [Degree supervisor]; Klamroth, Kathrin [Degree supervisor]

    A new duality based approach for the problem of locating a semi-obnoxious facility

    Books
    View online
    Close

    Bookmarks

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

    Halle, Saale: Universitäts- und Landesbibliothek Sachsen-Anhalt, 2015

  4. Fekete, Sándor P. [Author]; Krupke, Dominik [Author]; Perk, Michael [Author]; Rieck, Christian [Author]; Scheffer, Christian [Author] ; Sándor P. Fekete and Dominik Krupke and Michael Perk and Christian Rieck and Christian Scheffer [Contributor]

    The Lawn Mowing Problem: From Algebra to Algorithms

    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