2003

  • On the inapproximability of polynomial programming, the geometry of stable sets, and the power of relaxation
    A. Brieden, P. Gritzmann
    Discrete and Computational Geometry: The Goodman-Pollack Festschrift, 301 – 311, Springer, New York, 2003

  • On the approximability of (discrete) convex maximization and its contribution to the consolidation of farmland
    A. Brieden
    Habilitationsschrift, Fakultät für Mathematik, Technische Universität München, 193 Seiten