From post

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)

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.

 

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

Distinguishing Graphs of Maximum Valence 3., , , , и . Electron. J. Comb., 26 (4): 4 (2019)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)Discrete Morse Theory for Computing Zigzag Persistence., и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 538-552. Springer, (2019)