( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Hardest Explicit Construction.

. FOCS, стр. 433-444. IEEE, (2021)

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.

Hertha Korten

Günter Korten

Wolfram Korten

Simone Korten

Matthias Korten

 

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

Reconfiguration of connected graph partitions via recombination., , , , и . Theor. Comput. Sci., (2022)Reconfiguration of Connected Graph Partitions via Recombination., , , , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 61-74. Springer, (2021)Characterizing Universal Reconfigurability of Modular Pivoting Robots., , , , , , , , , и . SoCG, том 189 из LIPIcs, стр. 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Derandomization from Time-Space Tradeoffs.. CCC, том 234 из LIPIcs, стр. 37:1-37:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Reconfiguration of connected graph partitions., , , , , , , , и . J. Graph Theory, 102 (1): 35-66 (2023)The Hardest Explicit Construction.. FOCS, стр. 433-444. IEEE, (2021)Reconfiguration of Connected Graph Partitions via Recombination., , , , и . CoRR, (2020)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , и 5 other автор(ы). J. Inf. Process., (2020)Circumscribing Polygons and Polygonizations for Disjoint Line Segments., , , , , и . Discret. Comput. Geom., 68 (1): 218-254 (2022)Total Functions in the Polynomial Hierarchy., , , и . ITCS, том 185 из LIPIcs, стр. 44:1-44:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)