• Publications
  • Influence
A unified approach to visibility representations of planar graphs
This work studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments, and considers three types of visibility representations. Expand
Algorithms for Drawing Graphs: an Annotated Bibliography
A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas. Expand
Graph Drawing
Planar grid embedding in linear time
A new algorithm is presented that runs in O(n) time and produces grid embeddings with the following properties: the total number of bends is at most 2.4n+2; the number of bending along each edge is at least 4; the length of every edge is O( n); and the area of the embedding is O (n/sup 2/). Expand
Difference bases and sparse sensor arrays
Several new analytical difference base structures that result in near optimal low-redundancy sensor arrays are introduced and extensions to the idea of difference bases that may yield useful results for sensor array design are discussed. Expand
Improved Techniques for Estimating Signal Probabilities
An improved algorithm is offered for estimating the signal probabilities that takes into account the first-order effects of reconvergent input leads, and it is demonstrated that this algorithm is linear in the product of the size of the network and the number of inputs. Expand
A Framework for Circular Drawings of Networks
A framework for producing circular drawings of networks represented by non-biconnected graphs and results of an extensive experimental study show the approach to significantly outperform the current state of the art. Expand
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges corresponding to allExpand
Path planning in the presence of vertical obstacles
An O(n/sup 2/) approximation algorithm that finds paths that are, at most, 8% longer than the shortest path for the case of k distinct heights when certain minimum separation requirements are satisfied is presented. Expand
A vision and strategy for the virtual physiological human in 2010 and beyond
The biomedical science, healthcare and information and communications technology challenges facing the project are considered and the VPH Institute is proposed as a means of sustaining the vision of VPH beyond the time frame of the NoE. Expand