piwik-script

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

    Priv.-Doz. Dr. habil. Joachim Spoerhase

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    97074 Würzburg
    Germany

    Room: E33

    Tel.: +49 (0) 931-31-84943
    Fax: +49 (0) 931-31-825200

    Email: joachim.spoerhase@uni-wuerzburg.de
    orcid.org/0000-0002-2601-6452

    Research

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

    Grants

    • DFG research project on "Approximation algorithms for combinatorial optimization problems with packing constraints" (SP 1468/3-1) for a three-year postdoc position

    Work in Committees


    Short CV

    • since August, 2018: Research fellow at the Department of Computer Science, Aalto University, Finland
    • since October 2017: Research associate (Akademischer Oberrat, A14) at Chair for Computer Science I, University of Würzburg (currently on a research leave)
    • July 2017: Habilitation at the Faculty of Mathematics and Computer Science, University of Würzburg
    • April 2017 - September 2017: Employment as postdoc at the Institute of Computer Science, University of Wrocław
    • July 2015 March 2017: Research associate (Akademischer Rat, A13) at Chair for Computer Science I, University of Würzburg
    • February 2015 - June 2015: Employment as postdoc at the Institute of Computer Science, University of Wrocław
    • August 2010 January 2015: Research associate (Akademischer Rat, A13) 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

    • Mizrachi, E., Schwartz, R., Spoerhase, J., Uniyal, S.: A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP'19) (2019).
       
    • 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). p. 620--631 (2018).
       
    • Fleszar, K., Mnich, M., Spoerhase, J.: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.Mathematical Programming.171,433--461 (2018).
       
    • 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).