Peter Eades

	2012
137		Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics 160(1-2): 132-139 (2012)
	2011
136		Peter Eades, Seok-Hee Hong, Kazuo Misue: Kozo Sugiyama 1945 - 2011. Graph Drawing 2011: 1
135		Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades: TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. Graph Drawing 2011: 123-135
134		Peter Eades, Giuseppe Liotta: Right Angle Crossing Graphs and 1-Planarity. Graph Drawing 2011: 148-153
133		Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta: 2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169
132		Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011)
	2010
131		Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang: Large Crossing Angles in Circular Layouts. Graph Drawing 2010: 397-399
130		Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin: Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. VL/HCC 2010: 176-183
129		Peter Eades, Weidong Huang, Seok-Hee Hong: A Force-Directed Method for Large Crossing Angle Graph Drawing CoRR abs/1012.4559: (2010)
128		Walter Didimo, Peter Eades, Giuseppe Liotta: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010)
	2009
127		Peter Eades, Thomas Ertl, Han-Wei Shen: IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009 IEEE Computer Society 2009
126		Peter Eades, Seok-Hee Hong, Sheung-Hung Poon: On Rectilinear Drawing of Graphs. Graph Drawing 2009: 232-243
125		Weidong Huang, Peter Eades, Seok-Hee Hong: A graph reading behavior: Geodesic-path tendency. PacificVis 2009: 137-144
124		Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217
123		Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: Issues for the Evaluation of Ambient Displays. IJACI 1(2): 59-69 (2009)
122		Weidong Huang, Peter Eades, Seok-Hee Hong: Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization 8(3): 139-152 (2009)
	2008
121		Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: The long-term evaluation of Fisherman in a partial-attention environment. BELIV 2008: 10
120		Weidong Huang, Peter Eades, Seok-Hee Hong: Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV 2008: 3
119		Peter Eades: Some Constrained Notions of Planarity. ISAAC 2008: 2
118		Weidong Huang, Seok-Hee Hong, Peter Eades: Effects of Crossing Angles. PacificVis 2008: 41-46
117		Hugo A. D. do Nascimento, Peter Eades: User Hints for map labeling. J. Vis. Lang. Comput. 19(1): 39-74 (2008)
	2007
116		Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere: Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems 2007
115		Christian Müller-Tomfelde, Belinda Kellar, Peter Eades: HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) 2007: 675-676
114		Peter Eades, Patrick Healy: Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007)
113		Weidong Huang, Seok-Hee Hong, Peter Eades: Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. 11(2): 397-429 (2007)
	2006
112		Weidong Huang, Seok-Hee Hong, Peter Eades: How people read sociograms: a questionnaire study. APVIS 2006: 199-206
111		Weidong Huang, Seok-Hee Hong, Peter Eades: Predicting graph reading performance: a cognitive approach. APVIS 2006: 207-216
110		Fang Chen, Peter Eades, Julien Epps, Serge Lichman, Benjamin Close, Peter Hutterer, Masa Takatsuka, Bruce H. Thomas, Mike Wu: ViCAT: Visualisation and Interaction on a Collaborative Access Table. Tabletop 2006: 59-62
109		Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006)
108		Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica 44(1): 67-100 (2006)
107		Seok-Hee Hong, Brendan D. McKay, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discrete & Computational Geometry 36(2): 283-311 (2006)
	2005
106		Xiaodi Huang, Peter Eades, Wei Lai: A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. ACSC 2005: 87-96
105		Xiaobin Shen, Peter Eades: Using MoneyColor to Represent Financial Data. APVIS 2005: 125-129
104		Wanchun Li, Peter Eades, Nikola S. Nikolov: Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140
103		Adel Ahmed, Peter Eades: Automatic Camera Path Generation for Graph Navigation in 3D. APVIS 2005: 27-32
102		Lanbo Zheng, Le Song, Peter Eades: Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. APVIS 2005: 33-37
101		Weidong Huang, Peter Eades: How People Read Graphs. APVIS 2005: 51-58
100		Xiaobin Shen, Andrew Vande Moere, Peter Eades: An intrusive evaluation of peripheral display. GRAPHITE 2005: 289-292
99		Weidong Huang, Seok-Hee Hong, Peter Eades: Layout Effects on Sociogram Perception. Graph Drawing 2005: 262-273
98		Wanchun Li, Seok-Hee Hong, Peter Eades: A Framework for Visualising Large Graphs. IV 2005: 528-535
97		Wanchun Li, Peter Eades, Seok-Hee Hong: Navigating Software Architectures with Constant Visual Complexity. VL/HCC 2005: 225-232
96		Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005)
95		Hugo A. D. do Nascimento, Peter Eades: User hints: a framework for interactive optimization. Future Generation Comp. Syst. 21(7): 1171-1191 (2005)
	2004
94		Seok-Hee Hong, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Graph Drawing 2004: 307-317
93		Xiaobin Shen, Peter Eades: Using MoneyTree To Represent Financial Data. IV 2004: 285-289
92		Seok-Hee Hong, Peter Eades, Jonathan Hillman: Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004)
	2003
91		Hugo A. D. do Nascimento, Peter Eades: User Hints for Map Labelling. ACSC 2003: 339-347
90		Colin Murray, Carsten Friedrich, Peter Eades: HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. Graph Drawing 2003: 494-495
89		Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 2003: 504-508
88		Seok-Hee Hong, Peter Eades: Symmetric Layout of Disconnected Graphs. ISAAC 2003: 405-414
87		Peter Eades, Xiaobin Shen: MoneyTree: Ambient Information Visualization Of Financial Data. VIP 2003: 15-18
86		Seok-Hee Hong, Peter Eades: Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003)
85		Graham Farr, Peter Eades: Skewness of Graphs with Small Cutsets. Graphs and Combinatorics 19(2): 177-194 (2003)
84		Mao Lin Huang, Peter Eades, Wei Lai: On-Line Visualization and Navigation of the Global Web Structure. International Journal of Software Engineering and Knowledge Engineering 13(1): 27-52 (2003)
83		Hiroshi Nagamochi, Peter Eades: An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003)
82		Xuemin Lin, Peter Eades: Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003)
	2002
81		Jesse S. Jin, Peter Eades, David Dagan Feng, Hong Yan: Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002 Australian Computer Society 2002
80		Hugo A. D. do Nascimento, Peter Eades: A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. HIS 2002: 634-643
79		Tim Dwyer, Peter Eades: Visualising a Fund Manager Flow Graph with Columns and Worms. IV 2002: 147-152
78		Seok-Hee Hong, Brendan D. McKay, Peter Eades: Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365
77		Wei Lai, Peter Eades: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81(2): 105-110 (2002)
76		Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades: Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett. 81(2): 59-63 (2002)
75		Carsten Friedrich, Peter Eades: Graph Drawing in Motion. J. Graph Algorithms Appl. 6(3): 353-370 (2002)
74		Ding-Zhu Du, Peter Eades, Xuemin Lin: Foreword. Theor. Comput. Sci. 289(2): 877 (2002)
	2001
73		David Dagan Feng, Jesse S. Jin, Peter Eades, Hong Yan: Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001 Australian Computer Society 2001
72		Peter Eades, Jesse S. Jin: Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000 Australian Computer Society 2001
71		Peter Eades, Tim Pattison: Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001 Australian Computer Society 2001
70		Peter Eades, Tadao Takaoka: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings Springer 2001
69		Hugo A. D. do Nascimento, Peter Eades: User Hints for Directed Graph Drawing. Graph Drawing 2001: 205-219
68		Petra Mutzel, Peter Eades: Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294
	2000
67		Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings Springer 2000
66		François Bertault, Peter Eades: Drawing Hypergraphs in the Subset Standard (Short Demo Paper). Graph Drawing 2000: 164-169
65		Aaron J. Quigley, Peter Eades: FADE: Graph Drawing, Clustering, and Visual Abstraction. Graph Drawing 2000: 197-210
64		Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Trees. Graph Drawing 2000: 360-371
63		Carsten Friedrich, Peter Eades: The Marey Graph Animation Tool Demo. Graph Drawing 2000: 396-406
62		Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277
61		Hugo A. D. do Nascimento, Peter Eades, Candido Ferreira Xavier de Mendonça Neto: A Multi-agent Approach using A-Teams for Graph Drawing. ISCA Conference on Intelligent Systems 2000: 39-42
60		François Bertault, Peter Eades: Graph Library Design. SCCC 2000: 144-151
59		Hugo A. D. do Nascimento, Peter Eades: A System for Graph Clustering Based on User Hints. VIP 2000: 73-74
58		Seok-Hee Hong, Peter Eades, Sang Ho Lee: Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000)
57		Peter Eades, Antonios Symvonis, Sue Whitesides: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3): 55-87 (2000)
56		Peter Eades, Mao Lin Huang: Navigating Clustered Graphs Using Force-Directed Methods. J. Graph Algorithms Appl. 4(3): 157-181 (2000)
55		Peter Eades, Xuemin Lin: Spring algorithms and symmetry. Theor. Comput. Sci. 240(2): 379-405 (2000)
	1999
54		Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs Prentice-Hall 1999
53		Xuemin Lin, Peter Eades: Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102
52		Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi: Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999)
	1998
51		Wei Lai, Peter Eades: Routing Drawings in Diagram Displays. APCHI 1998: 291-297
50		Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee: Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. Graph Drawing 1998: 198-209
49		Mao Lin Huang, Peter Eades: A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. Graph Drawing 1998: 374-383
48		Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1998: 423-435
47		Hiroshi Nagamochi, Peter Eades: Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111
46		Seok-Hee Hong, Peter Eades, Sang Ho Lee: Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286
45		Mao Lin Huang, Peter Eades, Robert F. Cohen: WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Computer Networks 30(1-7): 638-642 (1998)
44		Mao Lin Huang, Peter Eades, Junhu Wang: On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. J. Vis. Lang. Comput. 9(6): 623-645 (1998)
	1997
43		Peter Eades, Xuemin Lin: Spring Algorithms and Symmetry. COCOON 1997: 202-211
42		Peter Eades, Qing-Wen Feng: Drawing Clustered Graphs on an Orthogonal Grid. Graph Drawing 1997: 146-157
41		Xuemin Lin, Peter Eades: Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997: 219-229
40		Peter Eades, Robert F. Cohen, Mao Lin Huang: Online Animated Graph Drawing for Web Navigation. Graph Drawing 1997: 330-335
39		Peter Eades, Joe Marks, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1997: 438-445
38		Peter Eades, Michael E. Houle, Richard Webber: Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Graph Drawing 1997: 87-98
37		Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997)
	1996
36		Peter Eades, Qing-Wen Feng: Multilevel Visualization of Clustered Graphs. Graph Drawing 1996: 101-112
35		Peter Eades, Qing-Wen Feng, Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996: 113-128
34		Peter Eades, Joe Marks, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1996: 129-138
33		Peter Eades, Antonios Symvonis, Sue Whitesides: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. Graph Drawing 1996: 139-154
32		Peter Eades: Graph Drawing Methods. ICCS 1996: 40-49
31		Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996)
30		Peter Eades, Charles Stirk, Sue Whitesides: The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. 60(2): 97-103 (1996)
29		Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996)
28		Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller: Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996)
27		Peter Eades, Sue Whitesides: The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996)
	1995
26		John Staples, Peter Eades, Naoki Katoh, Alistair Moffat: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings Springer 1995
25		Qing-Wen Feng, Robert F. Cohen, Peter Eades: How to Draw a Planar Clustered Graph. COCOON 1995: 21-30
24		Qing-Wen Feng, Robert F. Cohen, Peter Eades: Planarity for Clustered Graphs. ESA 1995: 213-226
23		Peter Eades, Candido Ferreira Xavier de Mendonça Neto: Vertex Splitting and Tension-Free Layout Graph Drawing 1995: 202-211
22		Peter Eades, Patrick Garvan: Drawing Stressed Planar Graphs in Three Dimensions. Graph Drawing 1995: 212-223
21		Peter Eades, Joe Marks: Graph-Drawing Contest Report. Graph Drawing 1995: 224-233
20		Peter Eades, Sue Whitesides: Nearest Neighbour Graph Realizability is NP-hard. LATIN 1995: 245-256
19		Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama: Layout Adjustment and the Mental Map. J. Vis. Lang. Comput. 6(2): 183-210 (1995)
18		Isabel F. Cruz, Peter Eades: Guest editors' foreword. J. Vis. Lang. Comput. 6(3): 213-215 (1995)
	1994
17		Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Volume upper bounds for 3D graph drawing. CASCON 1994: 11
16		Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Graph Drawing 1994: 1-11
15		Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 1994: 143-146
14		Tao Lin, Peter Eades: Integration of Declarative and Algorithmic Approaches for Layout Creation. Graph Drawing 1994: 376-387
13		Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Symposium on Computational Geometry 1994: 49-56
12		Peter Eades, Nicholas C. Wormald: Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11(4): 379-403 (1994)
11		Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994)
10		Peter Eades, Sue Whitesides: Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994)
	1993
9		Peter Eades, Xuemin Lin, Nicholas C. Wormald: Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25(1): 21-28 (1993)
8		Peter Eades, Xuemin Lin, W. F. Smyth: A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993)
7		Peter Eades, Tao Lin, Xuemin Lin: Two Tree Drawing Conventions. Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993)
6		Peter Eades, David Rappaport: The complexity of computing minimum separating polygons. Pattern Recognition Letters 14(9): 715-718 (1993)
	1992
5		Peter Eades, Tao Lin, Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394
	1990
4		Peter Eades, Nicholas C. Wormald: Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics 28(2): 111-134 (1990)
	1984
3		Peter Eades, Brendan D. McKay: An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. Inf. Process. Lett. 19(3): 131-133 (1984)
2		Peter Eades, Michael Hickey, Ronald C. Read: Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31(1): 19-29 (1984)
	1981
1		Peter Eades, John Staples: On Optimal Trees. J. Algorithms 2(4): 369-384 (1981)

Coauthor Index

1	Adel Ahmed	[103]
2	Giuseppe Di Battista	[11] [54]
3	François Bertault	[60] [66]
4	Franz-Josef Brandenburg	[89]
5	Ulrik Brandes	[89]
6	Jürgen Branke	[76]
7	Fang Chen	[110]
8	Benjamin Close	[110]
9	Robert F. Cohen	[16] [17] [24] [25] [37] [40] [45]
10	Isabel F. Cruz	[18]
11	Walter Didimo	[124] [128] [132] [133] [137]
12	Ding-Zhu Du	[67] [74]
13	Tim Dwyer	[79]
14	Julien Epps	[110]
15	Thomas Ertl	[127]
16	Vladimir Estivill-Castro	[67]
17	Graham Farr	[85]
18	David Dagan Feng	[73] [81]
19	Qing-Wen Feng	[24] [25] [35] [36] [42] [52] [109]
20	Carsten Friedrich	[63] [75] [90]
21	Patrick Garvan	[22]
22	Emilio Di Giacomo	[133] [137]
23	Patrick Healy	[114]
24	Michael Hickey	[2]
25	Jonathan Hillman	[92]
26	Seok-Hee Hong	[46] [50] [58] [62] [64] [78] [86] [88] [92] [94] [96] [97] [98] [99] [107] [108] [111] [112] [113] [116] [118] [120] [121] [122] [123] [125] [126] [129] [130] [131] [135] [136] [137]
27	Michael E. Houle	[38]
28	Mao Lin Huang	[40] [44] [45] [49] [56] [84]
29	Weidong Huang	[99] [101] [111] [112] [113] [118] [120] [122] [125] [129] [130] [131]
30	Xiaodi Huang	[106]
31	Peter Hutterer	[110]
32	Jesse S. Jin (Jesse Sheng Jin)	[72] [73] [81]
33	Naoki Katoh	[26]
34	M. Keil	[28]
35	Belinda Kellar	[115]
36	Wei Lai	[19] [51] [77] [84] [106]
37	Sang Ho Lee	[46] [50] [58]
38	Stefan Leppert	[76]
39	Wanchun Li	[97] [98] [104]
40	Serge Lichman	[110]
41	Chun-Cheng Lin	[130]
42	Tao Lin	[5] [7] [14] [16] [17] [37]
43	Xuemin Lin	[5] [7] [8] [9] [29] [35] [41] [43] [53] [55] [67] [74] [82] [109]
44	Giuseppe Liotta	[124] [128] [132] [133] [134] [137]
45	Paul D. Manuel	[28]
46	Joe Marks	[15] [21] [34] [39] [48] [89]
47	Brendan D. McKay	[3] [78] [107]
48	Martin Middendorf	[76]
49	Mirka Miller	[28]
50	Kazuo Misue	[19] [136]
51	Andrew Vande Moere	[100] [116] [121] [123]
52	Alistair Moffat	[26]
53	Christian Müller-Tomfelde	[115]
54	Colin Murray	[90]
55	Petra Mutzel	[48] [68]
56	Hiroshi Nagamochi	[47] [52] [83] [109]
57	Hugo A. D. do Nascimento	[59] [61] [69] [80] [91] [95] [117]
58	Candido Ferreira Xavier de Mendonça Neto	[23] [61]
59	Quan Hoang Nguyen	[131] [135]
60	Nikola S. Nikolov	[104]
61	Stephen C. North	[34] [39] [48]
62	Tim Pattison	[71]
63	Sheung-Hung Poon	[126]
64	Aaron J. Quigley	[50] [65]
65	David Rappaport	[6]
66	Ronald C. Read	[2]
67	Frank Ruskey	[16] [17] [37]
68	Arun Sharma	[67]
69	Han-Wei Shen	[127]
70	Xiaobin Shen	[87] [93] [100] [105] [116] [121] [123]
71	W. F. Smyth	[8]
72	Le Song	[102]
73	John Staples	[1] [26]
74	Charles Stirk	[30]
75	Kozo Sugiyama	[19]
76	Antonios Symvonis	[33] [57]
77	Tadao Takaoka	[70]
78	Masa Takatsuka	[110]
79	Roberto Tamassia	[11] [29] [54]
80	Bruce H. Thomas	[110]
81	Ioannis G. Tollis	[11] [54]
82	Junhu Wang	[44]
83	Richard Webber	[38]
84	Sue Whitesides	[10] [13] [20] [27] [30] [31] [33] [57]
85	Nicholas C. Wormald	[4] [9] [12]
86	Mike Wu	[110]
87	Hong Yan	[73] [81]
88	Lanbo Zheng	[102]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page