piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen und Komplexität

    Veröffentlichungen (nach Typ)

    Zeitschriftenartikel

    • Approximating Node-Weighted k-MST on Planar Graphs Byrka, Jarosław; Lewandowski, Mateusz; Spoerhase, Joachim in Theory of Computing Systems (2020).
    • Approximating the Generalized Minimum {Manhattan} Network Problem Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander in Algorithmica (2018). 80(4) 1170–1190.
    • An Improved Approximation Algorithm for Knapsack Median Using Sparsification Byrka, Jaros{l}aw; Pensyl, Thomas; Rybicki, Bartosz; Spoerhase, Joachim; Srinivasan, Aravind; Trinh, Khoa in Algorithmica (2018). 80(4) 1093–1114.
    • New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim in Mathematical Programming (2018). 171(1-2) 433–461.
    • Improved Approximation Algorithms for Box Contact Representations Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen G.; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Algorithmica (2017). 77(3) 902–920.
    • Approximating Minimum Manhattan Networks in Higher Dimensions Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen G.; Spoerhase, Joachim; Wolff, Alexander in Algorithmica (2015). 71(1) 36–52.
    • Approximating Spanning Trees with Few Branches Chimani, Markus; Spoerhase, Joachim in Theory Comput. Syst. (2015). 56(1) 181–196.
    • Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem Knauer, Martin; Spoerhase, Joachim in Algorithmica (2015). 71(4) 797–811.
    • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander in IEEE Transactions on Visualization and Computer Graphics (2013).
    • Algorithms for Labeling Focus Regions Fink, Martin; Haunert, Jan-Henrik; Schulz, Andr{’e}; Spoerhase, Joachim; Wolff, Alexander in IEEE Trans. Vis. Comput. Graph. (2012). 18(12) 2583–2592.
    • Relaxed Voting and Competitive Location under Monotonous Gain Functions on Trees Spoerhase, Joachim; Wirth, Hans-Christoph in Discrete Applied Mathematics (2010). 158(4) 361–373.
    • An {O(n (log n)^2 / log log n)} algorithm for the single maximum coverage location or the {(1,X_p)}-medianoid problem on trees Spoerhase, Joachim; Wirth, Hans-Christoph in Information Processing Letters (2009). 109(8) 391–394.
    • (r,p)-Centroid problems on Paths and Trees Spoerhase, Joachim; Wirth, Hans-Christoph in Theoretical Computer Science (2009). 410(47--49) 5128–5137.
    • Optimally Computing all Solutions of {S}tackelberg with Parametric Prices and of General Monotonous Gain Functions on a Tree Spoerhase, Joachim; Wirth, Hans-Christoph in Journal of Discrete Algorithms (2009). 7(2) 256–266.
    • Multiple Voting Location and Single Voting Location on Trees Noltemeier, Hartmut; Spoerhase, Joachim; Wirth, Hans-Christoph in European Journal of Operational Research (2007). 181(2) 654–667.

    Konferenzartikel

    • On Minimum Generalized Manhattan Connections Antoniadis, Antonios; Capretto, Margarita; Chalermsook, Parinya; Damerius, Christoph; Kling, Peter; Nölke, Lukas; Obscura, Nidia; Spoerhase, Joachim in Proc. 17th Algorithms and Data Structures Symposium (WADS’21) (2021). (Bd. 12808) 85–100.
    • Consistent Simplification of Polyline Tree Bundles Bosch, Yannick; Schäfer, Peter; Spoerhase, Joachim; Storandt, Sabine; Zink, Johannes in Proc. 27th International Computing and Combinatorics Conference (COCOON’21) (2021).
    • A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs Beyer, Stephan; Chimani, Markus; Spoerhase, Joachim in Proc. 26th International Computing and Combinatorics Conference (COCOON’20) (2020).
    • Simplification of Polyline Bundles Spoerhase, Joachim; Storandt, Sabine; Zink, Johannes in Proc. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20) (2020).
    • PTAS for Steiner Tree on Map Graphs Byrka, Jaroslaw; Lewandowski, Mateusz; Meesum, Syed Mohammad; Spoerhase, Joachim; Uniyal, Sumedha in Proc. 14th Latin American Theoretical Informatics Symposium (LATIN’20) (2020).
    • A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints Mizrachi, Eyal; Schwartz, Roy; Spoerhase, Joachim; Uniyal, Sumedha in Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP’19) (2019).
    • Stabbing Rectangles by Line Segments -- How Decomposition Reduces the Shallow-Cell Complexity Chan, Timothy M.; van Dijk, Thomas C.; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander in Proc. 29th International Symposium on Algorithms and Computation (ISAAC’18) (2018).
    • Approximating Node-Weighted k-{MST} on Planar Graphs Byrka, Jaros{l}aw; Lewandowski, Mateusz; Spoerhase, Joachim in Proc. 16th Workshop on Approximation and Online Algorithms (WAOA’18) (2018).
    • Approximation Schemes for Geometric Coverage Problems Chaplick, Steven; De, Minati; Ravsky, Alexander; Spoerhase, Joachim in Proc. 26th Annual European Symposium on Algorithms (ESA’18) (2018). (Bd. 112) 17:1–17:15.
    • Constant-Factor Approximation for Ordered k-Median Byrka, Jaroslaw; Sornat, Krzysztof; Spoerhase, Joachim in Proc. 50th Annual ACM Symposium on the Theory of Computing (STOC’18) (2018). 620–631.
    • New Algorithms for Disjoint Paths Based on Tree-Likeness Fleszar, Krzysztof; Mnich, Matthias; Spoerhase, Joachim in Proc. 24th European Symposium on Algorithms (ESA ’16) (2016). 42:1–42:17.
    • Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems Byrka, Jarosław; Fleszar, Krzysztof; Rybicki, Bartosz; Spoerhase, Joachim in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA’15) (2015).
    • Specialized Heuristics for the Controller Placement Problem in Large Scale {SDN} Networks Lange, Stanislav; Gebert, Steffen; Spoerhase, Joachim; Rygielski, Piotr; Zinner, Thomas; Kounev, Samuel; Tran{-}Gia, Phuoc in Proc. 27th International Teletraffic Congress (ITC’15) (2015). 210–218.
    • Colored Non-Crossing Euclidean Steiner Forest Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proc. 26th International Symposium on Algorithms and Computation (ISAAC’15) (2015). 429–441.
    • An Improved Approximation Algorithm for Knapsack Median Using Sparsification Byrka, Jaroslaw; Pensyl, Thomas; Rybicki, Bartosz; Spoerhase, Joachim; Srinivasan, Aravind; Trinh, Khoa in Proc. 23rd Annual European Symposium on Algorithms (ESA’15) (2015). 275–287.
    • Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees Chimani, Markus; Spoerhase, Joachim in Proc. 32nd Symp. Theoretical Aspects of Computer Science (STACS’15) (2015).
    • {Including Energy Efficiency Aspects in Multi-Layer Optical Network Design} Gebert, Steffen; Hock, David; Hartmann, Matthias; Spoerhase, Joachim; Zinner, Thomas; Tran-Gia, Phuoc in 5th International Conference on Communications and Electronics ({ICCE} 2014) (2014).
    • Improved Approximation Algorithms for Box Contact Representations Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen G.; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proc. 22th Annual European Symposium on Algorithms (ESA’14) (2014). 87–99.
    • Approximating the Generalized Minimum {M}anhattan Network Problem Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander in Proc. 24th Int. Symp. Alg. and Comp. (ISAAC’13) (2013). (Bd. 8283) 722–732.
    • Approximating Spanning Trees with Few Branches Chimani, Markus; Spoerhase, Joachim in Proc. 10th Workshop on Approximation and Online Algorithms (WAOA’12) (2012). 30–41.
    • Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles Fink, Martin; Haunert, Jan-Henrik; Mchedlidze, Tamara; Spoerhase, Joachim; Wolff, Alexander in Proc. 6th International Workshop Algorithms and Computation (WALCOM’12) (2012). 186–197.
    • Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs Schwartges, Nadine; Spoerhase, Joachim; Wolff, Alexander in Proc. 9th Workshop on Approximationand Online Algorithms (WAOA’11) (2011).
    • Approximating Minimum Manhattan Networks in Higher Dimensions Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen G.; Spoerhase, Joachim; Wolff, Alexander in Proceedings of the 19th Annual European Symposium on Algorithms (ESA’11) (2011). (Bd. 6942) 49–60.
    • Maximum Betweenness Centrality: Approximability and Tractable Cases Fink, Martin; Spoerhase, Joachim in Proc. 5th Workshop on Algorithms and Computation (WALCOM’11) (2011). 9–20.
    • An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems Spoerhase, Joachim in Proc. 21st International Symposium on Algorithms and Computation (ISAAC’10) (2010). 440–450.
    • Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem Knauer, Martin; Spoerhase, Joachim in Proc. 11th Algorithms and Data Structures Symposium (WADS’09) (2009). 459–470.
    • Approximating (r,p)-centroid on a path Spoerhase, Joachim; Wirth, Hans-Christoph in Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW’08) (2008).
    • Security Score, Plurality Solution, and {N}ash Equilibrium in Multiple Location Problems Spoerhase, Joachim; Wirth, Hans-Christoph in 20th European Chapter on Combinatorial Optimization (ECCO’07) (2007).
    • Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions Spoerhase, Joachim; Wirth, Hans-Christoph in 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW’07) (2007).

    Dissertation

    • Competitive and Voting Location Spoerhase, Joachim PhD thesis, Universität Würzburg. (2010).