Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating Minimum Manhattan Networks in Higher Dimensions.

A. Das, E. Gansner, M. Kaufmann, S. Kobourov, J. Spoerhase, and A. Wolff. Algorithmica, 71 (1): 36-52 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

PD Dr. phil. Joachim Wündisch University of Stuttgart

Dr. Joachim Pfeiffer University of Stuttgart

Hon. -Prof. Dr. -Ing. Joachim Birk University of Stuttgart

Prof. Dr. -Ing. Joachim Speidel University of Stuttgart

Univ. -Prof. Dr. -Ing. Joachim Groß University of Stuttgart

Other publications of authors with the same name

Approximating the Generalized Minimum Manhattan Network Problem.A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Algorithmica, 80 (4): 1170-1190 (2018)Algorithms for Labeling Focus Regions.M. Fink, J. Haunert, A. Schulz, J. Spoerhase, and A. Wolff. IEEE Trans. Vis. Comput. Graph., 18 (12): 2583-2592 (2012)Maximum Betweenness Centrality: Approximability and Tractable CasesM. Fink, and J. Spoerhase. CoRR, (2010)A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.J. Byrka, K. Fleszar, B. Rybicki, and J. Spoerhase. CoRR, (2013)Competitive and voting location.J. Spoerhase. Julius Maximilian University of Würzburg, (2010)An Improved Approximation Algorithm for Knapsack Median Using Sparsification.J. Byrka, T. Pensyl, B. Rybicki, J. Spoerhase, A. Srinivasan, and K. Trinh. Algorithmica, 80 (4): 1093-1114 (2018)Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.M. Knauer, and J. Spoerhase. Algorithmica, 71 (4): 797-811 (2015)Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.J. Spoerhase, and H. Wirth. J. Discrete Algorithms, 7 (2): 256-266 (2009)Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.M. Fink, J. Haunert, T. Mchedlidze, J. Spoerhase, and A. Wolff. Graph Drawing, volume 7034 of Lecture Notes in Computer Science, page 441-442. Springer, (2011)On Monotone Drawings of Trees.P. Kindermann, A. Schulz, J. Spoerhase, and A. Wolff. Graph Drawing, volume 8871 of Lecture Notes in Computer Science, page 488-500. Springer, (2014)

PUMA

Disambiguation of "Spoerhase, Joachim"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating Minimum Manhattan Networks in Higher Dimensions.

Please choose a person to relate this publication to

PD Dr. phil. Joachim Wündisch University of Stuttgart

Dr. Joachim Pfeiffer University of Stuttgart

Hon. -Prof. Dr. -Ing. Joachim Birk University of Stuttgart

Prof. Dr. -Ing. Joachim Speidel University of Stuttgart

Univ. -Prof. Dr. -Ing. Joachim Groß University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Spoerhase, Joachim"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Approximating Minimum Manhattan Networks in Higher Dimensions.

Please choose a person to relate this publication to

PD Dr. phil. Joachim Wündisch University of Stuttgart

Dr. Joachim Pfeiffer University of Stuttgart

Hon. -Prof. Dr. -Ing. Joachim Birk University of Stuttgart

Prof. Dr. -Ing. Joachim Speidel University of Stuttgart

Univ. -Prof. Dr. -Ing. Joachim Groß University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Approximating Minimum Manhattan Networks in Higher Dimensions.