piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms, Complexity, and Knowledge-Based Systems

    Priv.-Doz. Dr. habil. Joachim Spoerhase

    Research

    • graph algorithms
    • approximation algorithms
    • combinatorial optimization
    • clustering and location
    • network design

    Work in Committees


    Short CV

    • July 2017: Habilitation at the Faculty of Mathematics and Computer Science, University of Würzburg
    • since August 2010: Postdoc at Chair for Computer Science I, University of Würzburg
    • June 2010: PhD in Computer Science, University of Würzburg
    • July 2006 – August 2010: research assistant at Chair for Computer Science I, University of Würzburg
    • till July 2006: studies of computer science at Universität Würzburg

    Key Publications

    • Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 80, 1170--1190 (2018).
       
    • Byrka, J., Sornat, K., Spoerhase, J.: Constant-Factor Approximation for Ordered k-Median. Proc. 50th Annual ACM Symposium on the Theory of Computing (STOC'18) (2018).
       
    • Fleszar, K., Mnich, M., Spoerhase, J.: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. Mathematical Programming. (2017).
       
    • Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'15) (2015).
       
    • Spoerhase, J., Wirth, H.-C.: Relaxed Voting and Competitive Location under Monotonous Gain Functions on Trees. Discrete Applied Mathematics. 158, 361--373 (2010).
       
    • Spoerhase, J., Wirth, H.-C.: \($(r,p)$\)-Centroid problems on Paths and Trees. Theoretical Computer Science. 410, 5128--5137 (2009).
       

    Data privacy protection

    By clicking 'OK' you are leaving the web sites of the Julius-Maximilians-Universität Würzburg and will be redirected to Facebook. For information on the collection and processing of data by Facebook, refer to the social network's data privacy statement.

    Data privacy protection

    By clicking 'OK' you are leaving the web sites of the Julius-Maximilians-Universität Würzburg and will be redirected to Twitter. For information on the collection and processing of data by Facebook, refer to the social network's data privacy statement.

    Contact

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

    Phone: +49 931 31-85054
    Email

    Find Contact

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