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

    Dr. Joachim Spoerhase

    Foto 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:

    Research

       

    • graph algorithms
    •  

    • combinatorial optimization
    •  

    • competitive location
    •  


    Short CV

    • 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., Gansner, E.R., Kaufmann, M., Kobourov, S.G., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica. 71, 36--52 (2015).
       
    • Knauer, M., Spoerhase, J.: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Algorithmica. 71, 797--811 (2015).
       
    • 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).
       
    Contact

    Universität Würzburg
    Sanderring 2
    97070 Würzburg

    Phone: +49 931 31-0
    Fax: +49 931 31-82600

    Find Contact

    Sanderring Röntgenring Hubland Nord Hubland Süd Campus Medizin