( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Graph Drawing: Algorithms for the Visualization of Graphs

, , , и . Prentice Hall, (1998)

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.

Anne-Marie Eades

Anne-Marie Eades

Tanja Elisabeth Peters

George Gershwins und Jerome Kerns Musicalsongs: ihre Ähnlichkeit, Wahrnehmung und musikalische Struktur. Uni Köln, (2008)

Andre Peters

Description and determination of soil hydraulic properties on the laboratory scale. TU Braunschweig, (2008)

Jillian Petersen

Diversity and ecology of chemosynthetic symbioses in deep-sea invertebrates. Uni Bremen, (2009)
 

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

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, , и . Proceedings of the Symposium on Graph Drawing, стр. 113--128. London, UK, Springer-Verlag, (1997)Simultaneous Orthogonal Planarity, , , , , , , , , и . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, стр. 532-545. Springer, (2016)Simultaneous Orthogonal Planarity, , , , , , , , , и . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, том 9801 из Lecture Notes in Computer Science, стр. 532--545. Springer, (сентября 2016)Order Preserving Matching, , , , , , , и . CoRR, (2013)Louvain-based Multi-level Graph Drawing., , , , и . PacificVis, стр. 151-155. IEEE, (2021)Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing., , , , и . PacificVis, стр. 146-150. IEEE, (2021)How People Read Graphs., и . APVIS, том 45 из CRPIT, стр. 51-58. Australian Computer Society, (2005)Drawing Big Graphs Using Spectral Sparsification., , и . GD, том 10692 из Lecture Notes in Computer Science, стр. 272-286. Springer, (2017)An Algorithm for Finding Three Dimensional Symmetry in Trees., и . GD, том 1984 из Lecture Notes in Computer Science, стр. 360-371. Springer, (2000)Two Algorithms for Three Dimensional Orthogonal Graph Drawing., , и . GD, том 1190 из Lecture Notes in Computer Science, стр. 139-154. Springer, (1996)