Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Garg, Ashim"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Area-efficient drawings of outerplanar graphs
Ashim Garg
,
Adrian Rusu
Lecture Notes in Computer Science
2912
, 2004, pp. 129-134
A more practical algorithm for drawing binary trees in linear area with arbitrary aspect ratio
Ashim Garg
,
Adrian Rusu
Lecture Notes in Computer Science
2912
, 2004, pp. 159-165
Area-efficient order-preserving planar straight-line drawings of ordered trees
Ashim Garg
,
Adrian Rusu
Lecture Notes in Computer Science
2697
, 2003, pp. 475-486
Compact encodings of planar orthogonal drawings
Amrita Chanda
,
Ashim Garg
Lecture Notes in Computer Science
2528
, 2002, pp. 174-185
Straight-line drawings of binary trees with linear area and arbitrary aspect ratio
Ashim Garg
,
Adrian Rusu
Lecture Notes in Computer Science
2528
, 2002, pp. 320-331
On the computational complexity of upward and rectilinear planarity testing
Ashim Garg
,
Roberto Tamassia
SIAM Journal on Computing
31
(2), 2001, pp. 601-625
Almost bend-optimal planar orthogonal drawings of biconnected degree-3 planar graphs in quadratic time
Ashim Garg
,
Giuseppe Liotta
Lecture Notes in Computer Science
1731
, 1999, pp. 38-48
InteractiveGiotto: An algorithm for interactive orthogonal graph drawing
Stina S. Bridgeman
,
Jody Fanto
,
Ashim Garg
,
Roberto Tamassia
,
Luca Vismara
Lecture Notes in Computer Science
1353
, 1998, pp. 303-308
Compact encodings of planar graphs via canonical orderings and multiple parentheses
Richie Chih-Nan Chuang
,
Ashim Garg
,
Xin He
,
Ming-Yang Kao
,
Hsueh-I Lu
Lecture Notes in Computer Science
1443
, 1998, pp. 118-129
A graph drawing and translation service on the WWW
Stina Bridgeman
,
Ashim Garg
,
Roberto Tamassia
Lecture Notes in Computer Science
1190
, 1997, pp. 45-52
GIOTTO3D: A system for visualizing hierarchical structures in 3D
Ashim Garg
,
Roberto Tamassia
Lecture Notes in Computer Science
1190
, 1997, pp. 193-200
A new minimum cost flow algorithm with applications to graph drawing
Ashim Garg
,
Roberto Tamassia
Lecture Notes in Computer Science
1190
, 1997, pp. 201-216
Drawing directed acyclic graphs: An experimental study
G. di Battista
,
Ashim Garg
,
Giuseppe Liotta
,
Armando Parise
,
Roberto Tamassia
,
Emanuele Tassinari
,
Francesco Vargiu
,
Luca Vismara
Lecture Notes in Computer Science
1190
, 1997, pp. 76-91
Drawing with colors
Ashim Garg
,
Roberto Tamassia
,
Paola Vocca
Lecture Notes in Computer Science
1136
, 1996, pp. 12-26
Drawing graphs by example efficiently: Trees and planar acyclic digraphs
Isabel F. Cruz
,
Ashim Garg
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 404-415
On the computational complexity of upward and rectilinear planarity testing
Ashim Garg
,
Roberto Tamassia
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 286-297
On drawing angle graphs
Ashim Garg
Proceedings of the DIMACS International Workshop, GD'94. Graph Drawing (Princeton, New Jersey, USA, October 10-12, 1994)
LNCS 894
, 1995, pp. 84-95
Advances in graph drawing
Ashim Garg
,
Roberto Tamassia
Lecture Notes in Computer Science
778
, 1994, pp. 12-21
Planar drawings and angular resolution: Algorithms and bounds
Ashim Garg
,
Roberto Tamassia
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 12-23