( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How to Morph Graphs on the Torus.

, , , и . SODA, стр. 2759-2778. SIAM, (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.

Helen Chambers

Erin McKay

Helen Chambers

Craig Chambers

Muhterem Erinola

 

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

On the complexity of optimal homotopies., , и . SODA, стр. 1121-1134. SIAM, (2018)Burning the Medial Axis.. CCCG, стр. 77. (2017)Low-Stretch Spanning Trees of Graphs with Bounded Width., , , , и . SWAT, том 162 из LIPIcs, стр. 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Measuring similarity between curves on 2-manifolds via homotopy area., и . SoCG, стр. 425-434. ACM, (2013)On the complexity of optimal homotopies., , и . CoRR, (2017)Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries., , , и . SoCG, том 189 из LIPIcs, стр. 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Minimum cycle and homology bases of surface-embedded graphs., , , и . J. Comput. Geom., 8 (2): 58-79 (2017)Computing Interesting Topological Features. University of Illinois Urbana-Champaign, USA, (2008)Diversity Across a Decade: A Case Study on Undergraduate Computing Culture at the University of Illinois., , , и . SIGCSE, стр. 610-615. ACM, (2018)On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class., , и . SoCG, том 224 из LIPIcs, стр. 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)