( en | de | ru )

 

Disambiguation of "Eades, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Orthogonal Planarity

, , , , , , , , , and . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer, (September 2016)
DOI: 10.1007/978-3-319-50106-2_41

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

Drawing Clustered Graphs on an Orthogonal Grid., , and . J. Graph Algorithms Appl., 3 (4): 3-29 (1999)BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure., , , and . Int. J. Data Sci. Anal., 7 (1): 17-34 (2019)Some Constrained Notions of Planarity.. ISAAC, volume 5369 of Lecture Notes in Computer Science, page 2. Springer, (2008)The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard., and . SCG, page 49-56. ACM, (1994)Automatic Camera Path Generation for Graph Navigation in 3D., and . APVIS, volume 45 of CRPIT, page 27-32. Australian Computer Society, (2005)Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters., , and . APVIS, volume 45 of CRPIT, page 33-37. Australian Computer Society, (2005)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)MoneyTree: Ambient Information Visualization Of Financial Data., and . VIP, volume 36 of CRPIT, page 15-18. Australian Computer Society, (2003)How to draw a directed graph., and . VL, page 13-17. IEEE Computer Society, (1989)