( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Characterizing matchings as the intersection of matroids.

, , и . Math. Methods Oper. Res., 58 (2): 319-329 (2003)

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.

Béla Sándor

Sándor Kádas

Sándor Molnár

Sándor Fejér

Vajna Sándor

 

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

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331)., , , и . Dagstuhl Reports, 8 (8): 48-66 (2018)Polygon exploration with time-discrete vision., и . Comput. Geom., 43 (2): 148-168 (2010)The minimum backlog problem., , , , , , и . Theor. Comput. Sci., (2015)Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots., , , и . Algorithmica, 84 (10): 2954-2986 (2022)Realistic Runtime Analysis for Quantum Simplex Computation., , , , , , , , , и 3 other автор(ы). CoRR, (2023)Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance., , , , , , и . Algorithmica, 50 (2): 279-298 (2008)Maximum Dispersion and Geometric Maximum Weight Cliques., и . Algorithmica, 38 (3): 501-511 (2004)Rectangle and Box Visibility Graphs in 3D., и . Int. J. Comput. Geom. Appl., 9 (1): 1-28 (1999)Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots., , , и . ALGOSENSORS, том 12503 из Lecture Notes in Computer Science, стр. 60-75. Springer, (2020)Area-Optimal Simple Polygonalizations: The CG Challenge 2019, , , и . Journal of Experimental Algorithms, 27 (2.4): 1-12 (2022)