From post

Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings.

, и . GD, том 12590 из Lecture Notes in Computer Science, стр. 173-180. Springer, (2020)

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.

 

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

Upward Planar Drawings with Three and More Slopes., и . J. Graph Algorithms Appl., 27 (2): 49-70 (2023)Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings., и . GD, том 12590 из Lecture Notes in Computer Science, стр. 173-180. Springer, (2020)Upward planar drawings with two slopes., и . J. Graph Algorithms Appl., 26 (1): 171-198 (2022)Upward Planar Drawings with Three Slopes., и . CoRR, (2021)Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees., , , и . CoRR, (2022)Upward Planar Drawings with Three and More Slopes., и . GD, том 12868 из Lecture Notes in Computer Science, стр. 149-165. Springer, (2021)The agreement distance of unrooted phylogenetic networks.. Discret. Math. Theor. Comput. Sci., (2020)The agreement distance of rooted phylogenetic networks.. CoRR, (2018)On the Subnet Prune and Regraft Distance., и . CoRR, (2018)Morphing Rectangular Duals., , , , и . GD, том 13764 из Lecture Notes in Computer Science, стр. 389-403. Springer, (2022)