( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mario Kart Is Hard.

, , , , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 49-59. Springer, (2015)

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.

Adele Hesterberg

Verena Hesterberg

Renate Hesterberg

Georg Hesterberg

Friedrich Hesterberg

 

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

Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , и . Graphs Comb., 36 (2): 251-267 (2020)The Shortest Separating Cycle Problem., , , , и . WAOA, том 10138 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2016)Finding Closed Quasigeodesics on Convex Polyhedra., , и . SoCG, том 164 из LIPIcs, стр. 33:1-33:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , и . FUN, том 100 из LIPIcs, стр. 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reconfiguring Undirected Paths., , , , , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 353-365. Springer, (2019)Arithmetic Expression Construction., , , , , , , , , и 3 other автор(ы). ISAAC, том 181 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , и 5 other автор(ы). J. Inf. Process., (2020)Conflict-Free Coloring of Graphs, , , , , , , и . SIAM J. Discret. Math., 32 (4): 2675--2702 (2018)Scalable Equilibrium Computation in Multi-agent Influence Games on Networks., , , , , , , , и . AAAI, стр. 5277-5285. AAAI Press, (2021)New Results in Sona Drawing: Hardness and TSP Separation., , , , , , , , и . CCCG, стр. 63-72. (2020)