( en | de | ru )

 

Disambiguation of "Eades, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for drawing graphs: an annotated bibliography

, , , and . Computational Geometry: Theory and Applications, 4 (5): 235--282 (1994)
DOI: 10.1016/0925-7721(94)00014-X

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. You can also use the button next to the name to display some publications already assigned to the person.

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)
 

Other publications of authors with the same name

Simultaneous Orthogonal Planarity, , , , , , , , , and . Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer-Verlag, (September 2016)On Optimal Trees., and . J. Algorithms, 2 (4): 369-384 (1981)The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard., and . Algorithmica, 16 (1): 60-82 (1996)Planarity for Clustered Graphs., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 213-226. Springer, (1995)A Study of Mental Maps in Immersive Network Visualization., , , , , , and . PacificVis, page 1-10. IEEE, (2020)Drawing Clustered Graphs on an Orthogonal Grid., , and . J. Graph Algorithms Appl., 3 (4): 3-29 (1999)The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard., and . SCG, page 49-56. ACM, (1994)Some Constrained Notions of Planarity.. ISAAC, volume 5369 of Lecture Notes in Computer Science, page 2. Springer, (2008)BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure., , , and . Int. J. Data Sci. Anal., 7 (1): 17-34 (2019)Area Requirements for Drawing Hierarchically Planar Graphs., and . GD, volume 1353 of Lecture Notes in Computer Science, page 219-229. Springer, (1997)