The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Peter Eades: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Xiaodi Huang, Peter Eades, Wei Lai
    A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. [Citation Graph (0, 0)][DBLP]
    ACSC, 2005, pp:87-96 [Conf]
  2. Hugo A. D. do Nascimento, Peter Eades
    User Hints for Map Labelling. [Citation Graph (0, 0)][DBLP]
    ACSC, 2003, pp:339-347 [Conf]
  3. Wei Lai, Peter Eades
    Routing Drawings in Diagram Displays. [Citation Graph (0, 0)][DBLP]
    APCHI, 1998, pp:291-297 [Conf]
  4. Adel Ahmed, Peter Eades
    Automatic Camera Path Generation for Graph Navigation in 3D. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:27-32 [Conf]
  5. Weidong Huang, Peter Eades
    How People Read Graphs. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:51-58 [Conf]
  6. Wanchun Li, Peter Eades, Nikola S. Nikolov
    Using Spring Algorithms to Remove Node Overlapping. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:131-140 [Conf]
  7. Xiaobin Shen, Peter Eades
    Using MoneyColor to Represent Financial Data. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:125-129 [Conf]
  8. Lanbo Zheng, Le Song, Peter Eades
    Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:33-37 [Conf]
  9. Peter Eades, Tao Lin, Xuemin Lin
    Minimum Size h-v Drawings. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 1992, pp:386-394 [Conf]
  10. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
    Volume upper bounds for 3D graph drawing. [Citation Graph (0, 0)][DBLP]
    CASCON, 1994, pp:11- [Conf]
  11. Peter Eades, Xuemin Lin
    Spring Algorithms and Symmetry. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:202-211 [Conf]
  12. Qing-Wen Feng, Robert F. Cohen, Peter Eades
    How to Draw a Planar Clustered Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:21-30 [Conf]
  13. Xuemin Lin, Peter Eades
    Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:92-102 [Conf]
  14. Peter Eades, Sue Whitesides
    The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:49-56 [Conf]
  15. Petra Mutzel, Peter Eades
    Graphs in Software Visualization - Introduction. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:285-294 [Conf]
  16. Qing-Wen Feng, Robert F. Cohen, Peter Eades
    Planarity for Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:213-226 [Conf]
  17. Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
    Graph Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:504-508 [Conf]
  18. François Bertault, Peter Eades
    Drawing Hypergraphs in the Subset Standard (Short Demo Paper). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:164-169 [Conf]
  19. Peter Eades, Qing-Wen Feng, Xuemin Lin
    Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:113-128 [Conf]
  20. Peter Eades, Patrick Garvan
    Drawing Stressed Planar Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:212-223 [Conf]
  21. Peter Eades, Michael E. Houle, Richard Webber
    Finding the Best Viewpoints for Three-Dimensional Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:87-98 [Conf]
  22. Peter Eades, Joe Marks
    Graph Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:143-146 [Conf]
  23. Peter Eades, Candido Ferreira Xavier de Mendonça Neto
    Vertex Splitting and Tension-Free Layout [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:202-211 [Conf]
  24. Peter Eades, Joe Marks
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:224-233 [Conf]
  25. Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:423-435 [Conf]
  26. Peter Eades, Joe Marks, Stephen C. North
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:129-138 [Conf]
  27. Peter Eades, Joe Marks, Stephen C. North
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:438-445 [Conf]
  28. Peter Eades, Antonios Symvonis, Sue Whitesides
    Two Algorithms for Three Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:139-154 [Conf]
  29. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
    Three-Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:1-11 [Conf]
  30. Peter Eades, Robert F. Cohen, Mao Lin Huang
    Online Animated Graph Drawing for Web Navigation. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:330-335 [Conf]
  31. Peter Eades, Qing-Wen Feng
    Multilevel Visualization of Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:101-112 [Conf]
  32. Peter Eades, Qing-Wen Feng
    Drawing Clustered Graphs on an Orthogonal Grid. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:146-157 [Conf]
  33. Carsten Friedrich, Peter Eades
    The Marey Graph Animation Tool Demo. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:396-406 [Conf]
  34. Seok-Hee Hong, Peter Eades
    An Algorithm for Finding Three Dimensional Symmetry in Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:360-371 [Conf]
  35. Seok-Hee Hong, Peter Eades
    A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:307-317 [Conf]
  36. Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee
    Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:198-209 [Conf]
  37. Mao Lin Huang, Peter Eades
    A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:374-383 [Conf]
  38. Weidong Huang, Seok-Hee Hong, Peter Eades
    Layout Effects on Sociogram Perception. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:262-273 [Conf]
  39. Tao Lin, Peter Eades
    Integration of Declarative and Algorithmic Approaches for Layout Creation. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:376-387 [Conf]
  40. Xuemin Lin, Peter Eades
    Area Requirements for Drawing Hierarchically Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:219-229 [Conf]
  41. Colin Murray, Carsten Friedrich, Peter Eades
    HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:494-495 [Conf]
  42. Hugo A. D. do Nascimento, Peter Eades
    User Hints for Directed Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:205-219 [Conf]
  43. Aaron J. Quigley, Peter Eades
    FADE: Graph Drawing, Clustering, and Visual Abstraction. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:197-210 [Conf]
  44. Xiaobin Shen, Andrew Vande Moere, Peter Eades
    An intrusive evaluation of peripheral display. [Citation Graph (0, 0)][DBLP]
    GRAPHITE, 2005, pp:289-292 [Conf]
  45. Hugo A. D. do Nascimento, Peter Eades
    A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. [Citation Graph (0, 0)][DBLP]
    HIS, 2002, pp:634-643 [Conf]
  46. Peter Eades
    Graph Drawing Methods. [Citation Graph (0, 0)][DBLP]
    ICCS, 1996, pp:40-49 [Conf]
  47. Hiroshi Nagamochi, Peter Eades
    Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:96-111 [Conf]
  48. Seok-Hee Hong, Peter Eades
    An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:266-277 [Conf]
  49. Seok-Hee Hong, Peter Eades
    Symmetric Layout of Disconnected Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:405-414 [Conf]
  50. Seok-Hee Hong, Peter Eades, Sang Ho Lee
    Finding Planar Geometric Automorphisms in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:277-286 [Conf]
  51. Tim Dwyer, Peter Eades
    Visualising a Fund Manager Flow Graph with Columns and Worms. [Citation Graph (0, 0)][DBLP]
    IV, 2002, pp:147-152 [Conf]
  52. Wanchun Li, Seok-Hee Hong, Peter Eades
    A Framework for Visualising Large Graphs. [Citation Graph (0, 0)][DBLP]
    IV, 2005, pp:528-535 [Conf]
  53. Xiaobin Shen, Peter Eades
    Using MoneyTree To Represent Financial Data. [Citation Graph (0, 0)][DBLP]
    IV, 2004, pp:285-289 [Conf]
  54. Peter Eades, Sue Whitesides
    Nearest Neighbour Graph Realizability is NP-hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:245-256 [Conf]
  55. François Bertault, Peter Eades
    Graph Library Design. [Citation Graph (0, 0)][DBLP]
    SCCC, 2000, pp:144-151 [Conf]
  56. Seok-Hee Hong, Brendan D. McKay, Peter Eades
    Symmetric drawings of triconnected planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:356-365 [Conf]
  57. 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. [Citation Graph (0, 0)][DBLP]
    Tabletop, 2006, pp:59-62 [Conf]
  58. Peter Eades, Xiaobin Shen
    MoneyTree: Ambient Information Visualization Of Financial Data. [Citation Graph (0, 0)][DBLP]
    VIP, 2003, pp:15-18 [Conf]
  59. Hugo A. D. do Nascimento, Peter Eades
    A System for Graph Clustering Based on User Hints. [Citation Graph (0, 0)][DBLP]
    VIP, 2000, pp:73-74 [Conf]
  60. Wanchun Li, Peter Eades, Seok-Hee Hong
    Navigating Software Architectures with Constant Visual Complexity. [Citation Graph (0, 0)][DBLP]
    VL/HCC, 2005, pp:225-232 [Conf]
  61. Peter Eades, Xuemin Lin, Nicholas C. Wormald
    Performance Guarantees for Motion Planning with Temporal Uncertainty. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1993, v:25, n:1, pp:21-28 [Journal]
  62. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
    Three-Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:199-208 [Journal]
  63. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi
    Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:1-32 [Journal]
  64. Peter Eades, Nicholas C. Wormald
    Edge Crossings in Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:4, pp:379-403 [Journal]
  65. Peter Eades, Sue Whitesides
    The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:60-82 [Journal]
  66. Seok-Hee Hong, Peter Eades
    Drawing Trees Symmetrically in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:2, pp:153-178 [Journal]
  67. Seok-Hee Hong, Peter Eades
    Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:159-197 [Journal]
  68. Seok-Hee Hong, Peter Eades
    Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:67-100 [Journal]
  69. Mao Lin Huang, Peter Eades, Robert F. Cohen
    WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1998, v:30, n:1-7, pp:638-642 [Journal]
  70. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
    Algorithms for Drawing Graphs: an Annotated Bibliography. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:235-282 [Journal]
  71. Seok-Hee Hong, Peter Eades, Jonathan Hillman
    Linkless symmetric drawings of series parallel digraphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:191-221 [Journal]
  72. Seok-Hee Hong, Peter Eades, Sang Ho Lee
    Drawing series parallel digraphs symmetrically. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:3-4, pp:165-188 [Journal]
  73. Peter Eades, Antonios Symvonis, Sue Whitesides
    Three-dimensional orthogonal graph drawing algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:55-87 [Journal]
  74. Seok-Hee Hong, Brendan D. McKay, Peter Eades
    A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:2, pp:283-311 [Journal]
  75. Hugo A. D. do Nascimento, Peter Eades
    User hints: a framework for interactive optimization. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2005, v:21, n:7, pp:1171-1191 [Journal]
  76. Graham Farr, Peter Eades
    Skewness of Graphs with Small Cutsets. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:2, pp:177-194 [Journal]
  77. Peter Eades, Tao Lin, Xuemin Lin
    Two Tree Drawing Conventions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:133-153 [Journal]
  78. Peter Eades, Xuemin Lin, Roberto Tamassia
    An Algorithm for Drawing a Hierarchical Graph. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:145-156 [Journal]
  79. Mao Lin Huang, Peter Eades, Wei Lai
    On-Line Visualization and Navigation of the Global Web Structure. [Citation Graph (0, 0)][DBLP]
    International Journal of Software Engineering and Knowledge Engineering, 2003, v:13, n:1, pp:27-52 [Journal]
  80. Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades
    Width-restricted layering of acyclic digraphs with consideration of dummy nodes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:59-63 [Journal]
  81. Peter Eades, Xuemin Lin, W. F. Smyth
    A Fast and Effective Heuristic for the Feedback Arc Set Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:6, pp:319-323 [Journal]
  82. Peter Eades, Brendan D. McKay
    An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:3, pp:131-133 [Journal]
  83. Peter Eades, Charles Stirk, Sue Whitesides
    The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:2, pp:97-103 [Journal]
  84. Wei Lai, Peter Eades
    Removing edge-node intersections in drawings of graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:105-110 [Journal]
  85. Peter Eades, Michael Hickey, Ronald C. Read
    Some Hamilton Paths and a Minimal Change Algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:1, pp:19-29 [Journal]
  86. Peter Eades, John Staples
    On Optimal Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:4, pp:369-384 [Journal]
  87. Hiroshi Nagamochi, Peter Eades
    An Edge-Splitting Algorithm in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:2, pp:137-159 [Journal]
  88. Carsten Friedrich, Peter Eades
    Graph Drawing in Motion. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:3, pp:353-370 [Journal]
  89. Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi
    Drawing Clustered Graphs on an Orthogonal Grid. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:3-29 [Journal]
  90. Peter Eades, Mao Lin Huang
    Navigating Clustered Graphs Using Force-Directed Methods. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:157-181 [Journal]
  91. Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller
    Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:3, pp:220-237 [Journal]
  92. Peter Eades, David Rappaport
    The complexity of computing minimum separating polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:9, pp:715-718 [Journal]
  93. Ding-Zhu Du, Peter Eades, Xuemin Lin
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:877- [Journal]
  94. Peter Eades, Xuemin Lin
    Spring algorithms and symmetry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:379-405 [Journal]
  95. Peter Eades, Sue Whitesides
    Drawing Graphs in Two Layers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:361-374 [Journal]
  96. Peter Eades, Sue Whitesides
    The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:169, n:1, pp:23-37 [Journal]
  97. Xuemin Lin, Peter Eades
    Towards area requirements for drawing hierarchically planar graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:679-695 [Journal]
  98. Isabel F. Cruz, Peter Eades
    Guest editors' foreword. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 1995, v:6, n:3, pp:213-215 [Journal]
  99. Mao Lin Huang, Peter Eades, Junhu Wang
    On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 1998, v:9, n:6, pp:623-645 [Journal]
  100. Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama
    Layout Adjustment and the Mental Map. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 1995, v:6, n:2, pp:183-210 [Journal]
  101. Christian Müller-Tomfelde, Belinda Kellar, Peter Eades
    HxI : An Australian Initiative in ICT-Augmented Human Interactivity. [Citation Graph (0, 0)][DBLP]
    INTERACT (2), 2007, pp:675-676 [Conf]

  102. Predicting graph reading performance: a cognitive approach. [Citation Graph (, )][DBLP]


  103. Effects of Crossing Angles. [Citation Graph (, )][DBLP]


  104. How people read sociograms: a questionnaire study. [Citation Graph (, )][DBLP]


  105. A graph reading behavior: Geodesic-path tendency. [Citation Graph (, )][DBLP]


  106. The long-term evaluation of Fisherman in a partial-attention environment. [Citation Graph (, )][DBLP]


  107. Beyond time and error: a cognitive approach to the evaluation of graph drawings. [Citation Graph (, )][DBLP]


  108. On Rectilinear Drawing of Graphs. [Citation Graph (, )][DBLP]


  109. Some Constrained Notions of Planarity. [Citation Graph (, )][DBLP]


  110. Intrusive and Non-intrusive Evaluation of Ambient Displays. [Citation Graph (, )][DBLP]


  111. Drawing Graphs with Right Angle Crossings. [Citation Graph (, )][DBLP]


  112. A Multi-agent Approach using A-Teams for Graph Drawing. [Citation Graph (, )][DBLP]


  113. Fixed edge-length graph drawing is NP-hard. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002