Chan-Su Shin, et al.  Home/Search
Context Related
| tclab.kaist.ac.kr/~css...cocoon96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tclab.kaist.ac.kr/~cssin/pu...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Chan-Su Shin 1 and Sung Kwon Kim 2 and Kyung-Yong Chwa 1 1 Dept. of Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305-701, Korea, fcssin, kychwag@jupiter.kaist.ac.kr. 2 Dept. of Computer Science and Engineering, Chung-Ang University, Seoul 156-756, Korea, ksk@point.cse.cau.ac.kr. Abstract. In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as... (Update)
Similar documents based on text: More All
0.3: Orthogonal Straight Line Drawing of Trees - Sumi Choi Department (Correct)
0.3: Two-Center Problems for a Convex Polygon - Shin, Kim, Kwon, Chwa (1998) (Correct)
0.3: Exact and Heuristic Algorithms for 2-Layer Straightline.. - Jünger, Mutzel (1996) (Correct)
BibTeX entry: (Update)
C.-S. Shin, S. K. Kim, and K.-Y. Chwa. Area-efficient algorithms for upward straight-line tree drawings. In Proc. 2nd Int. Computing and Combinatorics Conf. (COCOON'96), Lect. Notes in Comput. Sci., vol. 1090, Springer-Verlag, pages 106--116, 1996. http://citeseer.ist.psu.edu/shin96areaefficient.html More
@inproceedings{ shin96areaefficient,
author = "Chan-Su Shin and Sung Kwon Kim and Kyung-Yong Chwa",
title = "Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract)",
booktitle = "Computing and Combinatorics",
pages = "106-116",
year = "1996",
url = "citeseer.ist.psu.edu/shin96areaefficient.html" }
Citations (may not include all citations):198 Algorithms for drawing graphs: an annotated bibliography (context) - Di Battista, Eades et al. - 1994
134 Computational Aspects of VLSI (context) - Ullman - 1984
92 The Design of Dynamic Data Structures (context) - Overmars - 1976
91 Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
68 Three-dimensional graph drawing (context) - Cohen, Eades et al. - 1994
42 AddisonWesley Publishing Company (context) - Graham, Knuth et al. - 1989
32 Optimal tree contraction in an EREW model (context) - Gazit, Miller et al. - 1988
28 Area efficient VLSI computation (context) - Leiserson - 1983
27 This article was processed using the L A T E X macro package.. (context) - Valiant, of et al. - 1981
27 A note on optimal area algorithms for upward drawings of bin.. (context) - Crescenzi, Di Battista et al. - 1992
16 Arrangements of Planar Graphs on the Planar Lattice (context) - Shiloach - 1976
16 Area-efficient upward tree drawings (context) - Garg, Goodrich et al. - 1993
15 Optimal-area upward drawings of AVL trees (context) - Crescenzi, Piperno - 1994
1 Simple algorithms for orthogonal upward drawings of binary a.. (context) - Kim - 1995
Documents on the same site (http://tclab.kaist.ac.kr/~cssin/publication/pub.html): More
Two-Center Problems for a Convex Polygon - Shin, Kim, Kwon, Chwa (1998) (Correct)
Two-Center Problems for a Convex Polygon - Shin, Kim, Kwon, Chwa (1998) (Correct)
The Widest k-dense Corridor and Cylinder Problems - Shin, Shin, Chwa (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC