#### Filter Results:

- Full text PDF available (164)

#### Publication Year

1985

2018

- This year (8)
- Last 5 years (100)
- Last 10 years (156)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sibren Isaacman, Richard A. Becker, +4 authors Alexander Varshavsky
- Pervasive
- 2011

People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is crucial for a range of… (More)

- Cesim Erten, Stephen G. Kobourov
- J. Graph Algorithms Appl.
- 2004

We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n)×O(n) grid, with at most three bends per edge, where n is the number of vertices. For the case when… (More)

We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use as an algorithm… (More)

In this paper, we discuss graph-theoretic approaches to software watermarking and fingerprinting. Software watermarking is used to discourage intellectual property theft and software fingerprinting… (More)

- Pawel Gajer, Stephen G. Kobourov
- J. Graph Algorithms Appl.
- 2000

This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together… (More)

Given a set S of n points in lRd, we show, for fixed d, how to construct in O(n log n) time a data structure we call the Balanced Aspect Ratio (BAR) tree. A BAR tree is a binary space partition tree… (More)

- Peter Braß, Eowyn Cenek, +6 authors Joseph S. B. Mitchell
- WADS
- 2003

We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another in… (More)

- Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
- Graph Drawing
- 2000

We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing… (More)

- Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary V. Yee
- Graph Drawing
- 2003

- Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
- 2010 IEEE Pacific Visualization Symposium…
- 2010

Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality… (More)