关注
Linda Kleist
Linda Kleist
TU Braunschweig
在 ibr.cs.tu-bs.de 的电子邮件经过验证
标题
引用次数
引用次数
年份
Training neural networks is ER-complete
M Abrahamsen, L Kleist, T Miltzow
Advances in Neural Information Processing Systems 34, 18293-18306, 2021
412021
-Completeness and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
International Workshop on Graph-Theoretic Concepts in Computer Science, 164-175, 2018
292018
The Complexity of the Hausdorff Distance
P Jungeblut, L Kleist, T Miltzow
Discrete & Computational Geometry, 2023
222023
Geometric Embeddability of Complexes is -complete
M Abrahamsen, L Kleist, T Miltzow
arXiv preprint arXiv:2108.02585, 2021
152021
Convexity-increasing morphs of planar graphs
L Kleist, B Klemz, A Lubiw, L Schlipf, F Staals, D Strash
Computational Geometry 84, 69-88, 2019
152019
Completeness for the Complexity Class and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Discrete & Computational Geometry 70 (1), 154-188, 2023
132023
Rainbow cycles in flip graphs
S Felsner, L Kleist, T Mütze, L Sering
SIAM Journal on Discrete Mathematics 34 (1), 1-39, 2020
122020
Drawing planar graphs with prescribed face areas
L Kleist
Journal of Computational Geometry 9 (1), 290–311-290–311, 2018
92018
Planar graphs and face areas: Area-universality
L Kleist
PQDT-Global, 2018
92018
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game
T Byrne, SP Fekete, J Kalcsics, L Kleist
Annals of Operations Research 321 (1), 79-101, 2023
72023
Targeted drug delivery: algorithmic methods for collecting a swarm of particles with uniform, external forces
AT Becker, SP Fekete, L Huang, P Keldenich, L Kleist, D Krupke, C Rieck, ...
2020 IEEE International Conference on Robotics and Automation (ICRA), 2508-2514, 2020
72020
Drawing planar graphs with prescribed face areas
L Kleist
Graph-Theoretic Concepts in Computer Science: 42nd International Workshop …, 2016
72016
Unit contact representations of grid subgraphs with regular polytopes in 2D and 3D
L Kleist, B Rahman
Graph Drawing: 22nd International Symposium, GD 2014, Würzburg, Germany …, 2014
52014
Adjacency Graphs of Polyhedral Surfaces
E Arseneva, L Kleist, B Klemz, M Löffler, A Schulz, B Vogtenhuber, A Wolff
37th International Symposium on Computational Geometry (SoCG 2021) 189, 11:1 …, 2021
42021
Packing Squares into a Disk with Optimal Worst-Case Density
SP Fekete, V Gurunathan, K Juneja, P Keldenich, L Kleist, C Scheffer
37th International Symposium on Computational Geometry (SoCG 2021) 189, 36:1 …, 2021
42021
On area-universal quadrangulations
W Evans, S Felsner, L Kleist, S Kobourov
JGAA, 2021
42021
Is area universality∀∃ R-complete
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Proc. Int. Graph-Theoretic Concepts in Computer Science (WG 2018), LNCS …, 2018
42018
Online Sorting and Translational Packing of Convex Polygons
A Aamand, M Abrahamsen, L Beretta, L Kleist
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
32023
Bounding the tripartite‐circle crossing number of complete tripartite graphs
C Camacho, S Fernández‐Merchant, M Jelić Milutinović, R Kirsch, ...
Journal of Graph Theory 100 (1), 5-27, 2022
32022
A Solution to Ringel’s Circle Problem
J Davies, C Keller, L Kleist, S Smorodinsky, B Walczak
SoCG, 2022
32022
系统目前无法执行此操作，请稍后再试。
文章 1–20