Publications by Year

2009

Simultaneous graph embedding with bends and circular arcs

Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, and Stephen Kobourov

Comput. Geom. 42(2) pp. 173-182, 2009.

2008

Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges

J. Joseph Fowler, Michael Jünger, Stephen Kobourov, and Michael Schulz

WG pp. 146-158, 2008.

Factorization meets the neighborhood: a multifaceted collaborative filtering model

Yehuda Koren

KDD pp. 426-434, 2008.

Importance Sampling via Load-Balanced Facility Location

Aaron Archer and Shankar Krishnan

IPCO pp. 316-330, 2008.

LiveRAC: interactive visual exploration of system management time-series data

Peter McLachlan, Tamara Munzner, Eleftherios Koutsofios, and Stephen North

CHI pp. 1483-1492, 2008. PDF (1249K)

Morphing Planar Graphs in Spherical Space

Stephen Kobourov and Matthew Landis

J. Graph Algorithms Appl. 12(1) pp. 113-127, 2008.

Rectangular layouts and contact graphs

Adam Buchsbaum, Emden Gansner, Cecilia Procopiuc, and Suresh Venkatasubramanian

ACM Transactions on Algorithms 4(1), 2008. PDF (194K)

System and method for large-scale data visualization

Emden Gansner, Eleftherios Koutsofios, Stephen North, and Russ Truscott

U.S. Patent 7454439

Tutorial on recent progress in collaborative filtering

Yehuda Koren

RecSys pp. 333-334, 2008.

Upward Straight-Line Embeddings of Directed Graphs into Point Sets

Alejandro Estrella-Balderrama, Fabrizio Frati, and Stephen Kobourov

WG pp. 122-133, 2008.

2007

Directed graphs and rectangular layouts

Adam Buchsbaum, Emden Gansner, and Suresh Venkatasubramanian

APVIS pp. 61-64, 2007. PDF (87K)

Experiences of sparse direct symmetric solvers

Jennifer Scott and Yifan Hu

ACM Trans. Math. Softw. 33(3), 2007.

Experiences of sparse direct symmetric solvers

Jennifer Scott and Yifan Hu

ACM Trans. Math. Softw. 33(3) pp. 18, 2007. PDF (214K)

Fast direction-aware proximity for graph mining

Hanghang Tong, Christos Faloutsos, and Yehuda Koren

KDD pp. 747-756, 2007. PDF (242K)

Lessons from the Netflix prize challenge

Robert Bell and Yehuda Koren

SIGKDD Explorations 9(2) pp. 75-79, 2007.

Measuring and extracting proximity graphs in networks

Yehuda Koren, Stephen North, and Chris Volinsky

TKDD 1(3), 2007. PDF (481K)

Modeling relationships at multiple scales to improve accuracy of large recommender systems

Robert Bell, Yehuda Koren, and Chris Volinsky

KDD pp. 95-104, 2007. PDF (242K)

Optimisation-on-a-manifold for global registration of multiple 3D point sets

Shankar Krishnan, Pei Lee, John Moore, and Suresh Venkatasubramanian

IJISTA 3(3/4) pp. 319-340, 2007.

Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights

Robert Bell and Yehuda Koren

ICDM pp. 43-52, 2007. PDF (141K)

Visual Analysis of Network Traffic for Resource Planning, Interactive Monitoring, and Interpretation of Security Threats

Florian Mansmann, Daniel Keim, Stephen North, Brian Rexroad, and Daniel Sheleheda

IEEE Trans. Vis. Comput. Graph. 13(6) pp. 1105-1112, 2007. PDF (1297K)

Visualizing large-scale IP traffic flows

Florian Mansmann, Fabian Fischer, Daniel Keim, and Stephen North

VMV pp. 23-30, 2007.

The Yoix scripting language: a different way of writing Java applications

Richard Drechsler and John Mocenigo

Softw., Pract. Exper. 37(6) pp. 643-667, 2007.

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

N. I. M. Gould, J. A. Scott, and Yifan Hu

ACM Trans. Math. Softw. 33(2) pp. 10, 2007. PDF (393K)

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

Nicholas Gould, Jennifer Scott, and Yifan Hu

ACM Trans. Math. Softw. 33(2) pp. 10, 2007.

2006

Column Heterogeneity as a Measure of Data Quality

Bing Dai, Nick Koudas, Beng Ooi, Divesh Srivastava, and Suresh Venkatasubramanian

CleanDB, 2006.

Drawing Directed Graphs Using Quadratic Programming

Tim Dwyer, Yehuda Koren, and Kim Marriott

IEEE Trans. Vis. Comput. Graph. 12(4) pp. 536-548, 2006. PDF (2437K)

Dynamic simplification and visualization of large maps

Nabil Mustafa, Shankar Krishnan, Gokul Varadhan, and Suresh Venkatasubramanian

International Journal of Geographical Information Science 20(3) pp. 273-302, 2006.

IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs

Tim Dwyer, Yehuda Koren, and Kim Marriott

IEEE Trans. Vis. Comput. Graph. 12(5) pp. 821-828, 2006. PDF (3552K)

Improved Circular Layouts

Emden Gansner and Yehuda Koren

Graph Drawing pp. 386-398, 2006. PDF (203K)

Measuring and extracting proximity in networks

Yehuda Koren, Stephen North, and Chris Volinsky

KDD pp. 245-255, 2006. PDF (212K)

Rapid Identification of Column Heterogeneity

Bing Dai, Nick Koudas, Beng Ooi, Divesh Srivastava, and Suresh Venkatasubramanian

ICDM pp. 159-170, 2006.

Rectangular Layouts and Contact Graphs

Adam Buchsbaum, Emden Gansner, Cecilia Procopiuc, and Suresh Venkatasubramanian

CoRR abs/cs/0611107, 2006.

Reliable implicit surface polygonization using visibility mapping

Gokul Varadhan, Shankar Krishnan, Liangjun Zhang, and Dinesh Manocha

Symposium on Geometry Processing pp. 211-221, 2006.

Restricted Strip Covering and the Sensor Cover Problem

Adam Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, and Ke Yi

CoRR abs/cs/0605102, 2006.

Spatial scan statistics: approximations and performance study

Deepak Agarwal, Andrew McGregor, Jeff Phillips, Suresh Venkatasubramanian, and Zhengyuan Zhu

KDD pp. 24-33, 2006.

Streaming and sublinear approximation of entropy and information distances

Sudipto Guha, Andrew McGregor, and Suresh Venkatasubramanian

SODA pp. 733-742, 2006.

Topology Preserving Approximation of Free Configuration Space

Gokul Varadhan, Young Kim, Shankar Krishnan, and Dinesh Manocha

ICRA pp. 3041-3048, 2006.

Visualization of Geo-spatial Point Sets via Global Shape Transformation and Local Pixel Placement

Christian Panse, Mike Sips, Daniel Keim, and Stephen North

IEEE Trans. Vis. Comput. Graph. 12(5) pp. 749-756, 2006.

The hunting of the bump: on maximizing statistical discrepancy

Deepak Agarwal, Jeff Phillips, and Suresh Venkatasubramanian

SODA pp. 1137-1146, 2006.

2005

Closing-the-Loop in NVisionIP: Integrating Discovery and Search in Security Visualizations

Kiran Lakkaraju, Ratna Bearavolu, Adam Slagell, William Yurcik, and Stephen North

VizSEC pp. 9, 2005.

DIG-COLA: Directed Graph Layout through Constrained Energy Minimization

Tim Dwyer and Yehuda Koren

INFOVIS pp. 9, 2005. PDF (751K)

Efficient and High Quality Force-Directed Graph Drawing

Yifan Hu

Mathematica Journal 10 pp. 37-71, 2005. PDF (3763K)

Global Registration of Multiple 3D Point Sets via Optimization-on-a-Manifold

Shankar Krishnan, Pei Lee, John Moore, and Suresh Venkatasubramanian

Symposium on Geometry Processing pp. 187-196, 2005. PDF (662K)

Hardware-Assisted Natural Neighbor Interpolation

Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, and Suresh Venkatasubramanian

ALENEX/ANALCO pp. 111-120, 2005.

The Hunting of the Bump: On Maximizing Statistical Discrepancy

Deepak Agarwal, Jeff Phillips, and Suresh Venkatasubramanian

CoRR abs/cs/0510004, 2005.

IEEE Workshop on Visualization for Computer Security (VizSEC 2005), 26 October 2005, Minneapolis, MN, USA

Kwan-Liu Yurcik

, IEEE Computer Society.

Journal of Graph Algorithms and Applications

Emden Gansner and Janos Pach

Brown University, 2005.

Medial-Axis-Based Cartograms

Daniel Keim, Christian Panse, and Stephen North

IEEE Computer Graphics and Applications 25(3) pp. 60-68, 2005. PDF (5571K)

On stationarity in Internet measurements through an information-theoretic lens

Balachander Krishnamurthy, Suresh Venkatasubramanian, and Harsha Madhyastha

ICDE Workshops pp. 1185, 2005.

One-dimensional layout optimization, with applications to graph drawing by axis separation

Yehuda Koren and David Harel

Comput. Geom. 32(2) pp. 115-138, 2005. PDF (2954K)

Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers

Yifan Hu and J. A. Scott

Numerical Linear Algebra with Applications 12 pp. 877-894, 2005. PDF (292K)

A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots

Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, and Dinesh Manocha

I. J. Robotic Res. 24(11) pp. 983-995, 2005.

Streaming and Sublinear Approximation of Entropy and Information Distances

Sudipto Guha, Andrew McGregor, and Suresh Venkatasubramanian

CoRR abs/cs/0508122, 2005.

Stress Majorization with Orthogonal Ordering Constraints

Tim Dwyer, Yehuda Koren, and Kim Marriott

Graph Drawing pp. 141-152, 2005. PDF (646K)

Topological Fisheye Views for Visualizing Large Graphs

Emden Gansner, Yehuda Koren, and Stephen North

IEEE Trans. Vis. Comput. Graph. 11(4) pp. 457-468, 2005. PDF (5126K)

vLOD: High-Fidelity Walkthrough of Large Virtual Environments

Jatin Chhugani, Budirijanto Purnomo, Shankar Krishnan, Jonathan Cohen, Suresh Venkatasubramanian, David Johnson, and Subodh Kumar

IEEE Trans. Vis. Comput. Graph. 11(1) pp. 35-47, 2005. PDF (1608K)

2004

CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms

Daniel Keim, Stephen North, and Christian Panse

IEEE Trans. Vis. Comput. Graph. 10(1) pp. 95-110, 2004. PDF (1630K)

Combining Hierarchy and Energy Drawing Directed Graphs

Liran Carmel, David Harel, and Yehuda Koren

IEEE Trans. Vis. Comput. Graph. 10(1) pp. 46-57, 2004. PDF (1835K)

Compressing Large Boolean Matrices using Reordering Techniques

David Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, and Suresh Venkatasubramanian

VLDB pp. 13-23, 2004. PDF (252K)

Distributed Graph Layout for Sensor Networks

Craig Gotsman and Yehuda Koren

Graph Drawing pp. 273-284, 2004. PDF (575K)

ESOLID - a system for exact boundary evaluation

John Keyser, Tim Culver, Mark Foskey, Shankar Krishnan, and Dinesh Manocha

Computer-Aided Design 36(2) pp. 175-193, 2004. PDF (446K)

Graph Drawing by High-Dimensional Embedding

David Harel and Yehuda Koren

J. Graph Algorithms Appl. 8(2) pp. 195-214, 2004. PDF (2956K)

Graph Drawing by Stress Majorization

Emden Gansner, Yehuda Koren, and Stephen North

Graph Drawing pp. 239-250, 2004. PDF (1083K)

Graph Drawing by Subspace Optimization

Yehuda Koren

VisSym pp. 65-74, 2004. PDF (2564K)

Graph-Drawing Contest Report

Franz-Josef Brandenburg, Christian Duncan, Emden Gansner, and Stephen Kobourov

Graph Drawing pp. 512-516, 2004.

Guest Editor's Introduction: Special Section on InfoVis

Daniel Keim, Tamara Munzner, and Stephen North

IEEE Trans. Vis. Comput. Graph. 10(4) pp. 446, 2004.

Laying Out Pathways with RGraphviz

Jeff Gentry, Vincent Carey, Emden Gansner, and Robert Gentleman

pp. 14--18 in R News, Thomas Lumley (Ed.), 2004.

Pattern Matching for Sets of Segments

Alon Efrat, Piotr Indyk, and Suresh Venkatasubramanian

Algorithmica 40(3) pp. 147-160, 2004.

Pixel based visual data mining of geo-spatial data

Daniel Keim, Christian Panse, Mike Sips, and Stephen North

Computers & Graphics 28(3) pp. 327-344, 2004. PDF (1792K)

Robust Linear Dimensionality Reduction

Yehuda Koren and Liran Carmel

IEEE Trans. Vis. Comput. Graph. 10(4) pp. 459-470, 2004. PDF (825K)

Special Issue of selected and extended InfoVis '03 papers - Guest Editor' Introduction

Stephen North and Tamara Munzner

Information Visualization 3(2) pp. 63-64, 2004.

The Standard ML Basis Library

Emden Gansner and John Reppy

Cambridge University Press, 2004.

Topological Fisheye Views for Visualizing Large Graphs

Emden Gansner, Yehuda Koren, and Stephen North

INFOVIS pp. 175-182, 2004. PDF (5483K)

Topology Preserving Surface Extraction Using Adaptive Subdivision

Gokul Varadhan, Shankar Krishnan, T. V. N. Sriram, and Dinesh Manocha

Symposium on Geometry Processing pp. 241-250, 2004. PDF (2726K)

Topology preserving surface extraction using adaptive subdivision

Gokul Varadhan, Shankar Krishnan, TVN Sriram, and Dinesh Manocha

SGP '04: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing pp. 235--244, 2004. PDF (2319K)

Visual Data Mining in Large Geospatial Point Sets

Daniel Keim, Christian Panse, Mike Sips, and Stephen North

IEEE Computer Graphics and Applications 24(5) pp. 36-44, 2004. PDF (1792K)

2003

Application of the two-sided depth test to CSG rendering

Sudipto Guha, Shankar Krishnan, Kamesh Munagala, and Suresh Venkatasubramanian

SI3D pp. 177-180, 2003. PDF (418K)

Approximate congruence in nearly linear time

Piotr Indyk and Suresh Venkatasubramanian

Comput. Geom. 24(2) pp. 115-128, 2003.

Axis-by-Axis Stress Minimization

Yehuda Koren and David Harel

Graph Drawing pp. 450-459, 2003. PDF (2521K)

Combinatorial and Experimental Methods for Approximate Point Pattern Matching

Martin Gavrilov, Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian

Algorithmica 38(1) pp. 59-90, 2003.

Efficient Max-Norm Distance Computation for Reliable Voxelization

Gokul Varadhan, Shankar Krishnan, Young Kim, Dinesh Manocha, and Suhas Diggavi

Symposium on Geometry Processing pp. 116-126, 2003. PDF (1953K)

Feature-Sensitive Subdivision and Isosurface Reconstruction

Gokul Varadhan, Shankar Krishnan, Young Kim, and Dinesh Manocha

IEEE Visualization pp. 99-106, 2003. PDF (922K)

The Graphics Card as a Streaming Computer

Suresh Venkatasubramanian

CoRR cs.GR/0310002, 2003. PDF (83K)

Graphviz and Dynagraph - Static and Dynamic Graph Drawing Tools

J. Ellson, Emden Gansner, L. Koutsofios, Stephen North, and G. Woodhull

Graph Drawing Software (Michael Junger and Petra Mutzel, eds.), pp. 127-148, Springer-Verlag, 2003.. PDF (36K)

A Hybrid Approach for Determinant Signs of Moderate-Sized Matrices

Tim Culver, John Keyser, Dinesh Manocha, and Shankar Krishnan

Int. J. Comput. Geometry Appl. 13(5) pp. 399-417, 2003. PDF (147K)

Network engineering - Control of dynamic link topology in user networks

Lily Cheng, John Ellson, Admela Jukan, Patrice Lamy, and Eve Varma

Bell Labs Technical Journal 8(1) pp. 207-218, 2003.

On Spectral Graph Drawing

Yehuda Koren

COCOON pp. 496-508, 2003. PDF (645K)

PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets

Daniel Keim, Christian Panse, Mike Sips, and Stephen North

ICDM pp. 565-568, 2003.

Streaming Geometric Optimization Using Graphics Hardware

Pankaj Agarwal, Shankar Krishnan, Nabil Mustafa, and Suresh Venkatasubramanian

ESA pp. 544-555, 2003. PDF (242K)

The Visualization Market: Open Source vs. Commercial Approaches

Jeremy Jaech, Stephen North, Mike Peery, Will Schroeder, and Jim Thomas

IEEE Visualization pp. 21-24, 2003.

Visualization of Labeled Data Using Linear Transformations

Yehuda Koren and Liran Carmel

INFOVIS, 2003. PDF (509K)

Visualizing Software for Telecommunication Services

Emden Gansner, John Mocenigo, and Stephen North

SOFTVIS pp. 151-157, 215-216, 2003. PDF (252K)

Visualizing geographic information: VisualPoints vs. CartoDraw

Daniel Keim, Stephen North, Christian Panse, and Jörn Schneidewind

Information Visualization 2(1) pp. 58-67, 2003.

A two-way visualization method for clustered data

Yehuda Koren and David Harel

KDD pp. 589-594, 2003. PDF (1272K)

2002

ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs

Yehuda Koren, Liran Carmel, and David Harel

INFOVIS pp. 137-144, 2002. PDF (783K)

Drawing Directed Graphs Using One-Dimensional Optimization

Liran Carmel, David Harel, and Yehuda Koren

Graph Drawing pp. 193-206, 2002. PDF (1213K)

ESOLID---A System for Exact Boundary Evaluation

John Keyser, Tim Culver, Mark Foskey, Shankar Krishnan, and Dinesh Manocha

Symposium on Solid Modeling and Applications pp. 23-34, 2002. PDF (383K)

Efficient Cartogram Generation: A Comparison

Daniel Keim, Stephen North, Christian Panse, and Jörn Schneidewind

INFOVIS pp. 33-36, 2002.

A Fast Multi-Scale Method for Drawing Large Graphs

David Harel and Yehuda Koren

J. Graph Algorithms Appl. 6(3) pp. 179-202, 2002. PDF (3351K)

A Fast and Efficient Projection-Based Approach for Surface Reconstruction

M. Gopi and Shankar Krishnan

SIBGRAPI pp. 179-186, 2002. PDF (5424K)

A Functional Approach to External Graph Algorithms

James Abello, Adam Buchsbaum, and Jeffery Westbrook

Algorithmica 32(3) pp. 437-458, 2002.

Graph Drawing by High-Dimensional Embedding

David Harel and Yehuda Koren

Graph Drawing pp. 207-219, 2002. PDF (2276K)

Hardware-assisted computation of depth contours

Shankar Krishnan, Nabil Mustafa, and Suresh Venkatasubramanian

SODA pp. 558-567, 2002. PDF (176K)

Heuristics for semi-external depth first search on directed graphs

Jop Sibeyn, James Abello, and Ulrich Meyer

SPAA pp. 282-292, 2002.

MGV: A System for Visualizing Massive Multidigraphs

James Abello and Jeffrey Korn

IEEE Trans. Vis. Comput. Graph. 8(1) pp. 21-38, 2002.

Massive Quasi-Clique Detection

James Abello, Mauricio Resende, and Sandra Sudarsky

LATIN pp. 598-612, 2002.

Modeling and Rendering of Real Environments

Wagner Corrêa, Manuel Oliveira, Cláudio Silva, and Jianning Wang

RITA 9(2) pp. 127-156, 2002.

A Multi-scale Algorithm for the Linear Arrangement Problem

Yehuda Koren and David Harel

WG pp. 296-309, 2002. PDF (506K)

Out-of-core sort-first parallel rendering for cluster-based tiled displays

Wagner Corrêa, James Klosowski, and Cláudio Silva

EGPGV pp. 89-96, 2002.

A Parallel Ultra-High Resolution MPEG-2 Video Decoder for PC Cluster Based Tiled Display Systems

Han Chen, Kai Li, and Bin Wei

IPDPS, 2002. PDF (704K)

Towards Point-Based Acquisition and Rendering of Large Real-World Environments

Wagner Corrêa, Shachar Fleishman, and Cláudio Silva

SIBGRAPI pp. 59-, 2002.

Visibility Graphs and Oriented Matroids

James Abello and Krishna Kumar

Discrete & Computational Geometry 28(4) pp. 449-465, 2002.

The Yoix Scripting Language as a Tool for Building Web-Based Systems

Richard Drechsler and John Mocenigo

NETWORKING Workshops pp. 90-103, 2002. PDF (1230K)

2001

BOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids

Shankar Krishnan, Dinesh Manocha, M. Gopi, Tim Culver, and John Keyser

Int. J. Comput. Geometry Appl. 11(1) pp. 105-144, 2001. PDF (993K)

Characterizing large DNS traces using graphs

Charles Cranor, Emden Gansner, Balachander Krishnamurthy, and Oliver Spatscheck

Internet Measurement Workshop pp. 55-67, 2001. PDF (179K)

Clustering spatial data using random walks

David Harel and Yehuda Koren

KDD pp. 281-286, 2001. PDF (9321K)

Efficient Acquisition of Web Data through Restricted Query Interfaces

Simon Byers, Juliana Freire, and Cláudio Silva

WWW Posters, 2001.

Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm

James Klosowski and Cláudio Silva

IEEE Trans. Vis. Comput. Graph. 7(4) pp. 365-379, 2001.

Graphviz - Open Source Graph Drawing Tools

John Ellson, Emden Gansner, Eleftherios Koutsofios, Stephen North, and Gordon Woodhull

Graph Drawing pp. 483-484, 2001. PDF (288K)

Hardware-assisted view-dependent map simplification

Nabil Mustafa, Eleftherios Koutsofios, Shankar Krishnan, and Suresh Venkatasubramanian

Symposium on Computational Geometry pp. 50-59, 2001. PDF (183K)

Integrating Occlusion Culling with View-Dependent Rendering

Jihad El-Sana, Neta Sokolovsky, and Cláudio Silva

IEEE Visualization, 2001.

Load balancing for unstructured mesh applications

Yifan Hu and R. J. Blake

pp. 117--148 in Progress in computer research, 2001. PDF (568K)

A Memory Insensitive Technique for Large Model Simplification

Peter Lindstrom and Cláudio Silva

IEEE Visualization, 2001.

On Clustering Using Random Walks

David Harel and Yehuda Koren

FSTTCS pp. 18-41, 2001. PDF (1297K)

Online Hierarchical Graph Drawing

Stephen North and Gordon Woodhull

Graph Drawing pp. 232-246, 2001. PDF (247K)

Out-Of-Core Rendering of Large, Unstructured Grids

Ricardo Farias and Cláudio Silva

IEEE Computer Graphics and Applications 21(4) pp. 42-50, 2001.

PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation

Shankar Krishnan, Mark Foskey, Tim Culver, John Keyser, and Dinesh Manocha

Symposium on Computational Geometry pp. 274-283, 2001. PDF (617K)

Parallelising FLITE3D -- a multigrid finite element Euler solver

Yifan Hu, D. R. Emerson, M. Ashworth, K. C. F. Maguire, and R. J. Blake

Journal of Numerical Methods in Fluids 35 pp. 809-827, 2001. PDF (386K)

Parallelizing the ZSWEEP Algorithm for Distributed-Shared Memory Architectures (ST)

Ricardo Farias and Cláudio Silva

Volume Graphics, 2001.

Pattern matching for sets of segments

Alon Efrat, Piotr Indyk, and Suresh Venkatasubramanian

SODA pp. 295-304, 2001. PDF (338K)

Point Set Surfaces

Marc Alexa, Johannes Behr, Daniel Cohen-Or, Shachar Fleishman, David Levin, and Cláudio Silva

IEEE Visualization, 2001.

REportal: A Web-Based Portal Site for Reverse Engineering

Spiros Mancoridis, Timothy Souder, Yih-Farn Chen, Emden Gansner, and Jeffrey Korn

WCRE pp. 221-230, 2001. PDF (101K)

Supercomputers and high performance computing

Yifan Hu

pp. 1-42 in The focus of Science and Technology by Chinese-English Scholars, W. Z. Zou (Ed.), 2001.

Visualization of State Transition Graphs Graph Sketches

James Abello, Irene Finocchi, and Jeffrey Korn

INFOVIS pp. 67-, 2001.

Visualizing and Analyzing Software Infrastructures

Adam Buchsbaum, Yih-Farn Chen, Huale Huang, Eleftherios Koutsofios, John Mocenigo, Anne Rogers, Michael Jankowsky, and Spiros Mancoridis

IEEE Software 18(5) pp. 62-70, 2001. PDF (4430K)

A multilevel algorithm for wavefront reduction

Yifan Hu and J. A. Scott

SIAM Journal on Scientific Computing 23 pp. 1352-1375, 2001. PDF (1205K)

A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids

Yi-Jen Chiang, Ricardo Farias, Cláudio Silva, and Bin Wei

IEEE Symposium on Parallel and Large-Data Visualization and Graphics pp. 59-66, 2001.

2000

The AT&T AST OpenSource Software Collection

Glenn Fowler, David Korn, Stephen North, and Kiem-Phong Vo

USENIX Annual Technical Conference, FREENIX Track pp. 187-200, 2000. PDF (255K)

Approximate congruence in nearly linear time

Piotr Indyk and Suresh Venkatasubramanian

SODA pp. 354-360, 2000.

Corrections to 'The Prioritized-Layered Projection Algorithm for Visible Set Estimation'

James Klosowski and Cláudio Silva

IEEE Trans. Vis. Comput. Graph. 6(4) pp. 380, 2000.

Efficient and exact manipulation of algebraic points and curves

John Keyser, Tim Culver, Dinesh Manocha, and Shankar Krishnan

Computer-Aided Design 32(11) pp. 649-662, 2000. PDF (557K)

A Fast Multi-Scale Method for Drawing Large Graphs

David Harel and Yehuda Koren

Advanced Visual Interfaces pp. 282-285, 2000. PDF (293K)

A Fast Multi-scale Method for Drawing Large Graphs

David Harel and Yehuda Koren

Graph Drawing pp. 183-196, 2000. PDF (293K)

Graph Data Format Workshop Report

Ulrik Brandes, M. Scott Marshall, and Stephen North

Graph Drawing pp. 407-409, 2000.

Hunting Down Glitches in Massive Time Series Data

Tamraparni Dasu, Theodore Johnson, and Eleftherios Koutsofios

IQ pp. 190-199, 2000.

On external memory graph traversal

Adam Buchsbaum, Michael Goldwasser, Suresh Venkatasubramanian, and Jeffery Westbrook

SODA pp. 859-860, 2000.

On the decidability of accessibility problems (extended abstract)

Rajeev Motwani, Rina Panigrahy, Vijay Saraswat, and Suresh Venkatasubramanian

STOC pp. 306-315, 2000.

Partitioning Trimmed Spline Surfaces into NonSelf-Occluding Regions for Visibility Computation

Shankar Krishnan and Dinesh Manocha

Graphical Models 62(4) pp. 283-307, 2000. PDF (308K)

Pattern Matching for sets of segments

Alon Efrat, Piotr Indyk, and Suresh Venkatasubramanian

CoRR cs.CG/0009013, 2000.

The Prioritized-Layered Projection Algorithm for Visible Set Estimation

James Klosowski and Cláudio Silva

IEEE Trans. Vis. Comput. Graph. 6(2) pp. 108-123, 2000.

Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation

M. Gopi, Shankar Krishnan, and Cláudio Silva

Comput. Graph. Forum 19(3), 2000. PDF (1041K)

Time-Critical Rendering of Irregular Grids

Ricardo Farias, Joseph Mitchell, Cláudio Silva, and Brian Wylie

SIBGRAPI pp. 243-250, 2000.

Visualization Research with Large Displays

Bin Wei, Cláudio Silva, Eleftherios Koutsofios, Shankar Krishnan, and Stephen North

IEEE Computer Graphics and Applications 20(4) pp. 50-54, 2000. PDF (253K)

Visualizing Massive Multi-Digraphs

James Abello and Jeffrey Korn

INFOVIS pp. 39-48, 2000.

ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering

Ricardo Farias, Joseph Mitchell, and Cláudio Silva

Volviz pp. 91-99, 2000.

A multilevel unsymmetric matrix ordering algorithm for parallel process simulation

Yifan Hu, K. C. F. Maguire, and R. J. Blake

Computers and Chemical Engineering 23 pp. 1631-1647, 2000. PDF (574K)

An open graph visualization system and its applications to software engineering

Emden Gansner and Stephen North

Softw., Pract. Exper. 30(11) pp. 1203-1233, 2000. PDF (614K)

1999

The Ball-Pivoting Algorithm for Surface Reconstruction

Fausto Bernardini, Joshua Mittleman, Holly Rushmeier, Cláudio Silva, and Gabriel Taubin

IEEE Trans. Vis. Comput. Graph. 5(4) pp. 349-359, 1999.

Bunch: A Clustering Tool for the Recovery and Maintenance of Software System Structures

Spiros Mancoridis, Brian Mitchell, Yih-Farn Chen, and Emden Gansner

ICSM pp. 50-, 1999. PDF (376K)

CHIME: Customizable Hyperlink Insertion and Maintenance Engine for Software Engineering Environments

Premkumar Devanbu, Yih-Farn Chen, Emden Gansner, Hausi Müller, and Johannes Martin

ICSE pp. 473-482, 1999. PDF (185K)

Chava: Reverse Engineering and Tracking of Java Applets

Jeffrey Korn, Yih-Farn Chen, and Eleftherios Koutsofios

WCRE pp. 314-325, 1999.

Efficient Compression of Non-Manifold Polygonal Meshes

André Guéziec, Frank Bossen, Gabriel Taubin, and Cláudio Silva

IEEE Visualization pp. 73-80, 1999.

Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: I - representations

John Keyser, Shankar Krishnan, and Dinesh Manocha

Computer Aided Geometric Design 16(9) pp. 841-859, 1999. PDF (266K)

Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: II - computation

John Keyser, Shankar Krishnan, and Dinesh Manocha

Computer Aided Geometric Design 16(9) pp. 861-882, 1999. PDF (252K)

Efficient compression of non-manifold polygonal meshes

André Guéziec, Frank Bossen, Gabriel Taubin, and Cláudio Silva

Comput. Geom. 14(1-3) pp. 137-166, 1999.

Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids

João Comba, James Klosowski, Nelson Max, Joseph Mitchell, Cláudio Silva, and Peter Williams

Comput. Graph. Forum 18(3) pp. 369-376, 1999.

Geometric Matching Under Noise: Combinatorial Bounds and Algorithms

Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian

SODA pp. 457-465, 1999.

Geometric Pattern Matching: A Performance Study

Martin Gavrilov, Piotr Indyk, Rajeev Motwani, and Suresh Venkatasubramanian

Symposium on Computational Geometry pp. 79-85, 1999.

Large-Scale Network Visualization

J. Abello, E.R Koutsofios and Stephen North

Computer Graphics 33(3) pp. 13--15, 1999. PDF (128K)

MAPC: A Library for Efficient and Exact Manipulation of Algebraic Points and Curves

John Keyser, Tim Culver, Dinesh Manocha, and Shankar Krishnan

Symposium on Computational Geometry pp. 360-369, 1999. PDF (323K)

Ordering Unsymmetric Matrices into Bordered Block Diagonal Form for Parallel Processing

Yifan Hu, K. C. F. Maguire, and R. J. Blake

Lecture Notes in Computer Science 1685 pp. 295-302, 1999.

Rendering on a Budget: A Framework for Time-Critical Rendering

James Klosowski and Cláudio Silva

IEEE Visualization pp. 115-122, 1999.

Uncluttering Force-Directed Graph Layouts

David Dobkin, Alejo Hausner, Emden Gansner, and Stephen North

Symposium on Computational Geometry pp. 425-426, 1999.

Visual Exploration of Large Telecommunication Data Sets

Daniel Keim, Eleftherios Koutsofios, and Stephen North

UIDIS pp. 12-20, 1999.

Visualizing Large-Scale Telecommunication Networks and Services

Eleftherios Koutsofios, Stephen North, Russell Truscott, and Daniel Keim

IEEE Visualization pp. 457-461, 1999. PDF (88K)

An improved diffusion algorithm for dynamic load balancing

Yifan Hu and R. J. Blake

Parallel Computing 25 pp. 417-444, 1999. PDF (378K)

1998

AC++ Data Model Supporting Reachability Analysis and Dead Code Detection

Yih-Farn Chen, Emden Gansner, and Eleftherios Koutsofios

IEEE Trans. Software Eng. 24(9) pp. 682-694, 1998. PDF (225K)

The AT&T Internet Difference Engine: Tracking and Viewing Changes on the Web

Fred Douglis, Thomas Ball, Yih-Farn Chen, and Eleftherios Koutsofios

World Wide Web 1(1) pp. 27-44, 1998. PDF (514K)

A Functional Approach to External Graph Algorithms

James Abello, Adam Buchsbaum, and Jeffery Westbrook

ESA pp. 332-343, 1998.

Graph-Drawing Contest Report

Peter Eades, Joe Marks, Petra Mutzel, and Stephen North

Graph Drawing pp. 423-435, 1998.

Illumination of Orthogonal Polygons with Orthogonal Floodlights

James Abello, Vladimir Estivill-Castro, Thomas Shermer, and Jorge Urrutia

Int. J. Comput. Geometry Appl. 8(1) pp. 25-38, 1998.

Improved Force-Directed Layouts

Emden Gansner and Stephen North

Graph Drawing pp. 364-373, 1998. PDF (149K)

Parallel controlled random search algorithms for shape optimization

Yifan Hu and R. J. Blake

pp. 345-352 in Parallel Computational Fluid Dynamics: Recent Developments and Advances Using Parallel Computer, 1998. PDF (192K)

A Path Router for Graph Drawing

David Dobkin and Emden Gansner

Symposium on Computational Geometry pp. 415-416, 1998.

Performance issues of a distributed frame buffer on a multicomputer

Bin Wei, Douglas Clark, Edward Felten, Kai Li, and Gordon Stoll

HWWS '98: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware pp. 87--96, 1998. PDF (149K)

Rapid and Accurate Contact Determination between Spline Models using ShellTrees

Shankar Krishnan, M. Gopi, Ming Lin, Dinesh Manocha, and A. Pattekar

Comput. Graph. Forum 17(3) pp. 315-326, 1998. PDF (230K)

Short and Smooth Polygonal Paths

James Abello and Emden Gansner

LATIN pp. 151-162, 1998. PDF (183K)

Using Automatic Clustering to Produce High-Level System Organizations of Source Code

Spiros Mancoridis, Brian Mitchell, C. Rorres, Yih-Farn Chen, and Emden Gansner

IWPC pp. 45-, 1998. PDF (217K)

Website News: A Website Tracking and Visualization Service

Yih-Farn Chen and Eleftherios Koutsofios

WebNet, 1998.

An optimal migration algorithm for dynamic load balancing

Yifan Hu, R. J. Blake, and D. R. Emerson

Concurrency: Practice and Experience 10 pp. 467-483, 1998. PDF (279K)

The optimal property of polynomial based diffusion-like algorithms in dynamic load balancing

Yifan Hu and R. J. Blake

in Computational Dynamics'98, K. D. Papailiou, D. Tsahalis, J. Périaux and D. Knörzer (Eds.), 1998. PDF (117K)

1997

Algebraic pruning: a fast technique for curve and surface intersection

Dinesh Manocha and Shankar Krishnan

Computer Aided Geometric Design 14(9) pp. 823-845, 1997. PDF (202K)

Algorithms for Scheduling with Applications to Parallel Computing

Yifan Hu and R. J. Blake

Advances in Engineering Software 28 pp. 563-572, 1997. PDF (225K)

Auditdraw: Generating Audits the FAST Way

Neeraj Gupta, Lalita Jagadeesan, Eleftherios Koutsofios, and David Weiss

RE pp. 188-197, 1997.

A C++ Data Model Supporting Reachability Analysis and Dead Code Detection

Yih-Farn Chen, Emden Gansner, and Eleftherios Koutsofios

ESEC / SIGSOFT FSE pp. 414-431, 1997. PDF (225K)

An Efficient Surface Intersection Algorithm Based on Lower-Dimensional Formulation

Shankar Krishnan and Dinesh Manocha

ACM Trans. Graph. 16(1) pp. 74-106, 1997. PDF (202K)

Efficient and Accurate B-rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic

John Keyser, Shankar Krishnan, and Dinesh Manocha

Symposium on Solid Modeling and Applications pp. 42-55, 1997. PDF (278K)

Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic

John Keyser, Shankar Krishnan, and Dinesh Manocha

SMA '97: Proceedings of the fourth ACM symposium on Solid modeling and applications pp. 42--55, 1997.

Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings

Stephen North

Lecture Notes in Computer Science 1190, Springer.

Graph-Drawing Contest Report

Peter Eades, Joe Marks, and Stephen North

Graph Drawing pp. 438-445, 1997.

Grappa: A GRAPh PAckage in Java

Naser Barghouti, John Mocenigo, and Wenke Lee

Graph Drawing pp. 336-343, 1997. PDF (2126K)

Implementing a General-Purpose Edge Router

David Dobkin, Emden Gansner, Eleftherios Koutsofios, and Stephen North

Graph Drawing pp. 262-271, 1997. PDF (134K)

Interactive Boundary Computation of Boolean Combinations of Sculptured Solids

Shankar Krishnan, M. Gopi, Dinesh Manocha, and Mark Mine

Comput. Graph. Forum 16(3) pp. 67-78, 1997. PDF (169K)

Representation, boundary computation and fast display of CSG models with NURBS primitives

Shankar Krishnan, Subodh Kumar, and Dinesh Manocha

GMCAD '96: Proceedings of the fifth IFIP TC5/WG5.2 international workshop on geometric modeling in computer aided design on Product modeling for computer integrated design and manufacture pp. 347--359, 1997.

WebCiao: A Website Visualization and Tracking System

Yih-Farn Chen and Eleftherios Koutsofios

WebNet, 1997. PDF (157K)

1996

Algebraic Loop Detection & Evaluation Algorithms for Curve & Surface Interrogations

Shankar Krishnan and Dinesh Manocha

Graphics Interface pp. 87-94, 1996. PDF (249K)

Graph-Drawing Contest Report

Peter Eades, Joe Marks, and Stephen North

Graph Drawing pp. 129-138, 1996.

PVR: High-Performance Volume Rendering

Cláudio Silva, Arie Kaufman, and Constantine Pavlakos

IEEE Comput. Sci. Eng. 3(4) pp. 18--28, 1996.

Solving algebraic systems using matrix computations

Dinesh Manocha and Shankar Krishnan

SIGSAM Bull. 30(4) pp. 4--21, 1996. PDF (471K)

WebGUIDE: Querying and Navigating Changes in Web Repositories

Fred Douglis, Thomas Ball, Yih-Farn Chen, and Eleftherios Koutsofios

Computer Networks 28(7-11) pp. 1335-1344, 1996.

The effect of the grid aspect ratio on the convergence of parallel CFD algorithms

Y. F. Hu, J. G. Carter and R. J. Blake

pp. 289-296 in Parallel Computational Fluid Dynamics: Implementations and Results Using Parallel Computers, A. Ecer et al (Ed.), 1996. PDF (93K)

A parallel extrapolation algorithms for DAE's from process engineering

Yifan Hu and R. J. Blake

in Numerical Methods in Engineering '96, J. -A. Désidéri et al. (Ed.), 1996. PDF (103K)

1995

Ciao: a graphical navigator for software and document repositories

Yih-Farn Chen, Glenn Fowler, Eleftherios Koutsofios, and Ryan Wallach

ICSM pp. 66-75, 1995. PDF (289K)

Improvise: Interactive Multimedia Process Visualization Environment

Naser Barghouti, Eleftherios Koutsofios, and Edith Cohen

ESEC pp. 28-43, 1995. PDF (243K)

Incremental Layout in DynaDAG

Stephen North

Graph Drawing pp. 409-418, 1995. PDF (228K)

Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets

Shankar Krishnan and Dinesh Manocha

ISSAC pp. 59-67, 1995. PDF (240K)

Partitioning and scheduling algorithms and their implementation in FELISA-an unstructured grid Euler solver

Yifan Hu and R. J. Blake

pp. 3-12 in Parallel Computational Fluid Dynamics 93: New Trends and Advances, A. Ecer et al. (Ed.), 1995. PDF (97K)

Representation and Computation of Boolean Combinations of Sculptured Models

Shankar Krishnan, Atul Narkhede, and Dinesh Manocha

Symposium on Computational Geometry pp. C8-C9, 1995. PDF (113K)

Synchronization for a multi-port frame buffer on a mesh-connected multicomputer

Bin Wei, Gordon Stoll, Douglas Clark, Edward Felten, Kai Li, and Patrick Hanrahan

PRS '95: Proceedings of the IEEE symposium on Parallel rendering pp. 81--88, 1995.

The communication performance of the Cray T3D and its effect on iterative solvers

Yifan Hu, D. R. Emerson, and R. J. Blake

Parallel Computing 22 pp. 928-944, 1995. PDF (147K)

1994

Numerical experiences with partitioning of unstructured meshes

Yifan Hu and R. J. Blake

Parallel Computing 20 pp. 815-829, 1994. PDF (124K)

A family of optimally conditioned quasi-Newton updates for unconstrained optimization

Yifan Hu and C. Storey

Journal of Optimization Theory and Applications 83 pp. 421-431, 1994. PDF (206K)

1993

Apparatus and methods for visualizing operation of a system of processes

Glenn Fowler, David Korn, Stephen North, and Eleftherios Koutsofios

U.S. Patent 5551037

Dictionary and Graph Libraries

Stephen North and Kiem-Phong Vo

USENIX Winter pp. 1-12, 1993.

Graphs employing clusters

Stephen North

U.S. Patent 5450535

A Multi-threaded Higher-order User Interface Toolkit

Emden Gansner and John Reppy

pp. 61--80 in User Interface Software, L. Bass and P. Dewan (Eds.), 1993. PDF (143K)

Preconditioned low-order Newton methods

Yifan Hu and C. Storey

Journal of Optimization Theory and Applications 79 pp. 311-331, 1993. PDF (175K)

A Technique for Drawing Directed Graphs

Emden Gansner, Eleftherios Koutsofios, Stephen North, and Kiem-Phong Vo

IEEE Trans. Software Eng. 19(3) pp. 214-230, 1993. PDF (90K)

1992

A Foundation for User Interface Construction

Emden Gansner and John Reppy

pp. 239--260 in Languages for Developing User Interfaces, Brad A. Myers (Ed.), 1992. PDF (203K)

A foundation for user interface construction

Emden Gansner and John Reppy

pp. 239--260 in Languages for developing user interfaces, 1992. PDF (203K)

1991

Efficient generalized conjugate gradient algorithms, part II. Implementation

Yifan Hu and C. Storey

Journal of Optimization Theory and Applications 69 pp. 139-152, 1991.

A global convergence result for conjugate gradient methods

Yifan Hu and C. Storey

Journal of Optimization Theory and Applications 71 pp. 399-405, 1991.

1989

Cone quasi-convexity and connectedness of sets of efficient and weakly efficient solutions to multiobjective optimization problems in topological vector spaces

Y. Hu and Yifan Hu

Acta MathematicaeApplicatae Sinica 12 pp. 115-123, 1989.

Graph Visualization in Software Analysis

Emden Gansner, Eleftherios Koutsofios, Stephen North, and K.-P. Vo

Symposium on Assessment of Quality Software Development Tools pp. 226--237, 1989. PDF (167K)

Technique for drawing directed graphs

Emden Gansner, Stephen North, and Kiem-Phong Vo

U.S. Patent 4953106

1988

DAG - A Program to Draw Directed Graphs

Emden Gansner, Stephen North, and K.-P. Vo

Software--Practice and Experiences 17(1) pp. 1047--1062, 1988.

Iris: A Class-Based Window Library

Emden Gansner

C++ Conference pp. 283-292, 1988. PDF (190K)

1987

The Chromatic Generating Function

Emden Gansner and K.-P. Vo

Linear and Multilinear Algebra 22 pp. 87--93, 1987.

Concurrent garbage collection on stock hardware

Stephen North and John Reppy

FPCA pp. 113-133, 1987.

1986

A Foundation for Programming Environments

Emden Gansner and J.H. Reppy

ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments pp. 218--227, 1986.

1985

A method for drawing graphs

R. J. Lipton, Stephen North, and J. S. Sandberg

SCG '85: Proceedings of the first annual symposium on Computational geometry pp. 153--160, 1985. PDF (6694K)

1983

Parenthesizations of finite distributive lattices

Emden Gansner

Algebra Universalis 16 pp. 287--303, 1983.

SYNED -- A Language-based Editor for an Interactive Programming Environment

Emden Gansner, J. R. Horgan, D.J. Moore, P. Surko, D.E. Swartwout, and J.H. Reppy

IEEE Computer Society International Conference pp. 406--410, 1983. PDF (31K)

VLSI Layout as Programming

Richard Lipton, Jacobo Valdes, Gopalakrishnan Vijayan, Stephen North, and Robert Sedgewick

ACM Trans. Program. Lang. Syst. 5(3) pp. 405-421, 1983.

1982

On the lattice of order ideals of an up-down poset

Emden Gansner

Discrete Mathematics 39(2) pp. 113-122, 1982.

On the lattice of order ideals of an up-down poset

Emden Gansner

Discrete Mathematics 39 pp. 113--122, 1982.

Semantics and Correctness of a Query Language Translation

Emden Gansner, J. Horgan, C.M.R. Kintala, D. Moore, and P. Surko

Symposium on Principles of Programming Languages pp. 278--287, 1982.

1981

Acyclic Digraphs, Young Tableaux and Nilpotent Matrices

Emden Gansner

SIAM J. Alg. Disc. Meth 2 pp. 429--440, 1981.

The Enumeration of Plane Partitions via the Burge Correspondence

Emden Gansner

Illinois J. Mathematics 25 pp. 533--554, 1981.

The Hillman-Grassl Correspondence and the Enumeration of Reverse Plane Partitions

Emden Gansner

J. Comb. Theory, Ser. A 30(1) pp. 71-89, 1981.

The Hillman-Grassl Correspondence and the Enumeration of Reverse Plane Partitions

Emden Gansner

Journal of Combinatorial Theory, Series A 30(1) pp. 71--89, 1981.

Matrix Correspondences of Plane Partitions

Emden Gansner

Pacific Journal of Mathematics 92 pp. 295--315, 1981.

1980

On the Equality of Two Plane Partition Correspondences

Emden Gansner

Discrete Mathematics 30 pp. 121--132, 1980.

1977

A Characterization of Permutations via Skew-Hooks

Emden Gansner

J. Comb. Theory, Ser. A 23(2) pp. 176-179, 1977.

A Characterization of Permutations via Skew-Hooks

Emden Gansner

Journal of Combinatorial Theory, Series A 23(2) pp. 176--179, 1977.