Linda Kleist

Citirano

	Sve	Od 2020.
Citati	281	248
H-indeks	9	8
i10-indeks	9	8

201220132014201520162017201820192020202120222023202420252 1 2 3 10 10 17 33 29 64 84 16

Javni pristup

Prikaži sve

17 članaka

1 članak

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Tillmann MiltzowUtrecht UniversityPotvrđena adresa e-pošte na uu.nl
Mikkel AbrahamsenAssociate Professor of Computer Science, University of CopenhagenPotvrđena adresa e-pošte na di.ku.dk
Sándor P. FeketeTechnische Universität Braunschweig, L3S Research CenterPotvrđena adresa e-pošte na tu-bs.de
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information SciencePotvrđena adresa e-pošte na mini.pw.edu.pl
Maarten LöfflerComputer Science, Utrecht UniversityPotvrđena adresa e-pošte na cs.uu.nl
Stefan FelsnerProfessor für Diskrete Mathematik, TU BerlinPotvrđena adresa e-pošte na math.tu-berlin.de
Phillip KeldenichPostDoc, Braunschweig Institute of TechnologyPotvrđena adresa e-pošte na tu-bs.de
Dominik Michael KrupkePostDoc, TU BraunschweigPotvrđena adresa e-pošte na ibr.cs.tu-bs.de
Andre SchulzProfessor of CSPotvrđena adresa e-pošte na fernuni-hagen.de
Hugo A. AkitayaAssistant Professor of Computer Science, University of Massachusetts LowellPotvrđena adresa e-pošte na uml.edu
Oswin AichholzerProf. Informatik, TU Graz, Graz, AustriaPotvrđena adresa e-pošte na ist.tugraz.at
Anna LubiwProfessor, David R. Cheriton School of Computer Science, University of WaterlooPotvrđena adresa e-pošte na uwaterloo.ca
Elena ArsenevaUniversità della Svizzera italianaPotvrđena adresa e-pošte na usi.ch
Irina KostitsynaNASA Ames Research CenterPotvrđena adresa e-pošte na tue.nl
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Rachel KirschAssistant Professor, Mathematical Sciences, George Mason UniversityPotvrđena adresa e-pošte na gmu.edu
Christian RieckPostDoc, University of KasselPotvrđena adresa e-pošte na tu-bs.de
Paul JungeblutKarlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Aaron T. BeckerAssociate Prof. Univ. of Houston; Postdoc: Boston Children's Hosp, Harvard Med School, Rice; PhDPotvrđena adresa e-pošte na uh.edu
Darren StrashHamilton CollegePotvrđena adresa e-pošte na hamilton.edu

Prati

Linda Kleist

Universität Potsdam

Potvrđena adresa e-pošte na cs.uni-potsdam.de

computational geometry algorithms graphs discrete mathematics complexity


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Training neural networks is ER-complete M Abrahamsen, L Kleist, T Miltzow Advances in Neural Information Processing Systems 34, 18293-18306, 2021	48	2021
-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	32	2018
The Complexity of the Hausdorff Distance P Jungeblut, L Kleist, T Miltzow Discrete & Computational Geometry, 2023	27	2023
Geometric Embeddability of Complexes is -complete M Abrahamsen, L Kleist, T Miltzow arXiv preprint arXiv:2108.02585, 2021	19	2021
Convexity-increasing morphs of planar graphs L Kleist, B Klemz, A Lubiw, L Schlipf, F Staals, D Strash Computational Geometry 84, 69-88, 2019	18	2019
Rainbow cycles in flip graphs S Felsner, L Kleist, T Mütze, L Sering SIAM Journal on Discrete Mathematics 34 (1), 1-39, 2020	16	2020
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	14	2023
Drawing planar graphs with prescribed face areas L Kleist Graph-Theoretic Concepts in Computer Science: 42nd International Workshop …, 2016	12	2016
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	10	2020
Planar graphs and face areas: Area-universality L Kleist PQDT-Global, 2018	9	2018
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	8	2023
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	5	2014
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	4	2023
A Solution to Ringel’s Circle Problem J Davies, C Keller, L Kleist, S Smorodinsky, B Walczak SoCG, 2022	4	2022
Folding polyominoes with holes into a cube O Aichholzer, HA Akitaya, KC Cheung, ED Demaine, ML Demaine, ... Computational Geometry 93, 101700, 2021	4	2021
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	4	2021
On area-universal quadrangulations W Evans, S Felsner, L Kleist, S Kobourov JGAA, 2021	4	2021
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	4	2018
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	3	2022
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	3	2021

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori