default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshim Garg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j10]Ashim Garg, Adrian Rusu:
Area-efficient planar straight-line drawings of outerplanar graphs. Discret. Appl. Math. 155(9): 1116-1140 (2007)- 2004
- [j9]Ashim Garg, Adrian Rusu:
Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio. J. Graph Algorithms Appl. 8(2): 135-160 (2004) - 2003
- [j8]Ashim Garg, Adrian Rusu:
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. Int. J. Comput. Geom. Appl. 13(6): 487-505 (2003) - [c21]Ashim Garg, Adrian Rusu:
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. COCOON 2003: 475-486 - [c20]Ashim Garg, Adrian Rusu:
Area-Efficient Drawings of Outerplanar Graphs. GD 2003: 129-134 - [c19]Ashim Garg, Adrian Rusu:
A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. GD 2003: 159-165 - [c18]Ashim Garg, Adrian Rusu:
Straight-Line Drawings of General Trees with Linear Area and Arbitrary Aspect Ratio. ICCSA (3) 2003: 876-885 - 2002
- [c17]Amrita Chanda, Ashim Garg:
Compact Encodings of Planar Orthogonal Drawings. GD 2002: 174-185 - [c16]Ashim Garg, Adrian Rusu:
Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio. GD 2002: 320-331 - 2001
- [j7]Ashim Garg, Roberto Tamassia:
On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM J. Comput. 31(2): 601-625 (2001) - [i1]Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu:
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. CoRR cs.DS/0102005 (2001) - 2000
- [j6]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geom. Appl. 10(6): 623-648 (2000) - [j5]Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu:
Experimental studies on graph drawing algorithms. Softw. Pract. Exp. 30(11): 1235-1284 (2000)
1990 – 1999
- 1999
- [j4]Stina S. Bridgeman, Ashim Garg, Roberto Tamassia:
A Graph Drawing and Translation Service on the World Wide Web. Int. J. Comput. Geom. Appl. 9(4/5): 419-446 (1999) - [c15]Ashim Garg, Giuseppe Liotta:
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. GD 1999: 38-48 - 1998
- [j3]Ashim Garg:
New results on drawing angle graphs. Comput. Geom. 9(1-2): 43-82 (1998) - [c14]Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu:
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. ICALP 1998: 118-129 - 1997
- [j2]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997) - [c13]Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, Luca Vismara:
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. GD 1997: 303-308 - 1996
- [j1]Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 6(3): 333-356 (1996) - [c12]Ashim Garg, Roberto Tamassia, Paola Vocca
:
Drawing with Colors (Extended Abstract). ESA 1996: 12-26 - [c11]Stina S. Bridgeman, Ashim Garg, Roberto Tamassia:
A Graph Drawing and Translation Service on the WWW. GD 1996: 45-52 - [c10]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. GD 1996: 76-91 - [c9]Ashim Garg, Roberto Tamassia:
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. GD 1996: 193-200 - [c8]Ashim Garg, Roberto Tamassia:
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. GD 1996: 201-216 - 1995
- [c7]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). SCG 1995: 306-315 - 1994
- [c6]Ashim Garg, Roberto Tamassia:
Advances in Graph Drawing. CIAC 1994: 12-21 - [c5]Ashim Garg, Roberto Tamassia:
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). ESA 1994: 12-23 - [c4]Ashim Garg:
On Drawing Angle Graphs. GD 1994: 84-95 - [c3]Ashim Garg, Roberto Tamassia:
On the Compuational Complexity of Upward and Rectilinear Planarity Testing. GD 1994: 286-297 - [c2]Isabel F. Cruz, Ashim Garg:
Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs. GD 1994: 404-415 - 1993
- [c1]Ashim Garg, Michael T. Goodrich, Roberto Tamassia:
Area-Efficient Upward Tree Drawings. SCG 1993: 359-368
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
