# Ashim Garg

According to our database

Collaborative distances:

^{1}, Ashim Garg authored at least 28 papers between 1993 and 2007.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2007

Area-efficient planar straight-line drawings of outerplanar graphs.

Discret. Appl. Math., 2007

2004

Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio.

J. Graph Algorithms Appl., 2004

2003

Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees.

Int. J. Comput. Geometry Appl., 2003

Straight-Line Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio.

Proceedings of the Computational Science and Its Applications, 2003

A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio.

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Area-Efficient Drawings of Outerplanar Graphs.

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Compact Encodings of Planar Orthogonal Drawings.

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

On the Computational Complexity of Upward and Rectilinear Planarity Testing.

SIAM J. Comput., 2001

2000

Experimental studies on graph drawing algorithms.

Softw. Pract. Exp., 2000

Drawing Directed Acyclic Graphs: An Experimental Study.

Int. J. Comput. Geometry Appl., 2000

1999

A Graph Drawing and Translation Service on the World Wide Web.

Int. J. Comput. Geometry Appl., 1999

Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time.

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

New results on drawing angle graphs.

Comput. Geom., 1998

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses.

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

An Experimental Comparison of Four Graph Drawing Algorithms.

Comput. Geom., 1997

InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing.

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Planar upward tree drawings with optimal area.

Int. J. Comput. Geometry Appl., 1996

A New Minimum Cost Flow Algorithm with Applications to Graph Drawing.

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D.

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

A Graph Drawing and Translation Service on the WWW.

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Drawing with Colors (Extended Abstract).

Proceedings of the Algorithms, 1996

1995

An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

On the Compuational Complexity of Upward and Rectilinear Planarity Testing.

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

On Drawing Angle Graphs.

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs.

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract).

Proceedings of the Algorithms, 1994

Advances in Graph Drawing.

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

Area-Efficient Upward Tree Drawings.

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993