From post

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.

 

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

Extending simple drawings with one edge is hard., , , , , и . CoRR, (2019)Barking dogs: A Fréchet distance variant for detour detection., , , и . CoRR, (2024)Extending Partial 1-Planar Drawings., , , , и . ICALP, том 168 из LIPIcs, стр. 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Minimizing crossings in constrained two-sided circular graph layouts., и . J. Comput. Geom., 10 (2): 45-69 (2019)Crossing-Optimal Extension of Simple Drawings., , , , и . CoRR, (2020)On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem., , и . STACS, том 96 из LIPIcs, стр. 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Strict (Outer-)Confluent Graphs., , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 147-161. Springer, (2019)Balanced Independent and Dominating Sets on Colored Interval Graphs., , , , и . CoRR, (2020)On Strict (Outer-)Confluent Graphs., , , и . J. Graph Algorithms Appl., 25 (1): 481-512 (2021)Efficient Segment Folding is Hard., , , , , и . CoRR, (2020)