• 54
    Citations - based on content available in repository [source: Scopus]
20182022

Content available in repository

Fingerprint

Dive into the research topics where Martijn A.C. Struijs is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • Minimum Scan Cover and Variants: Theory and Experiments

    Buchin, K., Hill, A., Fekete, S., Kleist, L., Kostitsyna, I., Krupke, D., Lambers, R. & Struijs, M., 13 Dec 2022, In: Journal on Experimental Algorithmics. 27, 3, 28 p., 4.5.

    Research output: Contribution to journalArticleAcademicpeer-review

    Open Access
    File
    107 Downloads (Pure)
  • Near-Shortest Path Routing in Hybrid Communication Networks

    Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P. & Struijs, M. A. C., 28 Feb 2022, 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Bramas, Q., Gramoli, V., Gramoli, V. & Milani, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 217. p. 11:1-11:23 23 p. 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 217).

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

    Open Access
    File
    4 Citations (Scopus)
    118 Downloads (Pure)
  • Minimum scan cover and variants - Theory and experiments

    Buchin, K., Fekete, S. P., Hill, A., Kleist, L., Kostitsyna, I., Krupke, D., Lambers, R. & Struijs, M., 1 Jun 2021, 19th International Symposium on Experimental Algorithms, SEA 2021. Coudert, D. & Natale, E. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 190).

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

  • On the Hardness of Computing an Average Curve

    Struijs, M. A. C., Buchin, K. A. & Driemel, A., 22 Jun 2020, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020: SWAT 2020. Albers, S. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 162. p. 19:1-19:19 19 p. 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 162).

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

    Open Access
    10 Citations (Scopus)
  • The angular blowing-a-kiss problem

    Struijs, M. A. C., Buchin, K. A., Kostitsyna, I. & Lambers, R., 16 Mar 2020, EuroCG 2020: Book of Abstracts, 36th European Workshop on Computational Geometry. p. 74:1-74:7 7 p. 74

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic