Department of Computer Science

Read more
11 - 20 out of 823Page size: 10
Sort by: 1st author
  1. Published

    Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  2. Published

    Fast fencing

    Abrahamsen, Mikkel, Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A. & Thorup, Mikkel, 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 564-573

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  3. Published

    Outer common tangents and nesting of convex hulls in linear time and constant workspace

    Abrahamsen, Mikkel & Walczak, B., 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 57).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  4. Published

    Constructing Concise Convex Covers via Clique Covers

    Abrahamsen, Mikkel, Meyling, William Bille & Nusser, André Fritz, 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-9 66. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  5. Published

    The art gallery problem is ∃ ℝ-complete

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 65-73

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  6. Published

    Finding the maximum subset with bounded convex curvature

    Abrahamsen, Mikkel & Thorup, Mikkel, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 4. (Leibniz International Proceedings in Informatics, Vol. 51).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  7. Published

    Minimum perimeter-sum partitions in the plane

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  8. Published

    Spiral toolpaths for high-speed machining of 2d pockets with or without islands

    Abrahamsen, Mikkel, 2015, Proceedings of the ASME 2015 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 2015. American Society of Mechanical Engineers, Vol. 2B. 10 p. DETC2015-46255

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  9. Published

    Range-clustering queries

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 5. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  10. Published

    An optimal algorithm computing edge-to-edge visibility in a simple polygon

    Abrahamsen, Mikkel, 2013, Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. p. 157-162 6 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Previous 1 2 3 4 5 6 7 8 ...83 Next