( 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 . Comput. Geom., (1994)

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 . 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)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)Graph Drawing: Algorithms for the Visualization of Graphs, , , and . Prentice Hall, (1998)Acute Constraints in Straight-Line Drawings of Planar Graphs., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 102-A (9): 994-1001 (2019)Algorithms for Drawing Graphs: an Annotated Bibliography., , , and . Comput. Geom., (1994)2-Layer Right Angle Crossing Drawings., , , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 156-169. Springer, (2011)Order Preserving Matching, , , , , , , and . CoRR, (2013)A lower-bound for the number of productions required for a certain class of languages., , and . Discret. Appl. Math., 6 (2): 109-115 (1983)Larger crossing angles make graphs easier to read., , and . J. Vis. Lang. Comput., 25 (4): 452-465 (2014)BC tree-based spectral sampling for big complex network visualization., , , , , , , and . Appl. Netw. Sci., 6 (1): 60 (2021)