Dr. Linda Kleist Wissenschaftliche Mitarbeiterin Technische Universität Braunschweig Carl-Friedrich-Gauß-Fakultät Department Informatik Institut für Betriebssysteme und Rechnerverbund Raum 331 Mühlenpfordtstraße 23, 3. OG 38106 Braunschweig Telefon: +49 531 3913118 Telefax: +49 531 3913109 EMail: kleist[[at]]ibr.cs.tu-bs.de

Forschungsinteressen

• Graphen & Geometrie
• Algorithmischen Geometrie
• Komplexitätstheorie
• Flächenuniversalität
• Origami

Vorlesungen

Wintersemester 2019/2020

Veröffentlichungen

• Training Neural Networks is ER-complete [pdf]
  with Mikkel Abrahamsen and Tillmann Miltzow.
  arXiv: 2102.09798.
  
  
• Scheduling with Contact Restrictions - A Problem Arising in Pandemics [pdf]
  with Moritz Buchem and Daniel Schmidt genannt Waldschmidt.
  arXiv: 2102.08231.
  
  
• On Area-Universal Quadrangulations [pdf]
  with William Evans, Stefan Felsner, and Stephen Kobourov.
  In Journal of Graph Algorithms and Applications (JGAA), 2021.
  
  
• Packing Squares into a Disk with Optimal Worst-Case Density [abstract]
  with Sándor P. Fekete, Vijay Gurunathan, Kushagra Juneja, Phillip Keldenich, Christian Scheffer.
  In Proceedings of 37th Symposium on Computational Geometry (SoCG 2021), to appear.
  Preprint of Extended Abstract in 36th European Workshop on Computational Geometry (EuroCG 2020), video talk [video]
  
  
• Representing Graphs by Polygons with Edge Contacts in 3D [abstract]
  with Elena Arseneva, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber and Alexander Wolff.
  In Proceedings of 37th Symposium on Computational Geometry (SoCG 2021), to appear.
  Preprint of Extended Abstract in 36th European Workshop on Computational Geometry (EuroCG 2020)
  
  
• Upward Point Set Embeddings of Paths and Trees
  with Elena Arseneva, Pilar Cano, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr.
  In Proceedings of WALCOM 2021, to appear.
  arXiv: 2012.10525.
  
  
• Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game [pdf]
  with Thomas Byrne, Sándor Fekete, Jörg Kalcsics.
  In Proceedings of WALCOM 2021, to appear.
  arXiv: 2011.13275.
  
  
• Folding Polyominoes with Holes into a Cube [pdf]
  with Oswin Aichholzer, Hugo Akitaya, Kenneth C. Cheung, Erik Demaine, Martin Demaine, Sándor Fekete, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová.
  Journal Version in Computational Geometry (CGTA), 2020.
  In Proceedings of CCCG 2019 [pdf].
  arXiv: 1910.09917.
  
  
• Minimum Scan Cover with Angular Transition Costs [pdf]
  with Sándor Fekete and Dominik Krupke.
  In Proceedings of 36th Symposium on Computational Geometry (SoCG 2020)
  arXiv:2003.08816.
  
  
• Rainbow Cycles in Flip Graphs [pdf] [slides]
  with Stefan Felsner, Torsten Mütze, and Leon Sering.
  Journal version in Siam Journal on Discrete Mathematics (SIDMA), 2020
  In Proceedings of 34th Symposium on Computational Geometry (SoCG 2018).
  arXiv:1712.07421.
  
  
• Targeted Drug Delivery:
  Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
  [pdf]
  with Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Dominik Krupke, Christian Rieck, Arne Schmidt.
  In Proceedings of IEEE International Conference on Robotics and Automation (ICRA).
  Preprint in Proceedings of 36th European Workshop on Computational Geometry (EuroCG 2020)
  
  
• Convexity-Increasing Morphs [pdf]
  with Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash.
  Journal version in Computational Geometry - Theory and Applications (CGTA), 2019
  Conference version WG 2018, LNCS 11159.
  arXiv:1802.06579.
  
  
• Bounding the tripartite-circle crossing number of complete tripartite graphs [pdf]
  with Charles Camacho, Silvia Fernandez-Merchant, Marija Jelic, Rachel Kirsch, Elizabeth Bailey Matson, and Jennifer White.
  In Proceedings of EuroComb 2019 [extended abstract]
  Our poster won the Best Poster Award at GD 2018 [poster][abstract].
  arXiv:1910.06963.
  
  
• On the Edge-Vertex Ratio of Maximal Thrackles [pdf]
  with Oswin Aichholzer, Boris Klemz, Felix Schröder, Birgit Vogtenhuber.
  In Proceedings of GD 2019, LNCS 11904.
  arXiv:1908.08857.
  
  
• Drawing Planar Graphs with Prescribed Face Areas [pdf] [slides]
  Journal Version JoCG 2018 [pdf].
  In Proceedings of WG 2016, LNCS 9941 [pdf].
  
  
• On the Area-Universality of Triangulations [pdf]
  In Proceedings of GD 2018 , LNCS 11282 [pdf].
  arXiv:1808.10864.
  
  
• Planar Graphs and Face Areas -- Area-Universality [pdf]
  PhD thesis, TU Berlin, 2018
  DOI: 10.14279/depositonce-7674
  
  
• ℝ-completeness and area-universality [pdf] [slides]
  with Michael G. Dobbins, Tillmann Miltzow, and Pawel Rzazewski.
  In Proceedings of WG 2018, LNCS 11159.
  arXiv:1712.05142.
  
  
• Upper and Lower Bounds on Long Dual-Paths in Line Arrangements [pdf] [slides]
  with Udo Hoffmann and Tillmann Miltzow.
  in MFCS 2015 , LNCS 9235
  arXiv:1506.03728.
  
  
• Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D [pdf] [slides]
  with Benjamin Rahman.
  In Proceedings of GD 14, LNCS 8871.