• Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20112021

Research activity per year

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

Search results

  • 2012

    The price of anarchy for minsum related machine scheduling

    Hoeksma, R. P. & Uetz, M. J., 2012, 9th International Workshop on Approximation and Online Algorithms, WAOA 2011. Solis-Oba, R. & Persiano, G. (eds.). Heidelberg: Springer, p. 261-273 12 p. (Lecture Notes in Computer Science; vol. 7164).

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

    19 Citations (Scopus)
  • 2013

    Two dimensional optimal mechanism design for a sequencing problem

    Hoeksma, R. P. & Uetz, M. J., 2013, Proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013. Goemans, M. & Correa, J. (eds.). Berlin: Springer, p. 242-253 12 p. (Lecture Notes in Computer Science; vol. 7801).

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

    6 Citations (Scopus)
  • 2014

    Approximability of Connected Factors

    Cornelissen, K., Hoeksma, R. P., Manthey, B., Narayanaswamy, N. S. & Rahul, C. S., 2014, Proceedings of the 11th Workshop on Approximation and Online Algorithms (WAOA 2013). Kaklamanis, C. & Pruhs, K. (eds.). Berlin, Germany: Springer, p. 120-131 12 p. (Lecture Notes in Computer Science; vol. 8447).

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

    6 Citations (Scopus)
  • Decomposition algorithm for the single machine scheduling polytope

    Hoeksma, R. P., Manthey, B. & Uetz, M. J., 5 Mar 2014, Combinatorial Optimization, Third International Symposium, ISCO 2014. Springer, p. 280-291 12 p. (Lecture Notes in Computer Science; vol. 8596).

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

    File
    1 Citation (Scopus)
    67 Downloads (Pure)
  • 2017

    A QPTAS for the general scheduling problem with identical release dates

    Antoniadis, A., Hoeksma, R., Meißner, J., Verschae, J. & Wiese, A., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Dagstuhl, p. 31:1-31:14 14 p. 31. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

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

    Open Access
    File
    4 Citations (Scopus)
    4 Downloads (Pure)
  • Posted price mechanisms for a random stream of customers

    Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T. & Vredeveld, T., 20 Jun 2017, EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation. Association for Computing Machinery (ACM), p. 169-186 18 p. (EC 2017 - Proceedings of the 2017 ACM Conference on Economics and Computation).

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

    36 Citations (Scopus)
  • 2018

    SUPERSET: A (Super) natural variant of the card game SET

    Botler, F., Cristi, A., Hoeksma, R., Schewior, K. & Tönnis, A., 1 Jun 2018, 9th International Conference on Fun with Algorithms, FUN 2018. Ito, H., Leonardi, S., Pagli, L. & Prencipe, G. (eds.). Dagstuhl, p. 12:1-12:17 17 p. 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 100).

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

    Open Access
    File
    5 Downloads (Pure)
  • 2019

    A PTAS for Euclidean TSP with hyperplane neighborhoods

    Antoniadis, A., Fleszar, K., Hoeksma, R. & Schewior, K., 2019, Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, p. 1089-1105 17 p.

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

    2 Citations (Scopus)
  • On the complexity of anchored rectangle packing

    Antoniadis, A., Cristi, A., Hoeksma, R., Kling, P., Biermeier, F., Damerius, C., Kaaser, D. & Nölke, L., 1 Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Dagstuhl, p. 1-14 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

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

    Open Access
    File
    20 Downloads (Pure)
  • Scheduling self-suspending tasks: New and old results

    Chen, J-J., Hahn, T., Hoeksma, R., Megow, N. & von der Brüggen, G., 1 Jul 2019, 31st Euromicro Conference on Real-Time Systems, ECRTS 2019. Quinton, S. (ed.). Dagstuhl, p. 1-23 23 p. 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 133).

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

    Open Access
    File
    5 Downloads (Pure)
  • 2020

    Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics

    Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B., 2020, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Esparza, J. & Kráľ, D. (eds.). Dagstuhl, Germany: Dagstuhl, p. 18:1-18:15 (Leibniz International Proceedings in Informatics (LIPIcs)).

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

    Open Access
    File
    5 Downloads (Pure)