Joachim Spoerhase Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Knauer, Joachim Spoerhase: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. WADS 2009: 459-470
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Spoerhase, Hans-Christoph Wirth: An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. Inf. Process. Lett. 109(8): 391-394 (2009)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Spoerhase, Hans-Christoph Wirth: Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. J. Discrete Algorithms 7(2): 256-266 (2009)
2008
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Spoerhase, Hans-Christoph Wirth: Approximating (r, p)-Centroid on a Path. CTW 2008: 193-195
2007
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Spoerhase, Hans-Christoph Wirth: Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth: Multiple voting location and single voting location on trees. European Journal of Operational Research 181(2): 654-667 (2007)

Coauthor Index

1Martin Knauer [6]
2Hartmut Noltemeier [1]
3Hans-Christoph Wirth [1] [2] [3] [4] [5]

Colors in the list of coauthors

Copyright © Sat Dec 19 20:34:11 2009 by Michael Ley (ley@uni-trier.de)