Joachim Spoerhase - Citegraph

Author Info

Name	Affiliation	Papers
JOACHIM SPOERHASE	Lehrstuhl für Informatik I, Universität Würzburg, Würzburg, Germany	31
Collaborators	Citations	PageRank
53	112	14.12
Referers	Referees	References
268	629	328

Search Limit

100629

Publications (31 rows)

Collaborators (53 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Consistent Simplification of Polyline Tree Bundles	0	0.34	2021
PTAS for Steiner Tree on Map Graphs	0	0.34	2020
Approximating Node-Weighted k-MST on Planar Graphs	0	0.34	2020
Brief Announcement: Approximation Schemes for Geometric Coverage Problems.	0	0.34	2018
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.	0	0.34	2018
Approximating the Generalized Minimum Manhattan Network Problem.	0	0.34	2018
Approximation Schemes for Geometric Coverage Problems.	0	0.34	2018
Constant-Factor Approximation for Ordered k-Median.	5	0.49	2018
An Improved Approximation Algorithm for Knapsack Median Using Sparsification.	1	0.35	2018
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.	0	0.34	2018
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.	1	0.36	2016
Specialized Heuristics for the Controller Placement Problem in Large Scale SDN Networks	7	0.55	2015
Bi-factor approximation algorithms for hard capacitated k-median problems	1	0.35	2015
Colored Non-Crossing Euclidean Steiner Forest.	2	0.46	2015
Improved Approximation Algorithms for Box Contact Representations.	0	0.34	2014
On Monotone Drawings Of Trees	9	0.71	2014
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation	13	0.70	2013
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.	1	0.36	2013
Algorithms for Labeling Focus Regions	19	0.78	2012
Approximating Spanning Trees with Few Branches	1	0.38	2012
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks	0	0.34	2012
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs	2	0.37	2011
Drawing graphs with vertices at specified positions and crossings at large angles	4	0.42	2011
Maximum betweenness centrality: approximability and tractable cases	5	0.60	2011
Approximating Minimum Manhattan Networks in Higher Dimensions	2	0.41	2011
An Optimal Algorithm for the Indirect Covering Subtree Problem.	0	0.34	2010
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems	1	0.35	2010
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.	19	0.99	2009
Approximating (r, p)-Centroid on a Path	1	0.35	2008
Relaxed voting and competitive location on trees under monotonous gain functions	0	0.34	2007
Multiple voting location and single voting location on trees	18	1.08	2007