No photo of Joachim Spoerhase
20182020

Research activity per year

If you made any changes in Pure these will be visible here soon.

Search results

  • 2020

    A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

    Beyer, S., Chimani, M. & Spoerhase, J., 1 Jan 2020, Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). p. 347-359 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12273 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
  • PTAS for Steiner Tree on Map Graphs

    Byrka, J., Lewandowski, M., Meesum, S. M., Spoerhase, J. & Uniyal, S., 2020, LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings. Kohayakawa, Y. & Miyazawa, F. K. (eds.). p. 3-14 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12118 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  • 2019

    A tight approximation for submodular maximization with mixed packing and covering constraints

    Mizrachi, E., Schwartz, R., Spoerhase, J. & Uniyal, S., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 85. (Leibniz international proceedings in informatics; vol. 132).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    13 Downloads (Pure)
  • 2018

    Approximating node-weighted k-MST on planar graphs

    Byrka, J., Lewandowski, M. & Spoerhase, J., 1 Jan 2018, Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Revised Selected Papers. Epstein, L. & Erlebach, T. (eds.). p. 87-101 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11312 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  • Approximation schemes for geometric coverage problems

    Chaplick, S., De, M., Ravsky, A. & Spoerhase, J., 1 Aug 2018, In: Leibniz international proceedings in informatics. 112, p. 1-15

    Research output: Contribution to journalConference articleScientificpeer-review

    Open Access
    File
    2 Citations (Scopus)
    14 Downloads (Pure)
  • Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

    Chan, T. M., Dijk, T. C. V., Fleszar, K., Spoerhase, J. & Wolff, A., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). p. 1-13 62. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    3 Downloads (Pure)
Your message has successfully been sent.
Your message was not sent due to an error.