Miltzow, T., Abrahamsen, M., Erickson, J.
, Kostitsyna, I., Urhausen, J., Vermeulen, J., & Viglietta, G. (2021).
Chasing Puppies: Mobile Beacon Routing on Closed Curves. 5:1-5:19. Paper presented at 37th International Symposium on Computational Geometry .
https://doi.org/10.4230/LIPIcs.SoCG.2021.5 Hengeveld, S., & Miltzow, T. (Accepted/In press). A Practical Algorithm with Performance Guarantees for the ArttextasciitildeGallery Problem. CoRR, abs/2007.06920.
van Kreveld, M. J., Miltzow, T., Ophelders, T., Sonke, W.
, & Vermeulen, J. L. (2020).
Between Shapes, Using the Hausdorff Distance. In Y. Cao, S-W. Cheng, & M. Li (Eds.),
31st International Symposium on Algorithms and Computation (ISAAC 2020) (pp. 13:1-13:16). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 181). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ISAAC.2020.13 Miltzow, T., Parada, I., Sonke, W., Speckmann, B., & Wulms, J. (2020).
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). In S. Cabello, & D. Z. Chen (Eds.),
36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland (Vol. 164, pp. 1-5). [78] (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH.
https://doi.org/10.4230/LIPIcs.SoCG.2020.78 Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., Naredla, A. M., Tkadlec, J., & Turcotte, A. (2019). Token Swapping on Trees. arXiv.org.
Agrawal, A., Biswas, Bonnet, Brettell, Curticapean, Marx, Miltzow, T., Raman, & Saurabh (2019). Parameterized streaming algorithms for Min-Ones d-SAT. In A. Chattopadhyay, & P. Gastin (Eds.), 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019) (LIPIcs - Leibniz International Proceedings in Informatics; Vol. 150). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH.
Dobbins, M. G.
, Kleist, L., Miltzow, T., & Rzazewski, P. (2018).
forallexistsR-Completeness and Area-Universality. In A. Brandstädt, E. Köhler, & K. Meer (Eds.),
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings (Vol. 11159, pp. 164-175). (Lecture Notes in Computer Science). Springer Verlag.
https://doi.org/10.1007/978-3-030-00256-514Abrahamsen, M., Adamaszek, A.
, & Miltzow, T. (2017).
Irrational Guards are Sometimes Needed. In B. Aronov, & M. J. Katz (Eds.),
33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia (Vol. 77, pp. 3:1-3:15). (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH.
https://doi.org/10.4230/LIPIcs.SoCG.2017.3Miltzow, T., Narins, L., Okamoto, Y., Rote, G., Thomas, A., & Uno, T. (2016).
Approximation and Hardness of Token Swapping. In P. Sankowski, & C. D. Zaroliagis (Eds.),
24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark (Vol. 57, pp. 66:1-66:15). (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH.
https://doi.org/10.4230/LIPIcs.ESA.2016.66 Hoffmann, M., Kusters, V.
, & Miltzow, T. (2014).
Halving Balls in Deterministic Linear Time. In A. S. Schulz, & D. Wagner (Eds.),
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings (Vol. 8737, pp. 566-578). (Lecture Notes in Computer Science). Springer Verlag.
https://doi.org/10.1007/978-3-662-44777-2472011
Scholarly publications
Apfelbaum, R., Ben-Dan, I., Felsner, S.
, Miltzow, T., Pinchasi, R., Ueckerdt, T., & Ziv, R. (2011).
Points with Large Quadrant Depth.
Journal of Computational Geometry,
2(1), 128-143.
https://doi.org/10.20382/jocg.v2i1a7