CIRCULANT (V,K,MU ) DESIGNSEADES P.1980; LECTURE NOTES MATH.; ISSN 0075-8434; DEU; DA. 1980; NO 829; PP. 83-93; BIBL. 9 REF.Conference Paper

SOME NEW CONSTRUCTIONS FOR ORTHOGONAL DESIGNS USING CIRCULANTS.EADES P.1977; LECTURE NOTES MATH.; GERM.; DA. 1977; NO 622; PP. 64-75; BIBL. 13 REF.; (COMBINATORIAL MATH. AUST. CONF. 5. PROC.; MELBOURNE; 1976)Conference Paper

INTEGRAL QUADRATIC FORMS AND ORTHOGONAL DESIGNSEADES P.1981; J. AUSTR. MATH. SOC., A; AUS; DA. 1981; VOL. 30; NO 3; PP. 297-306; BIBL. 11 REF.Article

AN INFINITE FAMILY OF SKEW WEIGHING MATRICES.EADES P; WALLIS JS.1976; LECTURE NOTES MATH.; GERM.; DA. 1976; NO 560; PP. 27-40; BIBL. 15 REF.; (COMB. MATH. AUST. CONF. 4. PROC.; ADELAIDE; 1975)Conference Paper

SOME ASYMPTOTIC RESULTS FOR ORTHOGONAL DESIGNS. IIEADES P; WALLIS JS.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS:CNRS; DA. 1978; PP. 119-121; ABS. FRE; BIBL. 12 REF.Conference Paper

AN EFFICIENT HEURISTIC FOR IDENTIFYING A MAXIMUM WEIGHT PLANAR SUBGRAPHEADES P; FOULDS L; GIFFIN J et al.1982; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1982; NO 952; PP. 239-251; BIBL. 16 REF.Conference Paper

A NOTE ON ASYMPTOTIC EXISTENCE RESULTS FOR ORTHOGONAL DESIGNS.EADES P; WALLIS JS; WORMALD N et al.1977; LECTURE NOTES MATH.; GERM.; DA. 1977; NO 622; PP. 76-90; BIBL. 12 REF.; (COMBINATORIAL MATH. AUST. CONF. 5. PROC.; MELBOURNE; 1976)Conference Paper

Drawing graphs in two layersEADES, P; WHITESIDES, S.Theoretical computer science. 1994, Vol 131, Num 2, pp 361-374, issn 0304-3975Article

Performance of subset generating algorithmsCARKEET, M; EADES, P.North-Holland mathematics studies. 1985, Vol 114, Num 26, pp 49-57, issn 0304-0208Article

The complexity of computing minimum separating polygonsEADES, P; RAPPOPORT, D.Pattern recognition letters. 1993, Vol 14, Num 9, pp 715-718, issn 0167-8655Article

Area requirements for drawing hierarchically planar graphsLIN, X; EADES, P.Lecture notes in computer science. 1997, pp 219-229, issn 0302-9743, isbn 3-540-63938-1Conference Paper

Spring algorithms and symmetryEADES, P; LIN, X.Lecture notes in computer science. 1997, pp 202-211, issn 0302-9743, isbn 3-540-63357-XConference Paper

The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawingsEADES, P; STIRK, C; WHITESIDES, S et al.Information processing letters. 1996, Vol 60, Num 2, pp 97-103, issn 0020-0190Article

Three-dimensional orthogonal graph drawing algorithmsEADES, P; SYMVONIS, A; WHITESIDES, S et al.Discrete applied mathematics. 2000, Vol 103, Num 1-3, pp 55-87, issn 0166-218XArticle

A fast and effective heuristic for the feedback arc set problemEADES, P; XUEMIN LIN; SMYTH, W. F et al.Information processing letters. 1993, Vol 47, Num 6, pp 319-323, issn 0020-0190Article

A fully animated interactive system for clustering and navigating huge graphsMAO LIN HUANG; EADES, P.Lecture notes in computer science. 1998, pp 374-383, issn 0302-9743, isbn 3-540-65473-9Conference Paper

A lower-bound for the number of productions required for a certain class of languagesALSPACH, B; EADES, P; ROSE, G et al.Discrete applied mathematics. 1983, Vol 6, Num 2, pp 109-115, issn 0166-218XArticle

Finding the best viewpoints for three-dimensional graph drawingsEADES, P; HOULE, M. E; WEBBER, R et al.Lecture notes in computer science. 1997, pp 87-98, issn 0302-9743, isbn 3-540-63938-1Conference Paper

Edge crossings in layered drawings of graphsEADES, P.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 47-50, issn 0044-2267, SUP3Conference Paper

Finding planar geometric automorphisms in planar graphs (extended abstract)HONG, S.-H; EADES, P; LEE, S.-H et al.Lecture notes in computer science. 1998, pp 277-286, issn 0302-9743, isbn 3-540-65385-6Conference Paper

Area minimization for grid visibility representation of hierarchically planar graphsXUEMIN LIN; EADES, P.Lecture notes in computer science. 1999, pp 92-102, issn 0302-9743, isbn 3-540-66200-6Conference Paper