Dipl.-Inform. Joachim Spoerhase

Lehrstuhl für Informatik I Universität Würzburg Am Hubland 97074 Würzburg Germany
Phone: +49 931 888 49 43 E-Mail: spoerhase@informatik.uni-wuerzburg.de

Teaching

Lectures

Exercises

Seminars

Research Interests

Publications

(r,p)-Centroid Problems on Paths and Trees J. Spoerhase, H.-C. Wirth Tech. Report no. 441, University of Würzburg, Department of Computer Science, 2008
Optimally Computing all Solutions of Stackelberg with Parametric Prices and of General Monotonous Gain Functions on a Tree J. Spoerhase, H.-C. Wirth to appear in Journal of Discrete Algorithms, 2008
Relaxed Voting and Competitive Location on Trees under Monotonous Gain Functions J. Spoerhase, H.-C. Wirth submitted to Discrete Applied Mathematics, 2007
An O(n(log n)2/ log log n) Algorithm for the Single Maximum Coverage Location Problem on Trees J. Spoerhase, H.-C. Wirth submitted to Information Processing Letters, 2007
Multiple Voting Location and Single Voting Location on Trees H. Noltemeier, J. Spoerhase, H.-C. Wirth European Journal of Operations Research 181 (2007), 654–667

Conferences

Approximating (r,p)-Centroid on a Path J. Spoerhase, H.-C. Wirth CTW 2008
Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions J. Spoerhase, H.-C. Wirth CTW 2007
Security Score, Plurality Solution, and Nash Equilibrium in Multiple Location Problems J. Spoerhase, H.-C. Wirth ECCO XX, 2007

Last Change 2008-05-16: spoerhase@informatik.uni-wuerzburg.de