( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Worst-case optimal squares packing into disks

, , , , , и . Journal of Computational Geometry, 13 (2): 1--27 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sándor Molnár

Sándor Fejér

Béla Sándor

Sándor Kádas

Sándor Tóth

 

Другие публикации лиц с тем же именем

Coordinated Particle Relocation Using Finite Static Friction With Boundary Walls, , , и . IEEE Robotics Autom. Lett., 5 (2): 985--992 (2020)Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces, , , , , , и . Algorithmica, 82 (2): 165--187 (2020)Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271, , , и . SIGACT News, 48 (2): 87--94 (2017)Facets for Art Gallery Problems, , , и . Algorithmica, 73 (2): 411--440 (2015)Collecting a swarm in a grid environment using shared, global inputs, , , , и . IEEE International Conference on Automation Science and Engineering, CASE 2016, Fort Worth, TX, USA, August 21-25, 2016, стр. 1231--1236. IEEE, (2016)Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density, , и . Discret. Comput. Geom., 61 (3): 562--594 (2019)Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch, , , , и . SIAM J. Comput., 48 (6): 1727--1762 (2019)Lower Bounds for Graph Exploration Using Local Policies, , , , , и . J. Graph Algorithms Appl., 21 (3): 371--387 (2017)Lower Bounds for Graph Exploration Using Local Policies, , , , , и . WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings, том 9627 из Lecture Notes in Computer Science, стр. 55--67. Springer, (2016)Probing a Set of Trajectories to Maximize Captured Information, , , , , , и . CoRR, (2020)