Right angle crossing graphs and 1-planarity von Eades, Peter, Liotta, Giuseppe

Volltext

Acute Constraints in Straight-Line Drawings of Planar Graphs von SETO, Akane, SHURBEVSKI, Aleksandar, NAGAMOCHI, Hiroshi, EADES, Peter

Volltext

Measuring effectiveness of graph visualizations: A cognitive load perspective von Huang, Weidong, Eades, Peter, Hong, Seok-Hee

Volltext

Circular right-angle crossing drawings in linear time von Reisi Dehkordi, Hooman, Eades, Peter, Hong, Seok-Hee, Nguyen, Quan

Volltext

A Linear-Time Algorithm for Testing Outer-1-Planarity von Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, Suzuki, Yusuke

Volltext

Graph Planarity by Replacing Cliques with Paths von Angelini, Patrizio, Eades, Peter, Hong, Seok-Hee, Klein, Karsten, Kobourov, Stephen, Liotta, Giuseppe, Navarra, Alfredo, Tappini, Alessandra

Volltext

BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure von Koizumi, Kenichi, Eades, Peter, Hiraki, Kei, Inaba, Mary

Volltext

A characterization of complete bipartite RAC graphs von Didimo, Walter, Eades, Peter, Liotta, Giuseppe

Volltext

BC tree-based spectral sampling for big complex network visualization von Hu, Jingming, Chu, Tuan Tran, Hong, Seok-Hee, Chen, Jialu, Meidiana, Amyra, Torkel, Marnijati, Eades, Peter, Ma, Kwan-Liu

Volltext

Algorithms and Computation: 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings von Eades, Peter, Takaoka, Tadao

Volltext

Drawing graphs with right angle crossings von Didimo, Walter, Eades, Peter, Liotta, Giuseppe

Volltext

Straight-Line Drawability of a Planar Graph Plus an Edge von Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Katoh, Naoki, Poon, Sheung-Hung

Volltext

Bounds on the crossing resolution of complete geometric graphs von Di Giacomo, Emilio, Didimo, Walter, Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe

Volltext

FADE: Graph Drawing, Clustering, and Visual Abstraction von Quigley, Aaron, Eades, Peter

Volltext

Introducing fairness in network visualization von Eades, Peter, Hong, Seokhee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso, Wismath, Stephen

Volltext

Straight-line drawing algorithms for hierarchical graphs and clustered graphs von EADES, Peter, QINGWEN FENG, XUEMIN LIN, NAGAMOCHI, Hiroshi

Volltext

Automorphism Faithfulness Metrics for Symmetric Graph Drawings von Meidiana, Amyra, Hong, Seok-Hee, Eades, Peter, Keim, Daniel

Volltext

SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing von Meidiana, Amyra, Hong, Seok-Hee, Cai, Shijun, Torkel, Marnijati, Eades, Peter

Volltext

A Linear-Time Algorithm for Testing Outer-1-Planarity von Hong, Seok-Hee, Eades, Peter, Katoh, Naoki, Liotta, Giuseppe, Schweitzer, Pascal, Suzuki, Yusuke

Volltext

Algorithms and Computations: 6th International Symposium, ISAAC '95 Cairns, Australia, December 4–6, 1995 Proceedings von Staples, John, Eades, Peter, Katoh, Naoki, Moffat, Alistair

Volltext