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

    Publikationen

    [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2013 ] [ 2012 ] [ 2011 ] [ 2010 ] [ 2009 ] [ 2008 ] [ 2007 ]

    2017 [ nach oben ]

    • Byrka, J., Pensyl, T., Rybicki, B., Spoerhase, J., Srinivasan, A., Trinh, K.: An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica. (2017).
       
    • Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S.G., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. Algorithmica. 77, 902--920 (2017).
       
    • Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. (2017).
       

    2016 [ nach oben ]

    • Krzysztof Fleszar, M.M.: New Algorithms for Disjoint Paths Based on Tree-Likeness. Proc. 24th European Symposium on Algorithms (ESA '16) (2016).
       

    2015 [ nach oben ]

    • Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S.G., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica. 71, 36--52 (2015).
       
    • Chimani, M., Spoerhase, J.: Approximating Spanning Trees with Few Branches. Theory Comput. Syst. 56, 181--196 (2015).
       
    • Knauer, M., Spoerhase, J.: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Algorithmica. 71, 797--811 (2015).
       
    • Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored Non-Crossing Euclidean Steiner Forest. Proc. 26th International Symposium on Algorithms and Computation (ISAAC 2015) (2015).
       
    • Byrka, J., Pensyl, T., Rybicki, B., Spoerhase, J., Srinivasan, A., Trinh, K.: An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Proc. 23rd Annual European Symposium on Algorithms (ESA'15). S. 275--287 (2015).
       
    • Chimani, M., Spoerhase, J.: Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees. Proc. 32nd Symp. Theoretical Aspects of Computer Science (STACS'15) (2015).
       
    • Byrka, J., Fleszar, K., Rybicki, B., Spoerhase, J.: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'15) (2015).
       

    2014 [ nach oben ]

    • Gebert, S., Hock, D., Hartmann, M., Spoerhase, J., Zinner, T., Tran-Gia, P.: Including Energy Efficiency Aspects in Multi-Layer Optical Network Design. 5th International Conference on Communications and Electronics (ICCE 2014). , Da Nang, Vietnam (2014).
       
    • Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S.G., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. Proc. 22th Annual European Symposium on Algorithms (ESA'14). S. 87--99 (2014).
       

    2013 [ nach oben ]

    • Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Proc. 24th Int. Symp. Alg. and Comp. (ISAAC'13). S. 722--732 (2013).
       
    • Fink, M., Haunert, J.-H., Spoerhase, J., Wolff, A.: Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. IEEE Transactions on Visualization and Computer Graphics. (2013).
       

    2012 [ nach oben ]

    • Fink, M., Haunert, J.-H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18, 2583-2592 (2012).
       
    • Fink, M., Haunert, J.-H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Proc. 6th International Workshop Algorithms and Computation (WALCOM'12). S. 186-197 (2012).
       
    • Chimani, M., Spoerhase, J.: Approximating Spanning Trees with Few Branches. Proc. 10th Workshop on Approximation and Online Algorithms (WAOA'12). S. 30-41 (2012).
       

    2011 [ nach oben ]

    • Schwartges, N., Spoerhase, J., Wolff, A.: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. Proc. 9th Workshop on Approximationand Online Algorithms (WAOA '11) (2011).
       
    • Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S.G., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. Proceedings of the 19th Annual European Symposium on Algorithms (ESA '11). S. 49-60 (2011).
       
    • Fink, M., Spoerhase, J.: Maximum Betweenness Centrality: Approximability and Tractable Cases. Proc. 5th Workshop on Algorithms and Computation (WALCOM'11). S. 9-20 (2011).
       

    2010 [ nach oben ]

    • Spoerhase, J.: An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems. Proc. 21st International Symposium on Algorithms and Computation (ISAAC'10). S. 440-450 (2010).
       
    • Spoerhase, J.: Competitive and Voting Location, http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-52978, (2010).
       
    • Spoerhase, J., Wirth, H.-C.: Relaxed Voting and Competitive Location under Monotonous Gain Functions on Trees. Discrete Applied Mathematics. 158, 361--373 (2010).
       

    2009 [ nach oben ]

    • Spoerhase, J., Wirth, H.-C.: 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. Information Processing Letters. 109, 391--394 (2009).
       
    • Spoerhase, J., Wirth, H.-C.: \($(r,p)$\)-Centroid problems on Paths and Trees. Theoretical Computer Science. 410, 5128--5137 (2009).
       
    • Spoerhase, J., Wirth, H.-C.: Optimally Computing all Solutions of Stackelberg with Parametric Prices and of General Monotonous Gain Functions on a Tree. Journal of Discrete Algorithms. 7, 256--266 (2009).
       
    • Knauer, M., Spoerhase, J.: Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem. Proc. 11th Algorithms and Data Structures Symposium (WADS'09). S. 459-470 (2009).
       

    2008 [ nach oben ]

    • Spoerhase, J., Wirth, H.-C.: Approximating \($(r,p)$\)-centroid on a path. Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'08) (2008).
       

    2007 [ nach oben ]

    • Spoerhase, J., Wirth, H.-C.: Security Score, Plurality Solution, and Nash Equilibrium in Multiple Location Problems. 20th European Chapter on Combinatorial Optimization (ECCO'07) (2007).
       
    • Spoerhase, J., Wirth, H.-C.: Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions. 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'07) (2007).
       
    • Noltemeier, H., Spoerhase, J., Wirth, H.-C.: Multiple Voting Location and Single Voting Location on Trees. European Journal of Operational Research. 181, 654--667 (2007).
       
    Kontakt

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Tel.: +49 931 31-85054
    E-Mail

    Suche Ansprechpartner

    Hubland Süd, Geb. Z8