Intern
    Lehrstuhl für Informatik I - Algorithmen, Komplexität und wissensbasierte Systeme

    Refereed Conference Papers

    • Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
      Christian Glaßer, Maximilian Witek.
      39th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2014.
      Lecture Notes in Computer Science 8635, pages 311-323, Springer-Verlag 2014.
    • Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
      Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek.
      40th International Colloquium on Automata, Languages and Programming (ICALP), 2013.
      Lecture Notes in Computer Science 7965, pages 473-484, Springer-Verlag 2013.
    • Structural Complexity of Multiobjective NP Search Problems
      Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek.
      Latin American Symposium on Theoretical Informatics (LATIN), 2012.
      Lecture Notes in Computer Science 7256, pages 338-349, Springer-Verlag 2012.
    • Applications of Discrepancy Theory in Multiobjective Approximation
      Christian Glaßer, Christian Reitwießner, Maximilian Witek.
      Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2011.
      LIPIcs 13, pages 55-65, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
    • Approximability and Hardness in Multi-Objective Optimization
      Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek.
      Computability in Europe (CiE), 2010.
      Lecture Notes in Computer Science 6158, pages 180-189, Springer-Verlag 2010.

    Technical Reports

    • Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
      Christian Glaßer, Maximilian Witek.
      Electronic Colloquium on Computational Complexity, Report TR13-188, December 2013.
      PDF
    • Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
      Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek.
      Electronic Colloquium on Computational Complexity, Report TR13-047, March 2013.
      PDF
    • Applications of Discrepancy Theory in Multiobjective Approximation
      Christian Glaßer, Christian Reitwießner, Maximilian Witek.
      Computing Research Repository CoRR, arXiv:1107.0634v1 [cs.DS], July 2011.
      PDF
    • The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions
      Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek.
      Electronic Colloquium on Computational Complexity, Report TR11-053, April 2011.
      PDF
    • Balanced Combinations of Solutions in Multi-Objective Optimization
      Christian Glaßer, Christian Reitwießner, Maximilian Witek.
      Computing Research Repository CoRR, arXiv:1007.5475v1 [cs.DS], July 2010.
      PDF
    • Hardness and Approximability in Multi-Objective Optimization
      Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek.
      Electronic Colloquium on Computational Complexity, Report TR10-031, March 2010.
      PDF
    • Improved and Generalized Approximations for Two-Objective Traveling Salesman
      Christian Glaßer, Christian Reitwießner, Maximilian Witek.
      Electronic Colloquium on Computational Complexity, Report TR09-076-1, March 2010.
      PDF

    Theses

    • Multiobjective Combinatorial Optimization and Approximation
      Maximilian Witek.
      Master thesis, Fachhochschule Trier, November 2008.
    • Analyse der Subwort-Relation und Strukturuntersuchung endlicher Automaten
      Maximilian Witek.
      Bachelor thesis, Fachhochschule Trier, October 2005.
    Kontakt

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Tel.: +49 931 31-85054
    E-Mail

    Suche Ansprechpartner

    Hubland Süd, Geb. Z8 Hubland Süd, Geb. M2