%%% -*-BibTeX-*-
%%% /u/sy/beebe/tex/bib/trees.bib, Mon Feb  4 22:28:09 1991
%%% Edit by Nelson H. F. Beebe <beebe at magna.math.utah.edu>
%%%
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "3.25",
%%%     date            = "18 March 2014",
%%%     time            = "06:39:47 MST",
%%%     filename        = "trees.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "35260 4151 16140 165625",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "trees, bibliography",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This bibliography collects references to
%%%                        papers on the drawing of trees and directed
%%%                        and undirected graphs with TeX and other
%%%                        typesetting systems.
%%%
%%%                        At version 3.25, the year coverage looked
%%%                        like this:
%%%
%%%                             1971 (   1)    1983 (   1)    1995 (  45)
%%%                             1972 (   0)    1984 (   1)    1996 (  19)
%%%                             1973 (   0)    1985 (   3)    1997 (  41)
%%%                             1974 (   0)    1986 (   1)    1998 (   5)
%%%                             1975 (   1)    1987 (   3)    1999 (   1)
%%%                             1976 (   0)    1988 (   5)    2000 (   3)
%%%                             1977 (   1)    1989 (   4)    2001 (   0)
%%%                             1978 (   1)    1990 (   6)    2002 (   6)
%%%                             1979 (   1)    1991 (  10)    2003 (   2)
%%%                             1980 (   3)    1992 (   2)    2004 (   1)
%%%                             1981 (   4)    1993 (   4)    2005 (   0)
%%%                             1982 (   2)    1994 (  10)    2006 (   1)
%%%                             19xx (   1)
%%%
%%%                             Article:        156
%%%                             InProceedings:    6
%%%                             MastersThesis:    1
%%%                             Misc:             1
%%%                             Proceedings:      9
%%%                             TechReport:      17
%%%
%%%                             Total entries:  190
%%%
%%%                        This bibliography has been collected from
%%%                        bibliographies in the author's personal
%%%                        files, from the OCLC Contents1st database,
%%%                        from the IEEE INSPEC database, from the
%%%                        computer graphics bibliography archive at
%%%                        ftp.siggraph.org, and from the computer
%%%                        science bibliography collection on
%%%                        ftp.ira.uka.de in /pub/bibliography to
%%%                        which many people of have contributed.  The
%%%                        snapshot of this collection was taken on
%%%                        5-May-1994, and it consists of 441 BibTeX
%%%                        files, 2,672,675 lines, 205,289 entries,
%%%                        and 6,375 <at>String{} abbreviations,
%%%                        occupying 94.8MB of disk space.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.  Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen as
%%%                        name:year:abbrev, where name is the family
%%%                        name of the first author or editor, year is a
%%%                        4-digit number, and abbrev is a 3-letter
%%%                        condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted
%%%                        first by ascending year, and within each
%%%                        year, alphabetically by author or editor,
%%%                        and then, if necessary, by the 3-letter
%%%                        abbreviation at the end of the BibTeX
%%%                        citation tag, using the bibsort -byyear
%%%                        utility.  Year order has been chosen to
%%%                        make it easier to identify the most recent
%%%                        work.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
"\ifx \TUB \undefined \def \TUB {TUGboat} \fi" #
"\ifx \XYMTeX \undefined
    \def\XYMTeX{%
    X\kern-.25em\smash{\raise.50ex\hbox{\char'7}}\kern-.25em{M}\kern-.1em\TeX}
\fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{inst-UIUC-CSRD          = "University of Illinois at Urbana-Champaign,
                                  Center for Supercomputing Research and
                                  Development"}

@String{inst-UIUC-CSRD:adr      = "Urbana, IL 61801, USA"}

@String{j-ACTA-INFO             = "Acta Informatica"}

@String{j-ALGORITHMICA          = "Algorithmica"}

@String{j-BIOINFORMATICS        = "Bioinformatics"}

@String{j-COMP-APPLIC-BIOSCI    = "Computer Applications in the Biosciences:
                                  CABIOS"}

@String{j-COMP-APPLIC-BIOSCI    = "Computer Applications in the Biosciences:
                                  CABIOS"}

@String{j-COMP-GEOM             = "Computational Geometry. Theory and
                                  Applications"}

@String{j-COMP-GRAPHICS         = "Computer Graphics"}

@String{j-COMP-LIB              = "Computers in Libraries"}

@String{j-COMP-MATH-APPL        = "Computers and Mathematics with Applications"}

@String{j-COMP-PHYS-COMM        = "Computer Physics Communications"}

@String{j-COMP-SURV             = "ACM Computing Surveys"}

@String{j-COMPUT-CHEM           = "Computers and Chemistry"}

@String{j-COMPUTER              = "Computer"}

@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}

@String{j-CONG-NUM              = "Congressus Numerantium"}

@String{j-CPC                   = "Computer Physics Communications"}

@String{j-CUJ                   = "C Users Journal"}

@String{j-ELECTRONIC-DESIGN     = "Electronic Design"}

@String{j-ELECTRONIC-LIBRARY    = "Electronic Library"}

@String{j-ENG-DESIGN-GRAPHICS-J = "Engineering Design Graphics Journal"}

@String{j-EPODD                 = "Electronic Publishing\emdash Origination,
                                  Dissemination, and Design"}

@String{j-GUTENBERG             = "Cahiers GUTenberg"}

@String{j-IEEE-MICRO            = "IEEE Micro"}

@String{j-IEEE-SOFTWARE         = "IEEE Software"}

@String{j-IEEE-TRANS-SOFTW-ENG  = "IEEE Transactions on Software Engineering"}

@String{j-IEEE-TRANS-SYST-MAN-CYBERN = "IEEE Transactions on Systems, Man, and
                                  Cybernetics"}

@String{j-IEEE-TSE              = "IEEE Transactions on Software Engineering"}

@String{j-IJSAHPC               = "International Journal of Supercomputer
                                  Applications and High Performance Computing"}

@String{j-INFO-PROC-LETT        = "Information Processing Letters"}

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

@String{j-MICROSOFT-SYS-J       = "Microsoft Systems Journal"}

@String{j-NEW-TECH-WORK-EMPLOYMENT = "New Technology, Work, and Employment"}

@String{j-PARALLEL-COMPUTING    = "Parallel Computing"}

@String{j-POSTSCRIPT-LANG-J     = "The {\POSTSCRIPT} Language Journal"}

@String{j-PROC-SPIE             = "Proceedings of the SPIE --- The
                                  International Society for Optical
                                  Engineering"}

@String{j-PUBLISHING-PROD-EXEC  = "Publishing and production executive"}

@String{j-SCI-AMER              = "Scientific American"}

@String{j-SIAM-J-COMPUT         = "SIAM Journal on Computing"}

@String{j-SIAM-J-DISCR-MATH     = "SIAM Journal on Discrete Mathematics"}

@String{j-SIAM-J-SCI-STAT-COMP  = "SIAM Journal on Scientific and Statistical
                                  Computing"}

@String{j-SIAM-REVIEW           = "SIAM Review"}

@String{j-SIGADA-LETTERS        = "ACM SIGADA Ada Letters"}

@String{j-SIGPLAN               = "ACM SIG{\-}PLAN Notices"}

@String{j-SMITHSONIAN           = "Smithsonian"}

@String{j-SPE                   = "Soft\-ware\emdash Prac\-tice and
                                  Experience"}

@String{j-THEOR-COMP-SCI        = "Theoretical Computer Science"}

@String{j-TOG                   = "ACM Transactions on Graphics"}

@String{j-TOPLAS                = "ACM Transactions on Programming Languages
                                  and Systems"}

@String{j-TUGBOAT               = "{\TUB}"}

@String{j-UNIX-WORLD            = "UNIX/world"}

@String{j-X-J                   = "{The {X} Journal: Computing Technology with
                                  the {X Window System}}"}

@String{j-X-RESOURCE            = "{The X Resource}"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-ADOBE               = "Adobe Systems Incorporated"}
@String{pub-ADOBE:adr           = "1585 Charleston Road, P.~O. Box 7900,
                                  Mountain View, CA 94039-7900, USA, Tel:
                                  (415) 961-4400"}

@String{pub-AGARD               = "AGARD"}
@String{pub-AGARD:adr           = "Neuilly sur Seine, France"}

@String{pub-ASCII               = "ASCII Corporation"}
@String{pub-ASCII:adr           = "Tokyo, Japan"}

@String{pub-CIPS                = "Canadian Information Processing Society"}
@String{pub-CIPS:adr            = "243 College St, 5th Floor, Toronto, Ontario
                                  M5T~2Y1, Canada"}

@String{pub-ELLIS-HORWOOD       = "Ellis Horwood"}
@String{pub-ELLIS-HORWOOD:adr   = "New York, NY, USA"}

@String{pub-KLUWER              = "Kluwer Academic Publishers Group"}
@String{pub-KLUWER:adr          = "Norwell, MA, USA, and Dordrecht, The
                                  Netherlands"}

@String{pub-LEARNKEY            = "LearnKey"}
@String{pub-LEARNKEY:adr        = "St. George, UT, USA"}

@String{pub-MH                  = "Mc{\-}Graw-Hill"}
@String{pub-MH:adr              = "New York, NY, USA"}

@String{pub-SV                  = "Springer-Verlag Inc."}
@String{pub-SV:adr              = "New York, NY, USA"}

@String{pub-WIHM                = "Wellcome Institute for the History of
                                  Medicine"}
@String{pub-WIHM:adr            = "London, UK"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Bibliography entries:

@Article{Hope:1971:PGD,
  author =       "Alexander K. Hope",
  title =        "A Planar Graph Drawing Program",
  journal =      j-SPE,
  volume =       "1",
  number =       "1",
  pages =        "83--91",
  month =        jan # "\slash " # mar,
  year =         "1971",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/spe.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{Lewis:1975:TIS,
  author =       "J. W. Lewis",
  title =        "{TREE}: An interactive system for editing tree
                 structures",
  journal =      j-COMPUTERS-AND-GRAPHICS,
  volume =       "1",
  number =       "1",
  pages =        "65--68",
  month =        may,
  year =         "1975",
  CODEN =        "COGRD2",
  ISSN =         "0097-8493",
  ISSN-L =       "0097-8493",
  bibsource =    "Graphics/imager/imager.75.bib;
                 Graphics/siggraph/75.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "Computers and Graphics",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00978493",
}

@Article{Warfield:1977:CTH,
  author =       "John Warfield",
  title =        "Crossing Theory and Hierarchy Mapping",
  journal =      j-IEEE-TRANS-SYST-MAN-CYBERN,
  volume =       "SMC-7",
  number =       "7",
  pages =        "505--523",
  month =        jul,
  year =         "1977",
  CODEN =        "ISYMAW",
  ISSN =         "0018-9472, 1083-4427",
  ISSN-L =       "1083-4427",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Systems, Man, and Cybernetics",
}

@TechReport{Sweet:1978:EEP,
  author =       "R. E. Sweet",
  title =        "Empirical estimates of program entropy",
  number =       "STAN-CS-78-698",
  institution =  "Department of Computer Science, Stanford University",
  address =      "Stanford, CA, USA",
  month =        nov,
  year =         "1978",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Also issued as Report CSL-78-3, Xerox PARC, Palo Alto,
                 CA, September 1978.",
}

@Article{Wetherell:1979:TDT,
  author =       "C. S. Wetherell and A. Shannon",
  title =        "Tidy Drawing of Trees",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-5",
  number =       "5",
  pages =        "514--520",
  month =        sep,
  year =         "1979",
  CODEN =        "IESEDJ",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Carpano:1980:ADH,
  author =       "M. Carpano",
  title =        "Automatic display of hierarchized graphs for computer
                 aided decision analysis",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-12",
  number =       "4",
  pages =        "538--546",
  month =        apr,
  year =         "1980",
  CODEN =        "IESEDJ",
  DOI =          "http://dx.doi.org/10.1109/TSE.1979.234212",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Vaucher:1980:PPT,
  author =       "Jean G. Vaucher",
  title =        "Pretty-Printing of Trees",
  journal =      j-SPE,
  volume =       "10",
  number =       "7",
  pages =        "553--561",
  month =        jul,
  year =         "1980",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  xxnote =       "Check vol/number/pages??",
}

@Article{Walker:1980:PNG,
  author =       "John Q. {Walker II}",
  title =        "Positioning Nodes For General Trees",
  journal =      j-SPE,
  volume =       "10",
  number =       "7",
  pages =        "553--561",
  month =        jul,
  year =         "1980",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{Fraser:1981:SDE,
  author =       "C. W. Fraser",
  title =        "Syntax-directed editing of general data structures",
  journal =      j-SIGPLAN,
  volume =       "16",
  number =       "6",
  pages =        "17--21",
  month =        jun,
  year =         "1981",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160
                 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sat Apr 25 11:46:37 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  classification = "C6120 (File organisation); C6130 (Data handling
                 techniques); C6150J (Operating systems)",
  conflocation = "Portland, OR, USA; 8-10 June 1981",
  conftitle =    "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text
                 Manipulation",
  corpsource =   "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
                 USA",
  fjournal =     "ACM SIGPLAN Notices",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J706",
  keywords =     "binary tree editor; connecting node; data structures;
                 directed editing; documents formatting; formal language
                 description; line drawings; supervisory and executive
                 programs; syntactically correct program; syntax
                 directed editing; text editing",
  treatment =    "A Application",
}

@Article{Reingold:1981:TDT,
  author =       "E. M. Reingold and J. S. Tilford",
  title =        "Tidier Drawing of Trees",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "SE-7",
  number =       "2",
  pages =        "223--228",
  month =        mar,
  year =         "1981",
  CODEN =        "IESEDJ",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Sat Aug 27 11:19:27 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}

@Article{Sugiyama:1981:MVU,
  author =       "K. Sugiyama and S. Tagawa and M. Toda",
  title =        "Methods for Visual Understanding of Hierarchical
                 System Structures",
  journal =      j-IEEE-TRANS-SYST-MAN-CYBERN,
  volume =       "SMC-11",
  number =       "2",
  pages =        "109--125",
  month =        feb,
  year =         "1981",
  CODEN =        "ISYMAW",
  DOI =          "http://dx.doi.org/10.1109/TSE.1981.234519",
  ISSN =         "0018-9472, 1083-4427",
  ISSN-L =       "1083-4427",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Systems, Man, and Cybernetics",
}

@MastersThesis{Tilford:1981:TDA,
  author =       "J. S. Tilford",
  title =        "Tree drawing algorithms",
  school =       "Department of Computer Science, University of
                 Illinois",
  address =      "Urbana, IL, USA",
  month =        apr,
  year =         "1981",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Issued as report UIUCDCSR-81-1055, and as document
                 UILU-ENG-81-1711 from College of Engineering Document
                 Center at the University of Illinois.",
}

@Article{Lang:1982:APD,
  author =       "T. Lang",
  title =        "Another Program for Drawing Diagrams",
  journal =      j-SPE,
  volume =       "12",
  number =       "5",
  pages =        "397--404",
  month =        may,
  year =         "1982",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/spe.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  subject =      "I.3.4 Computing Methodologies, COMPUTER GRAPHICS,
                 Graphics Utilities, Software support",
}

@Article{Mallgren:1982:FSG,
  author =       "William R. Mallgren",
  title =        "Formal Specification of Graphic Data Types",
  journal =      j-TOPLAS,
  volume =       "4",
  number =       "4",
  pages =        "687--710",
  month =        oct,
  year =         "1982",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibsource =    "Compiler/bevan.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  abstract =     "Formal specification techniques and data abstractions
                 have seen little application to computer graphics. Many
                 of the objects and operations unique to graphics
                 programs can be handled conveniently by defining
                 special graphic data types. Not only do graphic data
                 types provide an attractive way to work with pictures,
                 but they also allow specification techniques for data
                 abstractions to be employed. Algebraic axioms, because
                 of their definitional nature, are especially well
                 suited to specifying the diversity of types useful in
                 graphics applications. In this paper, definitions are
                 given for some important concepts that appear in
                 graphics programs. Based on these definitions, some
                 illustrative graphic data types, called point, region,
                 geometric function, graphic transformation, and
                 tree-structured picture, are defined and specified
                 algebraically. A simple graphics language for line
                 drawings is created by embedding these new data types
                 in the language PASCAL. Using the specifications, an
                 outline of a correctness proof for a small programming
                 example is presented.",
  acknowledgement = ack-pb,
  checked =      "19940302",
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J783",
  keywords =     "abstract data types; algebraic approaches to
                 semantics; correctness proofs; graphic data type;
                 languages; specification techniques; verification",
  sjb =          "readable",
  source =       "Dept. Library",
}

@Article{Supowit:1983:CDT,
  author =       "Kenneth J. Supowit and Edward M. Reingold",
  title =        "The Complexity of Drawing Trees Nicely",
  journal =      j-ACTA-INFO,
  volume =       "18",
  number =       "4",
  pages =        "377--392",
  month =        jan,
  year =         "1983",
  CODEN =        "AINFA2",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  MRclass =      "68C25 (05C05 68E10)",
  MRnumber =     "84c:68033",
  bibdate =      "Sat Oct 9 09:56:22 MDT 1999",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/graphics.1.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Typesetting/trees.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 MathSciNet database",
  note =         "See corrigendum \cite{Akkerman:2004:CDT}.",
  abstract =     "We investigate the complexity of producing
                 aesthetically pleasing drawings of binary trees,
                 drawings that are as narrow as possible. The notion of
                 what is aesthetically pleasing is embodied in several
                 constraints on the placement of nodes, relative to
                 other nodes. Among the results we give are: (1) There
                 is no obvious `principle of optimality' that can be
                 applied, since globally narrow, aesthetic placements of
                 trees may require wider than necessary subtrees. (2) A
                 previously suggested heuristic can produce drawings on
                 n-node trees that are theta(n) times as wide as
                 necessary. (3) The problem can be reduced in polynomial
                 time to linear programming; hence, if the coordinates
                 assigned to the nodes are continuous variables, then
                 the problem can be solved in polynomial time. (4) If
                 the placement is restricted to the integral lattice
                 then the problem is NP-hard, as is its approximation to
                 within a factor of about 4 per cent.",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://www.springerlink.com/content/0001-5903",
  keywords =     "display; draw; drawing; layout; plot; plotting; tree;
                 trees",
  owner =        "robyn",
}

@Article{Eades:1984:HGD,
  author =       "Peter Eades",
  title =        "A Heuristic for Graph Drawing",
  journal =      j-CONG-NUM,
  volume =       "42",
  number =       "??",
  pages =        "149--160",
  month =        "????",
  year =         "1984",
  ISSN =         "0384-9864",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Congressus Numerantium",
}

@TechReport{Anonymous:1985:M,
  author =       "Anonymous",
  title =        "Magic",
  type =         "Technical Report",
  institution =  "University of California, Berkeley",
  address =      "Berkeley, CA",
  year =         "1985",
  bibdate =      "Sat May 23 08:37:33 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Discusses a tool for drawing VLSI layouts.",
  acknowledgement = ack-nhfb,
}

@Article{Eppstein:1985:TT,
  author =       "David Eppstein",
  title =        "{{Trees in \TeX}}",
  journal =      j-TUGBOAT,
  volume =       "6",
  number =       "1",
  pages =        "31--35",
  month =        Mar,
  year =         "1985",
  ISSN =         "0896-3207",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  abstract =     "Drawing simple horizontal trees in plain {\TeX} or
                 {\LaTeX}.",
  acknowledgement = ack-spqr,
  fjournal =     "TUGboat",
}

@Article{Guibas:1985:PMG,
  author =       "Leonidas Guibas and Jorge Stolfi",
  title =        "Primitives for the manipulation of general
                 subdivisions and computation of {Voronoi} diagrams",
  journal =      j-TOG,
  volume =       "4",
  number =       "2",
  pages =        "74--123",
  month =        apr,
  year =         "1985",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Thu Aug 25 23:30:45 1994",
  bibsource =    "Graphics/imager/imager.85.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "ACM Transactions on Graphics",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J778",
  keywords =     "closest point; computational topology; convex hull;
                 data structuring; Delaunay diagrams; design of
                 algorithms; Euler operators; geometric primitives;
                 nearest neighbors; planar graphs; point location;
                 representation of polyhedra; triangulations",
}

@Article{Burkhard:1986:DAS,
  author =       "B. Burkhard and M. Lee",
  title =        "Drawing {Ada} structure charts",
  journal =      j-SIGADA-LETTERS,
  volume =       "6",
  number =       "3",
  pages =        "71--80",
  month =        jun,
  year =         "1986",
  CODEN =        "AALEE5",
  ISSN =         "0736-721X",
  ISSN-L =       "0736-721X",
  bibdate =      "Sat Aug 13 17:15:06 MDT 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/sigada.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGADA Ada Letters",
  keywords =     "documentation; languages",
  subject =      "D.3.2 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Ada \\ D.2.2 Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Programmer
                 workbench",
}

@InProceedings{Newbery:1987:KBE,
  author =       "Frances Newbery and Walter Tichy",
  title =        "Knowledge Based Editors for Directed Graphs",
  crossref =     "Nichols:1987:EES",
  pages =        "101--109",
  year =         "1987",
  bibdate =      "Sat May 23 08:29:37 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
}

@Article{Rowe:1987:BDG,
  author =       "Lawrence A. Rowe and Michael Davis and Eli Messinger
                 and Carl Mayer and Charles Spirakis and Allen Tuan",
  title =        "A Browser for Directed Graphs",
  journal =      j-SPE,
  volume =       "17",
  number =       "1",
  pages =        "61--76",
  month =        jan,
  year =         "1987",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{DiBattista:1988:APR,
  author =       "Giuseppe {Di Battista} and Roberto Tamassia",
  title =        "Algorithms for plane representations of acyclic
                 digraphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "61",
  number =       "2-3",
  pages =        "175--198",
  month =        nov,
  year =         "1988",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Rome 'La Sapienza'",
  affiliationaddress = "Rome, Italy",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  journalabr =   "Theor Comput Sci",
  keywords =     "Acyclic Digraphs; acyclic digraphs; Algorithms;
                 Computer Programming; Digraphs of Lattices; directed
                 graphs; family trees; Graph Algorithms; Grid Drawings;
                 grid drawings; Hasse diagrams; hierarchical structures;
                 ISA hierarchies; knowledge representation diagrams;
                 Mathematical Techniques--Graph Theory; organization
                 charts; PERT networks; plane representations; straight
                 drawings; Straight Drawings; subroutine-call graphs;
                 time complexity; trees (mathematics); Visibility
                 Representations; visibility representations",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gansner:1988:DPD,
  author =       "E. R. Gansner and S. C. North and K. P. Vo",
  title =        "{DAG}: {A} program that draws directed graphs",
  journal =      j-SPE,
  volume =       "18",
  number =       "11",
  pages =        "1047--1062",
  month =        nov,
  year =         "1988",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@TechReport{Radack:1988:TDM,
  author =       "G. M. Radack",
  title =        "Tidy Drawing of {M}-ary Trees",
  number =       "CES-88-24",
  institution =  "Department of Computer Engineering and Science, Case
                 Western Reserve University",
  address =      "Cleveland, OH, USA",
  month =        nov,
  year =         "1988",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
}

@Article{Tamassia:1988:AGD,
  author =       "R. Tamassia and G. {di Battista} and C. Batini",
  title =        "Automatic graph drawing and readability of diagrams",
  journal =      j-IEEE-TRANS-SYST-MAN-CYBERN,
  volume =       "18",
  number =       "1",
  pages =        "61--79",
  month =        jan # "\slash " # feb,
  year =         "1988",
  CODEN =        "ISYMAW",
  DOI =          "http://dx.doi.org/10.1109/21.87055",
  ISSN =         "0018-9472, 1083-4427",
  ISSN-L =       "1083-4427",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Systems, Man, and Cybernetics",
}

@Article{Veenstra:1988:LDO,
  author =       "Jack Veenstra and Narendra Ahuja",
  title =        "Line drawings of octree-represented objects",
  journal =      j-TOG,
  volume =       "7",
  number =       "1",
  pages =        "61--75",
  month =        jan,
  year =         "1988",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Fri Aug 26 00:11:13 1994",
  bibsource =    "Graphics/imager/imager.88.bib;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/42189.html",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J778",
  keywords =     "algorithms; hidden line removal; three-dimensional
                 representation",
  review =       "ACM CR 8810-0807",
  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
                 GRAPHICS, Picture/Image Generation.",
}

@Article{Brueggeman-Klein:1989:DTN,
  author =       "Anne Br{\"u}ggeman-Klein and Derrick Wood",
  title =        "Drawing Trees Nicely with {\TeX}",
  journal =      j-EPODD,
  volume =       "2",
  number =       "2",
  pages =        "101--115",
  month =        jul,
  year =         "1989",
  CODEN =        "EPODEU",
  ISSN =         "0894-3982",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "Electronic Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion,
                 Dissemination, and Design",
}

@Article{Kamada:1989:ADG,
  author =       "Tomihisa Kamada and Satoru Kawai",
  title =        "An algorithm for drawing general undirected graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "31",
  number =       "1",
  pages =        "7--15",
  month =        apr,
  year =         "1989",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Wed Jan 29 09:23:05 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  affiliationaddress = "Tokyo, Jpn",
  classification = "723; 921",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Algorithms; algorithms; Computer Programming; design;
                 Drawing Algorithms; Mathematical Techniques--Graph
                 Theory; Spring Model; theory; Undirected Graphs;
                 Weighted Graphs",
  subject =      "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Graph algorithms \\ E.1 Data, DATA
                 STRUCTURES \\ G.2.2 Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems",
}

@InProceedings{Newbery:1989:ECM,
  author =       "Frances J. Newbery",
  title =        "Edge Concentration: {A} Method for Clustering Directed
                 Graphs",
  crossref =     "ACM:1989:PIW",
  pages =        "78--85",
  year =         "1989",
  bibdate =      "Sat May 23 08:20:56 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Also published as ACM SIGSOFT Software Engineering
                 Notes, vol. 17, no. 7, November 1989.",
  acknowledgement = ack-nhfb,
}

@InProceedings{Brueggeman-Klein:1990:DTN,
  author =       "Anne Br{\"u}ggeman-Klein and Derrick Wood",
  title =        "Drawing Trees Nicely with {\TeX}",
  crossref =     "Clark:1990:TAP",
  pages =        "185--206",
  year =         "1990",
  bibdate =      "Sat May 23 11:36:20 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
}

@InProceedings{Karrer:1990:REO,
  author =       "A. Karrer and W. Scacchi",
  title =        "Requirements for an extensible object-oriented
                 tree\slash graph editor",
  crossref =     "ACM:1990:UTA",
  pages =        "84--91",
  year =         "1990",
  bibdate =      "Thu Dec 14 18:48:37 MST 1995",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  abstract =     "Software engineers use graphs to represent many types
                 of information. This paper describes a tool which is
                 used to rapidly extend base classes to create graph
                 editors as a user-interface to these information
                 domains. This paper also presents requirements for
                 extensible graph editors. These requirements establish
                 a basis of comparison for extensible graph editors. An
                 object-oriented programming language and an
                 object-oriented user interface toolkit provide a great
                 degree of flexibility for creating graph editors. Users
                 create instances of a graph editor by specifying global
                 and local functionality. Global functionality takes the
                 form of graph layout algorithms, user interaction, and
                 interaction with other tools. Local functionality is
                 the description of the meaning and pictorial
                 representation of nodes and arcs. As such, this paper
                 describes a number of example graph editors that have
                 been developed with these mechanisms which satisfy the
                 requirements. (12 Refs.)",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Univ. of Southern California,
                 Los Angeles, CA, USA",
  classification = "C6110J (Object-oriented programming); C6115
                 (Programming support); C6180G (Graphical user
                 interfaces)",
  keywords =     "Extensible object-oriented tree/graph editor; Global
                 functionality; Graph layout algorithms; Information
                 domains; Local functionality; Object-oriented
                 programming language; Object-oriented user interface
                 toolkit; Pictorial representation; Software tool; User
                 interaction; User-interface",
  thesaurus =    "Graphical user interfaces; Object-oriented
                 programming; Software tools; User interface management
                 systems",
}

@Article{Levine:1990:LGR,
  author =       "Michael J. S. Levine",
  title =        "A {\LaTeX} Graphics Routine for drawing {Feynman}
                 Diagrams",
  journal =      j-CPC,
  volume =       "58",
  number =       "1 and 2",
  pages =        "181--198",
  month =        feb # "\slash " # mar,
  year =         "1990",
  bibdate =      "Fri Feb 9 18:09:31 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Available in the CPC library, and from
                 \path|listral@ib.rl.ac.uk| with an e-mail request {\tt
                 GET CPC INTRO CPCINDEX}.",
}

@Article{Moen:1990:DDT,
  author =       "Sven Moen",
  title =        "Drawing Dynamic Trees",
  journal =      j-IEEE-SOFTWARE,
  volume =       "7",
  number =       "4",
  pages =        "21--28",
  day =          "1",
  month =        jul,
  year =         "1990",
  CODEN =        "IESOEG",
  DOI =          "http://dx.doi.org/10.1109/52.56447",
  ISSN =         "0740-7459 (print), 0740-7459 (electronic)",
  ISSN-L =       "0740-7459",
  bibdate =      "Sat Jan 25 07:35:26 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib; UnCover
                 library database",
  abstract =     "This simple yet flexible algorithm lets you draw
                 compact trees for user-interface code and update them
                 efficiently.",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ, Providence, RI, USA",
  classification = "723; 921",
  fjournal =     "IEEE Software",
  journal-URL =  "http://www.computer.org/portal/web/csdl/magazines/software",
  journalabr =   "IEEE Software",
  keywords =     "Computer Interfaces; Computer Programming ---
                 Algorithms; Data Processing --- Data Structures;
                 Mathematical Techniques --- Trees; Tree-Drawing
                 Algorithms",
}

@Article{Fruchterman:1991:GDF,
  author =       "Thomas M. J. Fruchterman and Edward M. Reingold",
  title =        "Graph Drawing by Force-directed Placement",
  journal =      j-SPE,
  volume =       "21",
  number =       "11",
  pages =        "1129--1164",
  month =        nov,
  year =         "1991",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 23 07:58:53 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/spe.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@TechReport{Koutsofios:1991:DGD,
  author =       "Eleftherios Koutsofios and Stephen North",
  title =        "Drawing graphs with {\em dot}",
  type =         "Technical Report",
  number =       "910904-59113-08TM",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  month =        sep,
  year =         "1991",
  bibdate =      "Sat May 23 08:16:27 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Koutsofios:1991:LTV,
  author =       "Eleftherios Koutsofios and David Dobkin",
  title =        "Lefty: {A} two-view editor for technical pictures",
  crossref =     "MacKay:1991:GIC",
  pages =        "67--76",
  year =         "1991",
  bibdate =      "Sat May 23 08:27:21 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Krishnamurthy:1991:EAM,
  author =       "Balachander Krishnamurthy and David S. Rosenblum",
  editor =       "K. Gorling and C. Sattler",
  booktitle =    "Proceedings of the International Workshop on Computer
                 Supported Cooperative Work",
  title =        "An event-action model of computer-supported
                 cooperative work: Design and implementation",
  publisher =    "????",
  address =      "????",
  pages =        "132--145",
  year =         "1991",
  ISBN =         "",
  ISBN-13 =      "",
  LCCN =         "",
  bibdate =      "Sat May 23 08:28:20 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "IFIP TC 6/WG C.5.",
  acknowledgement = ack-nhfb,
}

@Article{Leguy:1991:DTS,
  author =       "Bernard Leguy",
  title =        "Drawing tree structures with {GWEZ}",
  journal =      j-GUTENBERG,
  volume =       "10--11",
  pages =        "135--146",
  month =        sep,
  year =         "1991",
  ISSN =         "1140-9304",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "Cahiers GUTenberg",
}

@Article{Maclenan:1991:ADC,
  author =       "M. P. Maclenan and G. M. Burns",
  title =        "{An approach to drawing circuit diagrams for text
                 books}",
  journal =      j-TUGBOAT,
  volume =       "12",
  number =       "1",
  pages =        "66--69",
  month =        Mar,
  year =         "1991",
  ISSN =         "0896-3207",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.math.utah.edu/pub/tex/bib/tugboat.bib",
  fjournal =     "TUGboat",
}

@Article{Swonk:1991:LTD,
  author =       "Glenn L. Swonk",
  title =        "{\LaTeX} tree drawer",
  journal =      j-TUGBOAT,
  volume =       "12",
  number =       "2",
  pages =        "286--289",
  month =        Jun,
  year =         "1991",
  ISSN =         "0896-3207",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "TUGboat",
}

@Article{Tamassia:1991:LBP,
  author =       "Roberto Tamassia and Ioannis G. Tollis and Jeffrey
                 Scott Vitter",
  title =        "Lower bounds for planar orthogonal drawings of
                 graphs",
  journal =      j-INFO-PROC-LETT,
  volume =       "39",
  number =       "1",
  pages =        "35--40",
  month =        jul,
  year =         "1991",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68Q35 (68Q25 68R10)",
  MRnumber =     "92i:68067",
  bibdate =      "Sat Apr 11 12:24:18 MDT 1998",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Brown Univ",
  affiliationaddress = "Providence, RI, USA",
  classification = "713; 716; 717; 718; 723; 921",
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  journalabr =   "Inf Process Lett",
  keywords =     "Computer Programming --- Algorithms; Graph Algorithms;
                 Graph Theory; Integrated Circuits, VLSI --- Computer
                 Aided Design; Mathematical Techniques; Microwave
                 Communication; Optical Communication; Orthogonal
                 Drawings; Planar Embedding; Telecommunication Systems;
                 VLSI Layout",
}

@Article{Walker:1991:PNG,
  author =       "John Q. {Walker II}",
  title =        "Positioning Nodes For General Trees",
  journal =      j-CUJ,
  volume =       "9",
  number =       "2",
  pages =        "47--62",
  month =        feb,
  year =         "1991",
  ISSN =         "0898-9788",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  fjournal =     "C Users Journal",
}

@TechReport{North:1992:NUG,
  author =       "Stephen C. North",
  title =        "{{\sc NEATO}} User's Guide",
  type =         "Technical Report",
  number =       "59113-921014-14TM",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "14",
  month =        oct,
  year =         "1992",
  bibdate =      "Sat May 23 08:02:17 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "This report, and the program, is included in the {\tt
                 graphviz} package, available for non-commercial use at
                 \path=http://www.research.att.com/sw/tools/graphviz/=.",
  acknowledgement = ack-nhfb,
}

@Article{Seyfarth:1992:DDP,
  author =       "Ray Seyfarth",
  title =        "{{Diag: a drawing preprocessor for {\LaTeX}}}",
  journal =      j-TUGBOAT,
  volume =       "13",
  number =       "4",
  pages =        "478--485",
  month =        Dec,
  year =         "1992",
  ISSN =         "0896-3207",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.math.utah.edu/pub/tex/bib/tugboat.bib",
  fjournal =     "TUGboat",
}

@Article{DiBattista:1993:SOR,
  author =       "G. {Di Battista} and G. Liotta and F. Vargiu",
  title =        "Spirality of Orthogonal Representations and Optimal
                 Drawings of Series-Parallel Graphs and {3-Planar}
                 Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "709",
  pages =        "151--??",
  year =         "1993",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:49:00 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Formann:1993:DGP,
  author =       "M. Formann and T. Hagerup and J. Haralambides and M.
                 Kaufmann and F. T. Leighton and A. Symvonis and E.
                 Welzl and G. Woeginger",
  title =        "Drawing Graphs in the Plane with High Resolution",
  journal =      j-SIAM-J-COMPUT,
  volume =       "22",
  number =       "5",
  pages =        "1035--1052",
  month =        oct,
  year =         "1993",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "05C85 (68R10)",
  MRnumber =     "94i:05089",
  MRreviewer =   "O. D'Antona",
  bibdate =      "Sat Jan 18 18:03:50 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Gansner:1993:TDD,
  author =       "Emden R. Gansner and Eleftherios Koutsofios and
                 Stephen C. North and Kiem-Phong Vo",
  title =        "A Technique for Drawing Directed Graphs",
  journal =      j-IEEE-TRANS-SOFTW-ENG,
  volume =       "19",
  number =       "3",
  pages =        "214--230",
  month =        may,
  year =         "1993",
  CODEN =        "IESEDJ",
  DOI =          "http://dx.doi.org/10.1109/32.221135",
  ISSN =         "0098-5589 (print), 1939-3520 (electronic)",
  ISSN-L =       "0098-5589",
  bibdate =      "Tue Sep 09 09:27:01 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/TSE93.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Software Engineering",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
  xxnote =       "Check month: may or mar??",
}

@Article{VandePeer:1993:TSP,
  author =       "Y. {Van de Peer} and R. {De Wachter}",
  title =        "{Treecon}: {A} software package for the construction
                 and drawing of evolutionary trees",
  journal =      j-COMP-APPLIC-BIOSCI,
  volume =       "9",
  number =       "2",
  pages =        "177--??",
  day =          "1",
  month =        apr,
  year =         "1993",
  CODEN =        "COABER",
  ISSN =         "0266-7061",
  ISSN-L =       "0266-7061",
  bibdate =      "Sat May 18 15:34:25 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Applications in the Biosciences: CABIOS",
}

@Article{Biedl:1994:BHO,
  author =       "T. Biedl and G. Kant",
  title =        "A Better Heuristic for Orthogonal Graph Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "855",
  pages =        "24--??",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1994:DGT,
  author =       "P. Eades and S. Whitesides",
  title =        "Drawing graphs in two layers",
  journal =      j-THEOR-COMP-SCI,
  volume =       "131",
  number =       "2",
  pages =        "361--374",
  day =          "12",
  month =        sep,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:15:15 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Newcastle Univ., Callaghan,
                 NSW, Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "bipartite graph; biplanar; computational complexity;
                 computational geometry; edge set; graph theory;
                 NP-complete; polynomial time; straight line segments;
                 vertex set",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Garg:1994:AGD,
  author =       "A. Garg and R. Tamassia",
  title =        "Advances in Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "778",
  pages =        "12--??",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Garg:1994:PDA,
  author =       "A. Garg and R. Tamassia",
  title =        "Planar Drawings and Angular Resolution: Algorithms and
                 Bounds",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "855",
  pages =        "12--??",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@TechReport{Koutsofios:1994:EGD,
  author =       "Eleftherios Koutsofios",
  title =        "Editing graphs with {\em dotty}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "5",
  month =        jul,
  year =         "1994",
  bibdate =      "Sat May 23 08:02:17 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "This report, and the program, is included in the {\tt
                 graphviz} package, available for non-commercial use at
                 \path=http://www.research.att.com/sw/tools/graphviz/=.",
  acknowledgement = ack-nhfb,
}

@TechReport{Koutsofios:1994:EPL,
  author =       "Eleftherios Koutsofios",
  title =        "Editing Pictures with {\em lefty}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "5",
  month =        jul,
  year =         "1994",
  bibdate =      "Sat May 23 08:02:17 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "This report, and the program, is included in the {\tt
                 graphviz} package, available for non-commercial use at
                 \path=http://www.research.att.com/sw/tools/graphviz/=.",
  acknowledgement = ack-nhfb,
}

@Article{Metaxas:1994:PHD,
  author =       "P. T. Metaxas and G. E. Pantziou and A. Symvonis",
  title =        "Parallel $h$-$v$ Drawings of Binary Trees",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "834",
  pages =        "487--??",
  year =         "1994",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon May 13 11:52:14 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@TechReport{North:1994:AGV,
  author =       "Stephen C. North and Eleftherios Koutsofios",
  title =        "Applications of Graph Visualization",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  year =         "1994",
  bibdate =      "Tue Sep 09 09:23:34 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/GI94.pdf",
  acknowledgement = ack-nhfb,
}

@Article{VandePeer:1994:TWS,
  author =       "Y. {Van de Peer} and R. {De Wachter}",
  title =        "{TREECON} for {Windows}: a software package for the
                 construction and drawing of evolutionary trees for the
                 {Microsoft Windows} environment",
  journal =      j-COMP-APPLIC-BIOSCI,
  volume =       "10",
  number =       "5",
  pages =        "569--??",
  day =          "1",
  month =        sep,
  year =         "1994",
  CODEN =        "COABER",
  ISSN =         "0266-7061",
  ISSN-L =       "0266-7061",
  bibdate =      "Sat May 18 15:34:25 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Applications in the Biosciences: CABIOS",
}

@Article{Zitnik:1994:DGS,
  author =       "Arjana {\v{Z}}itnik",
  title =        "Drawing Graphs on Surfaces",
  journal =      j-SIAM-J-DISCR-MATH,
  volume =       "7",
  number =       "4",
  pages =        "593--597",
  month =        nov,
  year =         "1994",
  CODEN =        "SJDMEC",
  ISSN =         "0895-4801 (print), 1095-7146 (electronic)",
  ISSN-L =       "0895-4801",
  MRclass =      "05C10 (05C85 68R10)",
  MRnumber =     "95g:05039",
  MRreviewer =   "Arthur T. White",
  bibdate =      "Thu Apr 9 15:20:35 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Discrete Mathematics",
  journal-URL =  "http://epubs.siam.org/sidma",
}

@Article{Bertault:1995:ADS,
  author =       "F. Bertault",
  title =        "Adocs: a Drawing System for Generic Combinatorial
                 Structures",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "24--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Biedl:1995:NLB,
  author =       "T. C. Biedl",
  title =        "New Lower Bounds for Orthogonal Graph Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "28--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Bose:1995:DNP,
  author =       "P. Bose and F. Gomez and P. Ramos and G. Toussaint",
  title =        "Drawing Nice Projections of Objects in Space",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "52--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Brandenburg:1995:DGD,
  author =       "F. J. Brandenburg",
  title =        "Designing Graph Drawings by Layout Graph Grammars",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "416--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Brandenburg:1995:ECF,
  author =       "F. J. Brandenburg and M. Himsolt and C. Rohrer",
  title =        "An Experimental Comparison of Force-Directed and
                 Randomized Graph Drawing Algorithms",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "76--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Buti:1995:GSP,
  author =       "L. Buti and G. {Di Battista} and G. Liotta and E.
                 Tassinari",
  title =        "{GD-Workbench}: {A} System for Prototyping and Testing
                 Graph Drawing Algorithms",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "111--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Calamoneri:1995:EOG,
  author =       "T. Calamoneri and R. Petreschi",
  title =        "An Efficient Orthogonal Grid Drawing Algorithm for
                 Cubic Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "959",
  pages =        "31--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Chrobak:1995:LTA,
  author =       "M. Chrobak and T. H. Payne",
  title =        "A linear-time algorithm for drawing a planar graph on
                 a grid",
  journal =      j-INFO-PROC-LETT,
  volume =       "54",
  number =       "4",
  pages =        "241--246",
  day =          "26",
  month =        may,
  year =         "1995",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68R10 (05C10 05C85 68Q20)",
  MRnumber =     "96c:68150",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Chrobak:1995:MGD,
  author =       "M. Chrobak and S. Nakano",
  title =        "Minimum-Width Grid Drawings of Plane Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "104--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Cohen:1995:DGD,
  author =       "Robert F. Cohen and Giuseppe {Di Battista} and Roberto
                 Tamassia and Ioannis G. Tollis",
  title =        "Dynamic Graph Drawings: Trees, Series-Parallel
                 Digraphs, and Planar {ST-Digraphs}",
  journal =      j-SIAM-J-COMPUT,
  volume =       "24",
  number =       "5",
  pages =        "970--1001",
  month =        "????",
  year =         "1995",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "05C85 (68Pxx 68U05)",
  MRnumber =     "1 350 754",
  bibdate =      "Sat Jan 18 18:03:50 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@Article{Cohen:1995:TGD,
  author =       "R. F. Cohen and P. Eades and T. Lin and F. Ruskey",
  title =        "Three-Dimensional Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "1--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Crescenzi:1995:OUD,
  author =       "P. Crescenzi and A. Piperno",
  title =        "Optimal-Area Upward Drawings of {AVL} Trees",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "307--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Cruz:1995:DGE,
  author =       "I. F. Cruz and A. Garg",
  title =        "Drawing Graphs by Example Efficiently: Trees and
                 Planar Acyclic Diagraphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "404--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Cruz:1995:GDS,
  author =       "I. F. Cruz and J. P. Twarog",
  title =        "{3D} Graph Drawing with Simulated Annealing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "162--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Djidjev:1995:DGC,
  author =       "H. N. Djidjev",
  title =        "On Drawing a Graph Convexly in the Plane",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "76--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1995:DSP,
  author =       "P. Eades and P. Garvan",
  title =        "Drawing Stressed Planar Graphs in Three Dimensions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "212--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1995:GDC,
  author =       "P. Eades and J. Marks",
  title =        "Graph Drawing Contest Report",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "143--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{ElGindy:1995:RRI,
  author =       "H. ElGindy and G. Liotta and A. Lubiw and H. Meijer",
  title =        "Recognizing Rectangle of Influence Drawable Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "352--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Feng:1995:HDP,
  author =       "Q.-W. Feng and R. F. Cohen and P. Eades",
  title =        "How to Draw a Planar Clustered Graph",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "959",
  pages =        "21--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1995:BOU,
  author =       "U. Foessmeier and M. Kaufmann",
  title =        "On Bend-Minimum Orthogonal Upward Drawing of Directed
                 Planar Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "52--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1995:DHD,
  author =       "U. Foessmeier and M. Kaufmann",
  title =        "Drawing High Degree Graphs with Low Bend Numbers",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "254--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Fujita:1995:XDC,
  author =       "Shinsaku Fujita",
  title =        "{{\XYMTeX} for drawing chemical structural formulas}",
  journal =      j-TUGBOAT,
  volume =       "16",
  number =       "1",
  pages =        "80--88",
  month =        Mar,
  year =         "1995",
  ISSN =         "0896-3207",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.math.utah.edu/pub/tex/bib/tugboat.bib",
  fjournal =     "TUGboat",
}

@Article{Garg:1995:DAG,
  author =       "A. Garg",
  title =        "On Drawing Angle Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "84--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Gropp:1995:DC,
  author =       "H. Gropp",
  title =        "The Drawing of Configurations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "267--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Hashemi:1995:UDP,
  author =       "S. M. Hashemi and A. Kisielewicz and I. Rival",
  title =        "Upward Drawings on Planes and Spheres",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "277--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{He:1995:REL,
  author =       "X. He and M.-Y. Kao",
  title =        "Regular Edge Labelings and Drawings of Planar Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "96--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Ignatowicz:1995:DFG,
  author =       "J. Ignatowicz",
  title =        "Drawing Force-Directed Graphs Using {Optigraph}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "333--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Jourdan:1995:UDP,
  author =       "G.-V. Jourdan and I. Rival and N. Zaguia",
  title =        "Upward Drawing on the Plane Grid Using Less Ink",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "318--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Kaugars:1995:SAD,
  author =       "K. Kaugars and J. Reinfelds and A. Brazma",
  title =        "A Simple Algorithm for Drawing Large Graphs on Small
                 Screens",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "278--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Lenhart:1995:HDO,
  author =       "W. Lenhart and G. Liotta",
  title =        "How to Draw Outerplanar Minimum Weight
                 Triangulations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "373--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Liotta:1995:CPD,
  author =       "G. Liotta and G. {Di Battista}",
  title =        "Computing Proximity Drawings of Trees in the
                 {3-Dimensional} Space",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "955",
  pages =        "239--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Manning:1995:SDG,
  author =       "J. Manning and M. Atallah and K. Cudjoe and J.
                 Lozito",
  title =        "A System for Drawing Graphs with Geometric Symmetry",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "262--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{McCreary:1995:CGD,
  author =       "C. McCreary and F.-S. Shieh and H. Gill",
  title =        "{CG}: a Graph Drawing System Using Graph-Grammar
                 Parsing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "270--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Mohar:1995:FAU,
  author =       "B. Mohar and P. Rosenstiehl",
  title =        "A Flow Approach to Upward Drawings of Toroidal Maps",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "33--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Ohl:1995:DFD,
  author =       "Thorsten Ohl",
  title =        "Drawing {Feynman} diagrams with {\LaTeX} and
                 {\METAFONT}",
  journal =      j-COMP-PHYS-COMM,
  volume =       "90",
  number =       "2--3",
  pages =        "340--354",
  month =        oct,
  year =         "1995",
  CODEN =        "CPHCBZ",
  DOI =          "http://dx.doi.org/10.1016/0010-4655(95)90137-S",
  ISSN =         "0010-4655 (print), 1879-2944 (electronic)",
  ISSN-L =       "0010-4655",
  bibdate =      "Mon Feb 13 21:29:59 MST 2012",
  bibsource =    "Compendex database;
                 ftp://ftp.math.utah.edu/pub/tex/bib/texgraph.bib;
                 http://www.math.utah.edu/pub/bibnet/authors/f/feynman-richard-p.bib;
                 http://www.math.utah.edu/pub/tex/bib/compphyscomm1990.bib;
                 http://www.math.utah.edu/pub/tex/bib/texbook3.bib;
                 http://www.math.utah.edu/pub/tex/bib/texgraph.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/001046559590137S",
  abstract =     "feynMF is a {\LaTeX} package for easy drawing of
                 professional quality Feynman diagrams with METAFONT (or
                 METAPOST). feynMF lays out most diagrams satisfactorily
                 from the structure of the graph without any need for
                 manual intervention. Nevertheless all the power of
                 METAFONT (or METAPOST) is available for the most
                 complicated cases.",
  acknowledgement = ack-nhfb,
  affiliation =  "Technische Hochschule Darmstadt",
  affiliationaddress = "Darmstadt, Ger",
  classification = "723; 723.1.1; 723.5; 902.1; 921.4; 931.4",
  fjournal =     "Computer Physics Communications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00104655",
  keywords =     "Algorithms; Computer graphics; Computer programming
                 languages; Computer software; Drawing (graphics);
                 Feynman diagrams; Graph theory; latex (programming
                 language); metafont (programming language); Quantum
                 theory",
}

@Article{Papakostas:1995:IAB,
  author =       "A. Papakostas and I. G. Tollis",
  title =        "Improved Algorithms and Bounds for Orthogonal
                 Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "40--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Papakostas:1995:IIO,
  author =       "A. Papakostas and I. G. Tollis",
  title =        "Issues in Interactive Orthogonal Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "419--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Paris:1995:ADC,
  author =       "G. Paris",
  title =        "Automatic Drawing of Compound Digraphs for a Real-Time
                 Power System Simulator",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "431--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Purchase:1995:VGD,
  author =       "H. C. Purchase and R. F. Cohen and M. James",
  title =        "Validating Graph Drawing Aesthetics",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "435--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Saalfeld:1995:MGG,
  author =       "A. Saalfeld",
  title =        "Map Generalization as a Graph Drawing Problem",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "444--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Shieh:1995:DGD,
  author =       "F.-S. Shieh and C. L. McCreary",
  title =        "Directed Graphs Drawing by Clan-Based Decomposition",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1027",
  pages =        "472--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Stumme:1995:GHD,
  author =       "G. Stumme and R. Wille",
  title =        "A Geometrical Heuristic for Drawing Concept Lattices",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "452--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Sugiyama:1995:SUM,
  author =       "K. Sugiyama and K. Misue",
  title =        "A Simple and Unified Method for Drawing Graphs:
                 Magnetic-Spring Algorithm",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "364--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1995a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Tollis:1995:DTN,
  author =       "I. G. Tollis and C. Xia",
  title =        "Drawing Telecommunication Networks",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "894",
  pages =        "206--??",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat May 11 13:45:32 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Biedl:1996:OOD,
  author =       "T. C. Biedl",
  title =        "Optimal Orthogonal Drawings of Triconnected Plane
                 Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1097",
  pages =        "333--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Aug 14 09:38:08 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Davidson:1996:DGN,
  author =       "Ron Davidson and David Harel",
  title =        "Drawing graphs nicely using simulated annealing",
  journal =      j-TOG,
  volume =       "15",
  number =       "4",
  pages =        "301--331",
  month =        oct,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Mon Nov 11 16:14:40 MST 1996",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/tog.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/234538.html",
  abstract =     "The paradigm of simulated annealing is applied to the
                 problem of drawing graphs ``nicely.'' Our algorithm
                 deals with general undirected graphs with straight-line
                 edges, and employs several simple criteria for the
                 aesthetic quality of the result. The algorithm is
                 flexible, in that the relative weights of the criteria
                 can be changed. For graphs of modest size it produces
                 good results, competitive with those produced by other
                 methods, notably, the ``spring method'' and its
                 variants.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J778",
  keywords =     "algorithms; theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf G.2.2}: Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory. {\bf D.0}:
                 Software, GENERAL. {\bf E.0}: Data, GENERAL.",
}

@Article{DiBattista:1996:APT,
  author =       "Giuseppe {Di Battista} and Luca Vismara",
  title =        "Angles of Planar Triangular Graphs",
  journal =      j-SIAM-J-DISCR-MATH,
  volume =       "9",
  number =       "3",
  pages =        "349--359",
  month =        aug,
  year =         "1996",
  CODEN =        "SJDMEC",
  ISSN =         "0895-4801 (print), 1095-7146 (electronic)",
  ISSN-L =       "0895-4801",
  MRclass =      "05C10 (05C85 68R10)",
  MRnumber =     "97g:05060",
  MRreviewer =   "O. D'Antona",
  bibdate =      "Thu Apr 9 15:20:35 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240C (Computational complexity); C4260
                 (Computational geometry)",
  corpsource =   "Dipartimento di Discipline Sci., Terza Univ., Roma,
                 Italy",
  fjournal =     "SIAM Journal on Discrete Mathematics",
  journal-URL =  "http://epubs.siam.org/sidma",
  keywords =     "computational complexity; computational geometry;
                 Delaunay triangulations; disc packing representations;
                 graph drawing; graphs; linear time; mesh generation;
                 minimality properties; nonlinear optimization problem;
                 nonlinear programming; nonlinear programming mesh
                 generation; planar drawings; planar straight-line
                 drawing; planar triangular graph angles; triconnected
                 graph",
  language =     "English",
  pubcountry =   "USA",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eades:1996:GDM,
  author =       "P. Eades",
  title =        "Graph Drawing Methods",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1115",
  pages =        "40--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Oct 29 14:12:39 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1996b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1996:TKB,
  author =       "Peter Eades and Charles Stirk and Sue Whitesides",
  title =        "The techniques of {Kolmogorov} and {Barzdin} for
                 three-dimensional orthogonal graph drawings",
  journal =      j-INFO-PROC-LETT,
  volume =       "60",
  number =       "2",
  pages =        "97--103",
  month =        "????",
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68Q35 68R10)",
  MRnumber =     "97m:68195",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  xxtitle =      "The techniques of {Komolgorov} and {Bardzin} for
                 three-dimensional orthogonal graph drawings",
}

@TechReport{Ellson:1996:TTE,
  author =       "John Ellson and Stephen North",
  title =        "{TclDG} --- {A} {Tcl} Extension for Dynamic Graphs",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "11",
  year =         "1996",
  bibdate =      "Tue Sep 09 09:22:04 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/EN96.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Hutton:1996:UPD,
  author =       "Michael D. Hutton and Anna Lubiw",
  title =        "Upward planar drawing of single-source acyclic
                 digraphs",
  journal =      j-SIAM-J-COMPUT,
  volume =       "25",
  number =       "2",
  pages =        "291--311",
  month =        apr,
  year =         "1996",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "05C10 (68Q20 68Q25)",
  MRnumber =     "96m:05066",
  MRreviewer =   "O. D'Antona",
  bibdate =      "Thu Jan 23 11:12:29 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}

@TechReport{Koutsofios:1996:DGD,
  author =       "Eleftherios Koutsofios",
  title =        "Drawing graphs with {{\em dot}}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "20",
  month =        nov,
  year =         "1996",
  bibdate =      "Sat May 23 08:02:17 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "This report, and the program, is included in the {\tt
                 graphviz} package, available for non-commercial use at
                 \path=http://www.research.att.com/sw/tools/graphviz/=.",
  acknowledgement = ack-nhfb,
}

@TechReport{Koutsofios:1996:EGD,
  author =       "Eleftherios Koutsofios",
  title =        "Editing graphs with {{\tt dotty}}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "32",
  day =          "24",
  month =        jun,
  year =         "1996",
  bibdate =      "Tue Sep 09 09:11:59 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/dottyguide.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Koutsofios:1996:EPL,
  author =       "Eleftherios Koutsofios",
  title =        "Editing Pictures with {{\tt lefty}}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "43",
  day =          "24",
  month =        jun,
  year =         "1996",
  bibdate =      "Tue Sep 09 09:11:59 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/leftyguide.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Overveld:1996:SSD,
  author =       "C. W. A. M. van Overveld and Marie Luce Viaud",
  title =        "Sticky Splines: Definition and Manipulation of Spline
                 Structures with Maintained Topological Relations",
  journal =      j-TOG,
  volume =       "15",
  number =       "1",
  pages =        "72--98",
  month =        jan,
  year =         "1996",
  CODEN =        "ATGRDF",
  ISSN =         "0730-0301 (print), 1557-7368 (electronic)",
  ISSN-L =       "0730-0301",
  bibdate =      "Wed Apr 24 07:49:27 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tog.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225889.html;
                 http://www.acm.org/pubs/toc/Abstracts/0730-0301/226154.html",
  abstract =     "This paper describes an augmentation to the spline
                 concept to account for topological relations between
                 different spline curves. These topological relations
                 include incidence relations, constraining the extremes
                 of spline curves to other spline curves, and also more
                 general geometric relations, for example, involving the
                 tangents of spline curves in their extremes. To
                 maintain these incidence relations, some spline curves
                 may have to be transformed (translated, rotated,
                 scaled), or even deformed (i.e., the shape of the curve
                 may change) as a result of modifying other spline
                 curves. A data structure and algorithms are given to
                 implement the propagation of these transformations and
                 deformations.\par Based on the augmented spline
                 concept, to be called {\em sticky splines}, both a
                 script system to represent spline structures and an
                 interactive system for editing drawings while
                 automatically, maintaining their topological structure
                 are presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Graphics",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J778",
  keywords =     "algorithms; design; experimentation; theory",
  subject =      "{\bf I.3.5}: Computing Methodologies, COMPUTER
                 GRAPHICS, Computational Geometry and Object Modeling,
                 Splines. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory, Systems
                 theory. {\bf I.3.7}: Computing Methodologies, COMPUTER
                 GRAPHICS, Three-Dimensional Graphics and Realism.",
}

@Article{Rahman:1996:RGD,
  author =       "S. M. Rahman and S.-I. Nakano and T. Nishizeki",
  title =        "Rectangular Grid Drawings of Plane Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1090",
  pages =        "92--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Aug 14 09:38:08 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Shin:1996:AAU,
  author =       "C.-S. Shin and Sung Kwon Kim and K.-Y. Chwa",
  title =        "Area-Efficient Algorithms for Upward Straight-Line
                 Tree Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1090",
  pages =        "106--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Aug 14 09:38:08 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Thimbleby:1996:ECA,
  author =       "Harold Thimbleby",
  title =        "An Equivalence Class Algorithm for Drawing
                 Autostereograms",
  journal =      j-SPE,
  volume =       "26",
  number =       "3",
  pages =        "309--325",
  month =        mar,
  year =         "1996",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/spe.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{Tollis:1996:GDI,
  author =       "Ioannis G. Tollis",
  title =        "Graph drawing and information visualization",
  journal =      j-COMP-SURV,
  volume =       "28",
  number =       "4es",
  pages =        "19--19",
  month =        dec,
  year =         "1996",
  CODEN =        "CMSVAN",
  ISSN =         "0360-0300 (print), 1557-7341 (electronic)",
  ISSN-L =       "0360-0300",
  bibdate =      "Thu Jun 26 16:49:57 MDT 1997",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://www.acm.org/pubs/citations/journals/surveys/1996-28-4es/a19-tollis/",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
}

@Article{Trevisan:1996:NMA,
  author =       "Luca Trevisan",
  title =        "A note on minimum-area upward drawing of complete and
                 {Fibonacci} trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "231--236",
  month =        "????",
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (05C85 68Q25 68R10)",
  MRnumber =     "96k:68199",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Trevisan:1996:NMU,
  author =       "L. Trevisan",
  title =        "A note on minimum-area upward drawing of complete and
                 {Fibonacci} trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "57",
  number =       "5",
  pages =        "231--??",
  day =          "11",
  month =        mar,
  year =         "1996",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat May 18 15:34:25 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.math.utah.edu/pub/tex/bib/tugboat.bib;
                 UnCover library database",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Zinssmeister:1996:DGA,
  author =       "G. Zinssmeister and C. L. McCreary",
  title =        "Drawing Graphs with Attribute Graph Grammars",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1073",
  pages =        "443--??",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Aug 14 09:38:08 MDT 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Andalman:1997:DGB,
  author =       "B. Andalman and K. Ryall and W. Ruml and J. Marks",
  title =        "Design Gallery Browsers Based on {2D} and {3D} Graph
                 Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "322--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Berry:1997:GDM,
  author =       "J. Berry and N. Dean and M. Goldberg and G. Shannon",
  title =        "Graph Drawing and Manipulation with {LINK}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "425--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Biedl:1997:ASI,
  author =       "T. C. Biedl and M. Kaufmann",
  title =        "Area-efficient static and incremental graph drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1284",
  pages =        "37--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Biedl:1997:OGD,
  author =       "T. Biedl and T. Shermer and S. Whitesides and S.
                 Wismath",
  title =        "Orthogonal {3-D} Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "76--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Biedl:1997:TMU,
  author =       "T. C. Biedl and B. P. Madden and I. G. Tollis",
  title =        "The Three-Phase Method: {A} Unified Approach to
                 Orthogonal Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "391--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Bridgeman:1997:GDT,
  author =       "S. Bridgeman and A. Garg and R. Tamassia",
  title =        "A Graph Drawing and Translation Service on the {WWW}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "45--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Bridgeman:1997:IAI,
  author =       "S. S. Bridgeman and J. Fanto and A. Garg and R.
                 Tamassia",
  title =        "{InteractiveGiotto}: An Algorithm for Interactive
                 Orthogonal Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "303--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Calamoneri:1997:DGO,
  author =       "T. Calamoneri and A. Sterbini",
  title =        "Drawing 2-, 3- and 4-colorable Graphs in {$ O(n^2) $}
                 Volume",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "53--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Chan:1997:OAA,
  author =       "T. Chan and M. T. Goodrich and S. R. Kosaraju and R.
                 Tamassia",
  title =        "Optimizing Area and Aspect Ratio in Straight-Line
                 Orthogonal Tree Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "63--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Crescenzi:1997:MHD,
  author =       "P. Crescenzi and P. Penna",
  title =        "Minimum-Area h-v Drawings of Complete Binary Trees",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "371--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Crescenzi:1997:UDS,
  author =       "P. Crescenzi and P. Penna",
  title =        "Upward Drawings of Search Trees",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1197",
  pages =        "114--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{DeLaHiguera:1997:DET,
  author =       "C. {De La Higuera} and L. Nourine",
  title =        "Drawing and encoding two-dimensional posets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "175",
  number =       "2",
  pages =        "293--308",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 14:14:47 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity); C6130B (Graphics
                 techniques)",
  corpsource =   "Dept. d'Inf. Fondamentale, CNRS, Montpellier, France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "coding; compacting rules; computational complexity;
                 computer graphics; drawing; linear time algorithm;
                 minimal square grid; minimal surface drawing; set
                 theory; two-dimensional posets",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

@Article{DiBattista:1997:DDA,
  author =       "G. {Di Battista} and A. Garg and G. Liotta and A.
                 Parise",
  title =        "Drawing Directed Acyclic Graphs: An Experimental
                 Study",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "76--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Didimo:1997:GIT,
  author =       "W. Didimo and A. Leonforte",
  title =        "{GRID}: An Interactive Tool for Computing Orthogonal
                 Drawings With the Minimum Number of Bends",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "309--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1997:DCG,
  author =       "P. Eades and Q.-W Feng",
  title =        "Drawing Clustered Graphs on an Orthogonal Grid",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "146--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1997:FBV,
  author =       "P. Eades and M. E. Houle and R. Webber",
  title =        "Finding the Best Viewpoints for Three-Dimensional
                 Graph Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "87--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1997:OAG,
  author =       "P. Eades and R. F. Cohen and Mao Lin Huang",
  title =        "Online Animated Graph Drawing for {Web} Navigation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "330--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1997:SDA,
  author =       "P. Eades and Q. W. Feng and X. Lin",
  title =        "Straight-Line Drawing Algorithms for Hierarchical
                 Graphs and Clustered Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "113--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Eades:1997:TAT,
  author =       "P. Eades and A. Symvonis and S. Whitesides",
  title =        "Two Algorithms for Three Dimensional Orthogonal Graph
                 Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "139--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1997:AAB,
  author =       "U. Foessmeier and M. Kaufmann",
  title =        "Algorithms and Area Bounds for Nonplanar Orthogonal
                 Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "134--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1997:DPG,
  author =       "U. Foessmeier and G. Kant and M. Kaufmann",
  title =        "{2-Visibility} Drawings of Planar Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "155--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1997:IOG,
  author =       "U. Foessmeier",
  title =        "Interactive Orthogonal Graph Drawing: Algorithms and
                 Bounds",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "111--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Foessmeier:1997:NDP,
  author =       "U. Foessmeier and M. Kaufmann",
  title =        "Nice Drawings for Planar Bipartite Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1203",
  pages =        "122--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Garg:1997:NMC,
  author =       "A. Garg and R. Tamassia",
  title =        "A New Minimum Cost Flow Algorithm with Applications to
                 Graph Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1190",
  pages =        "201--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Hundack:1997:AGD,
  author =       "C. Hundack and P. Mutzel and I. Pouchkarev and S.
                 Thome",
  title =        "{ArchE}: {A} Graph Drawing System for Archaeology",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "297--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Juenger:1997:PUP,
  author =       "M. Juenger and S. Leipert and P. Mutzel",
  title =        "Pitfalls of Using {PQ-Trees} in Automatic Graph
                 Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "193--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Kakoulis:1997:ALE,
  author =       "K. C. Kakoulis and I. G. Tollis",
  title =        "An Algorithm for Labeling Edges of Hierarchical
                 Drawings",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "169--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Kant:1997:REL,
  author =       "G. Kant and Xin He",
  title =        "Regular edge labeling of $4$-connected plane graphs
                 and its applications in graph drawing problems",
  journal =      j-THEOR-COMP-SCI,
  volume =       "172",
  number =       "1-2",
  pages =        "175--193",
  day =          "10",
  month =        feb,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 14:14:47 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975",
  keywords =     "4-connected plane graphs; canonical ordering;
                 computational geometry; graph drawing problems; graph
                 theory; linear time algorithms; rectangular dual;
                 regular edge labeling; triconnected triangulated plane
                 graphs; visibility representation",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kim:1997:LWL,
  author =       "Sung Kwon Kim",
  title =        "Logarithmic width, linear area upward drawing of {AVL}
                 trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "63",
  number =       "6",
  pages =        "303--307",
  month =        "????",
  year =         "1997",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  MRclass =      "68U05 (68R10)",
  MRnumber =     "1 477 845",
  bibdate =      "Sat Apr 11 12:24:19 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Lenhart:1997:DFM,
  author =       "W. Lenhart and G. Liotta",
  title =        "Drawable and Forbidden Minimum Weight Triangulations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "1--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Lin:1997:ARD,
  author =       "X. Lin and P. Eades",
  title =        "Area Requirements for Drawing Hierarchically Planar
                 Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "219--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Pach:1997:TGD,
  author =       "J. Pach and T. Thiele and G. Toth",
  title =        "Three-dimensional Grid Drawings of Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "47--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Papakostas:1997:IOG,
  author =       "A. Papakostas and I. G. Tollis",
  title =        "Incremental Orthogonal Graph Drawing in Three
                 Dimensions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "52--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Patrignani:1997:TTD,
  author =       "M. Patrignani and F. Vargiu",
  title =        "{3DCube}: {A} Tool for Three Dimensional Graph
                 Drawing",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "284--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Rahman:1997:LAO,
  author =       "M. Saidur Rahman and S.-I. Nakano and T. Nishizeki",
  title =        "A Linear Algorithm for Optimal Orthogonal Drawings of
                 Triconnected Cubic Plane Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "99--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Seemann:1997:ESA,
  author =       "J. Seemann",
  title =        "Extending the Sugiyama Algorithm for Drawing {UML}
                 Class Diagrams: Towards Automatic Layout of
                 Object-Oriented Software Diagrams",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "415--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Thiemann:1997:DSD,
  author =       "P. J. Thiemann",
  title =        "Drawing Syntax Diagrams in {Haskell}",
  journal =      j-SPE,
  volume =       "27",
  number =       "8",
  pages =        "967--??",
  month =        aug,
  year =         "1997",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat Sep 13 15:57:17 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/spe.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{Tunkelang:1997:LNU,
  author =       "D. Tunkelang and R. J. Byrd and J. W. Cooper",
  title =        "Lexical Navigation: Using Incremental Graph Drawing
                 for Query Refinement",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "316--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Valtr:1997:GDN,
  author =       "P. Valtr",
  title =        "Graph Drawings with no $k$ Pairwise Crossing Edges",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1353",
  pages =        "205--??",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1997b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Bertolazzi:1998:COD,
  author =       "P. Bertolazzi and G. {Di Battista} and W. Didimo",
  title =        "Computing Orthogonal Drawings with the Minimum Number
                 of Bends",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1272",
  pages =        "331--??",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1998a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Duncan:1998:BAR,
  author =       "C. A. Duncan and M. T. Goodrich and S. G. Kobourov",
  title =        "Balanced Aspect Ratio Trees and Their Use for Drawing
                 Very Large Graphs",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1547",
  pages =        "111--124",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Wed Sep 15 10:01:31 MDT 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1998b.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
  keywords =     "graph drawing",
}

@Article{Miyadera:1998:DFL,
  author =       "Youzou Miyadera and Koushi Anzai and Hiroshi Unno and
                 Takeo Yaku",
  title =        "Depth-first layout algorithm for trees",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "4",
  pages =        "187--194",
  day =          "29",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Sat Nov 7 17:55:59 MST 1998",
  bibsource =    "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  abstract =     "This paper deals with a layout problem of trees
                 satisfying certain given aesthetic conditions. It is
                 known as ``tidy drawing problems of trees''. We
                 consider a type of tree called a ``tree-structured
                 diagram'' in which each node has variable size and
                 location.\par

                 In this paper, for drawing tree-type program
                 flowcharts, we first formulate ``tidy drawing problems
                 of tree-structured diagrams'' on the integral lattice.
                 The formulation defines a tree-structured diagram and
                 aesthetic conditions, which are modifications of the
                 tidy drawing problem of trees. Second, we develop {$
                 O(n) $}- and {$ O(n^2) $}-time algorithms to provide
                 layouts which satisfy the conditions introduced. As a
                 result, we obtain the relationship between the
                 aesthetic conditions and the time complexity of
                 algorithms.",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
}

@Article{Papakostas:1998:ODH,
  author =       "A. Papakostas and I. G. Tollis",
  title =        "Orthogonal Drawing of High Degree Graphs with Small
                 Area and Few Bends",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "1272",
  pages =        "354--??",
  year =         "1998",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Tue Apr 28 08:51:33 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs1998a.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Sassani:1998:ADB,
  author =       "D. C. Sassani and E. L. Shock and K. Harstad and J.
                 Bellan and C. -S. Shin and K. K. Sung and S. -H. Kim
                 and K. -Y. Chwa",
  title =        "Algorithms for drawing binary trees in the plane",
  journal =      j-INFO-PROC-LETT,
  volume =       "66",
  number =       "3",
  publisher =    "Elsevier Science",
  pages =        "133--139",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Nov 8 05:39:54 MST 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 Ingenta database",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  pagecount =    "7",
}

@Article{Hirabayashi:1999:DTP,
  author =       "R. Hirabayashi and Y. T. Ikebe and K. Iwamura and T.
                 Nakayama",
  title =        "Drawing a Tree on Parallel Lines",
  journal =      j-COMP-MATH-APPL,
  volume =       "37",
  number =       "11",
  publisher =    "Elsevier Science",
  pages =        "171--176",
  month =        jun,
  year =         "1999",
  CODEN =        "CMAPDK",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Fri Nov 8 05:39:54 MST 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 Ingenta database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  pagecount =    "6",
}

@Misc{Himsolt:199x:G,
  author =       "M. Himsolt",
  title =        "Graphed 3.0",
  year =         "199x",
  bibdate =      "Sat May 23 08:26:08 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "Available by anonymous ftp at
                 ftp://forwiss.uni-passau.de/pub/local/graphed.",
  acknowledgement = ack-nhfb,
}

@TechReport{North:19xx:ILD,
  author =       "Stephen C. North",
  title =        "Incremental Layout in {DynaDAG}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  year =         "19xx",
  bibdate =      "Tue Sep 09 09:27:51 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/dynadag.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Choi:2000:PPT,
  author =       "J-H. Choi and H-Y. Jung and H-S. Kim and H-G. Cho",
  title =        "{PhyloDraw}: a phylogenetic tree drawing system",
  journal =      j-BIOINFORMATICS,
  volume =       "16",
  number =       "11",
  publisher =    "Oxford University Press",
  pages =        "1056--1058",
  month =        nov,
  year =         "2000",
  CODEN =        "????",
  ISSN =         "1367-4803 (print), 1367-4811 (electronic)",
  ISSN-L =       "1367-4803",
  bibdate =      "Fri Nov 8 05:39:54 MST 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 Ingenta database",
  acknowledgement = ack-nhfb,
  fjournal =     "Bioinformatics",
  pagecount =    "3",
}

@Article{Gansner:2000:OGV,
  author =       "Emden R. Gansner and Stephen C. North",
  title =        "An open graph visualization system and its
                 applications to software engineering",
  journal =      j-SPE,
  volume =       "30",
  number =       "11",
  pages =        "1203--1233",
  month =        sep,
  year =         "2000",
  CODEN =        "SPEXBL",
  DOI =          "http://dx.doi.org/10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Tue Mar 13 06:46:08 2001",
  bibsource =    "http://www.interscience.wiley.com/jpages/0038-0644;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www3.interscience.wiley.com/journalfinder.html",
  URL =          "http://www.research.att.com/sw/tools/graphviz/GN99.pdf;
                 http://www3.interscience.wiley.com/cgi-bin/abstract/72517075/START;
                 http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=72517075&PLACEBO=IE.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}

@Article{Shin:2000:AEA,
  author =       "C. -S. Shin and S. K. Kim and K. -Y. Chwa",
  title =        "Area-efficient algorithms for straight-line tree
                 drawings",
  journal =      j-COMP-GEOM,
  volume =       "15",
  number =       "4",
  publisher =    "Elsevier Science",
  pages =        "175--202",
  month =        apr,
  year =         "2000",
  CODEN =        "????",
  ISSN =         "0925-7721",
  ISSN-L =       "0925-7721",
  bibdate =      "Fri Nov 8 05:39:54 MST 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 Ingenta database",
  acknowledgement = ack-nhfb,
  fjournal =     "Computational Geometry. Theory and Applications",
  pagecount =    "28",
}

@Article{Chan:2002:NLA,
  author =       "T. M. Chan",
  title =        "A Near-Linear Area Bound for Drawing Binary Trees",
  journal =      j-ALGORITHMICA,
  volume =       "34",
  number =       "1",
  pages =        "1--13",
  month =        jul,
  year =         "2002",
  CODEN =        "ALGOEJ",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00453-002-0937-x",
  ISSN =         "0178-4617 (print), 1432-0541 (electronic)",
  ISSN-L =       "0178-4617",
  MRclass =      "68U05 (05C05 05C62 68R10)",
  MRnumber =     "MR1912924 (2003f:68136)",
  MRreviewer =   "Therese C. Biedl",
  bibdate =      "Fri Jan 6 11:38:16 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=34&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 MathSciNet database",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=34&issue=1&spage=1",
  acknowledgement = ack-nhfb,
  fjournal =     "Algorithmica. An International Journal in Computer
                 Science",
  journal-URL =  "http://link.springer.com/journal/453",
}

@TechReport{Gansner:2002:DGD,
  author =       "Emden Gansner and Eleftherios Koutsofios and Stephen
                 North",
  title =        "Drawing graphs with {{\tt dot}}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "40",
  day =          "4",
  month =        feb,
  year =         "2002",
  bibdate =      "Tue Sep 09 09:06:53 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/dotguide.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Garg:2002:SLD,
  author =       "Ashim Garg and Adrian Rusu",
  title =        "Straight-Line Drawings of Binary Trees with Linear
                 Area and Arbitrary Aspect Ratio",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "2528",
  pages =        "320--??",
  year =         "2002",
  CODEN =        "LNCSD9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Sat Nov 30 20:58:07 MST 2002",
  bibsource =    "http://link.springer-ny.com/link/service/series/0558/tocs/t2528.htm;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://link.springer.de/link/service/series/0558/bibs/2528/25280320.htm;
                 http://link.springer.de/link/service/series/0558/papers/2528/25280320.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Lecture Notes in Computer Science",
}

@TechReport{North:2002:AT,
  author =       "Stephen C. North",
  title =        "{Agraph} Tutorial",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "22",
  day =          "2",
  month =        aug,
  year =         "2002",
  bibdate =      "Tue Sep 09 09:19:34 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/Agraph.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{North:2002:DGN,
  author =       "Stephen C. North",
  title =        "Drawing graphs with {NEATO}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "11",
  day =          "10",
  month =        apr,
  year =         "2002",
  bibdate =      "Tue Sep 09 09:10:42 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/neatoguide.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Penna:2002:ATT,
  author =       "P. Penna",
  title =        "On the approximability of two tree drawing
                 conventions",
  journal =      j-INFO-PROC-LETT,
  volume =       "82",
  number =       "5",
  publisher =    "Elsevier Science",
  pages =        "237--242",
  day =          "15",
  month =        jun,
  year =         "2002",
  CODEN =        "IFPLAT",
  ISSN =         "0020-0190 (print), 1872-6119 (electronic)",
  ISSN-L =       "0020-0190",
  bibdate =      "Fri Nov 8 05:39:54 MST 2002",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 Ingenta database",
  acknowledgement = ack-nhfb,
  fjournal =     "Information Processing Letters",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00200190",
  pagecount =    "6",
}

@TechReport{Gansner:2003:DGG,
  author =       "Emden R. Gansner",
  title =        "Drawing graphs with {GraphViz}",
  type =         "Technical Report",
  institution =  "AT\&T Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  day =          "15",
  month =        apr,
  year =         "2003",
  bibdate =      "Tue Sep 09 09:30:30 2003",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www.research.att.com/sw/tools/graphviz/",
  URL =          "http://www.research.att.com/sw/tools/graphviz/libguide.pdf",
  acknowledgement = ack-nhfb,
}

@Article{Hong:2003:DTS,
  author =       "Seok-Hee Hong and Peter Eades",
  title =        "Drawing Trees Symmetrically in Three Dimensions",
  journal =      j-ALGORITHMICA,
  volume =       "36",
  number =       "2",
  pages =        "153--178",
  month =        apr,
  year =         "2003",
  CODEN =        "ALGOEJ",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00453-002-1011-4",
  ISSN =         "0178-4617 (print), 1432-0541 (electronic)",
  ISSN-L =       "0178-4617",
  MRclass =      "68R10 (05C10 05C85)",
  MRnumber =     "MR1971780 (2004f:68119)",
  MRreviewer =   "Pranava K. Jha",
  bibdate =      "Fri Jan 6 11:38:17 MST 2006",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=36&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 MathSciNet database",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=36&issue=2&spage=153",
  acknowledgement = ack-nhfb,
  fjournal =     "Algorithmica. An International Journal in Computer
                 Science",
  journal-URL =  "http://link.springer.com/journal/453",
}

@Article{Akkerman:2004:CDT,
  author =       "Thorsten Akkerman and Christoph Buchheim and Michael
                 J{\"u}nger and Daniel Teske",
  title =        "On the complexity of drawing trees nicely:
                 corrigendum",
  journal =      j-ACTA-INFO,
  volume =       "40",
  number =       "8",
  pages =        "603--607",
  month =        jul,
  year =         "2004",
  CODEN =        "AINFA2",
  DOI =          "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00236-004-0138-y",
  ISSN =         "0001-5903 (print), 1432-0525 (electronic)",
  ISSN-L =       "0001-5903",
  bibdate =      "Tue Jul 5 09:51:18 MDT 2005",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0001-5903&volume=40&issue=8;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
  note =         "See \cite{Supowit:1983:CDT}.",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=40&issue=8&spage=603",
  acknowledgement = ack-nhfb,
  fjournal =     "Acta Informatica",
  journal-URL =  "http://www.springerlink.com/content/0001-5903",
}

@Article{Buchheim:2006:DRT,
  author =       "Christoph Buchheim and Michael J{\"u}nger and
                 Sebastian Leipert",
  title =        "Drawing rooted trees in linear time",
  journal =      j-SPE,
  volume =       "36",
  number =       "6",
  pages =        "651--665",
  month =        may,
  year =         "2006",
  CODEN =        "SPEXBL",
  DOI =          "http://dx.doi.org/10.1002/spe.713",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Wed Oct 17 18:33:12 MDT 2007",
  bibsource =    "http://www.interscience.wiley.com/jpages/0038-0644;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib;
                 http://www3.interscience.wiley.com/journalfinder.html",
  abstract =     "The aim of automatic graph drawing is the development
                 of algorithms for creating nice and easily readable
                 layouts of abstractly given graphs. For the special
                 case of rooted trees of unbounded degree, John Q.
                 Walker II presented a drawing algorithm in this journal
                 in 1990. This algorithm is an extension of the
                 Reingold-Tilford algorithm. It yields very good results
                 and is therefore widely used. Furthermore, it is widely
                 assumed to run in linear time, as the author claims in
                 his article. However, the algorithm in its presented
                 form clearly needs quadratic runtime. We explain the
                 reasons for that and state a revised algorithm that
                 creates the same layouts in linear time.",
  acknowledgement = ack-nhfb,
  fjournal =     "Software---Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "14 Feb 2006",
}

%%% ====================================================================
%%% Cross-referenced entries must come last:

@Proceedings{Nichols:1987:EES,
  editor =       "H. K. (Howard K.) Nichols and D. (Dan) Simpson",
  booktitle =    "ESEC '87: 1st European Software Engineering
                 Conference, Strasbourg, France, September 9--11, 1987:
                 proceedings",
  title =        "{ESEC} '87: 1st European Software Engineering
                 Conference, Strasbourg, France, September 9--11, 1987:
                 proceedings",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 404",
  year =         "1987",
  ISBN =         "0-387-18712-X",
  ISBN-13 =      "978-0-387-18712-9",
  LCCN =         "QA76.758 .E97 1987",
  bibdate =      "Sat May 23 08:43:46 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:1989:PIW,
  editor =       "{ACM}",
  booktitle =    "Proceedings of the 2nd International Workshop on
                 Software Configuration Management, Princeton, New
                 Jersey, October 24, 1989",
  title =        "Proceedings of the 2nd International Workshop on
                 Software Configuration Management, Princeton, New
                 Jersey, October 24, 1989",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "viii + 179",
  year =         "1989",
  ISBN =         "0-89791-334-5",
  ISBN-13 =      "978-0-89791-334-8",
  LCCN =         "QA76.76.C69 I58 1989",
  bibdate =      "Sat May 23 08:46:25 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{ACM:1990:UTA,
  editor =       "{ACM}",
  booktitle =    "UIST. Third Annual Symposium on User Interface
                 Software and Technology. Proceedings of the ACM
                 SIGGRAPH Symposium, Snowbird, Utah, USA, October 3--5,
                 1990",
  title =        "{UIST}. Third Annual Symposium on User Interface
                 Software and Technology. Proceedings of the {ACM}
                 {SIGGRAPH} Symposium, Snowbird, Utah, {USA}, October
                 3--5, 1990",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "vii + 177",
  month =        oct,
  year =         "1990",
  CODEN =        "CGRADI, CPGPBZ",
  ISBN =         "0-89791-410-4",
  ISBN-13 =      "978-0-89791-410-9",
  ISSN =         "0097-8930",
  LCCN =         "QA76.9.U83A27 1990",
  bibdate =      "Tue Feb 06 09:12:29 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  URL =          "http://info.acm.org/pubs/contents/proceedings/graph/",
  abstract =     "The following topics were dealt with: user interface
                 management systems (UIMS); software tools, automatic
                 generation of UIMS; ideal operating system for user
                 interfacing; VUIMS, visual UIMS; Quick, user interface
                 design kit for non-programmers; Suite user interface
                 software; metaphor; and interaction techniques.",
  acknowledgement = ack-nhfb,
  classification = "C6115 (Programming support); C6170 (Expert systems);
                 C6180 (User interfaces)",
  confdate =     "3--5 Oct. 1990",
  conflocation = "Snowbird, UT, USA",
  confsponsor =  "ACM",
  keywords =     "Automatic generation; Ideal operating system;
                 Interaction techniques; Metaphor; Quick; Software
                 tools; Suite user interface software; User interface
                 management systems; Visual UIMS",
  language =     "English",
  pubcountry =   "USA",
  thesaurus =    "Interactive systems; Software tools; User interface
                 management systems",
}

@Proceedings{Clark:1990:TAP,
  editor =       "Malcolm Clark",
  booktitle =    "{\TeX}\emdash Ap\-pli\-ca\-tions, Uses, Methods",
  title =        "{\TeX}\emdash Ap\-pli\-ca\-tions, Uses, Methods",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "277",
  year =         "1990",
  ISBN =         "0-13-912296-6",
  ISBN-13 =      "978-0-13-912296-5",
  LCCN =         "Z253.4.T47 C45 1990",
  bibdate =      "Fri Jul 22 08:39:56 1994",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  price =        "US\$69.95",
}

@Proceedings{MacKay:1991:GIC,
  editor =       "S. MacKay and E. M. Kidd",
  booktitle =    "Graphics Interface '91, Calgary, Alberta, 3--7 June
                 1991: proceedings",
  title =        "Graphics Interface '91, Calgary, Alberta, 3--7 June
                 1991: proceedings",
  publisher =    pub-CIPS,
  address =      pub-CIPS:adr,
  pages =        "xi + 287",
  year =         "1991",
  ISBN =         "0-9695338-0-2",
  ISBN-13 =      "978-0-9695338-0-1",
  LCCN =         "T385.P792 1991",
  bibdate =      "Tue Dec 19 16:21:47 MST 1995",
  bibsource =    "http://www.math.utah.edu/pub/bibnet/authors/p/peters-jorg.bib;
                 http://www.math.utah.edu/pub/tex/bib/trees.bib",
}

@Proceedings{Tamassia:1995:GDD,
  editor =       "Roberto Tamassia and Ioannis G. Tollis",
  booktitle =    "Graph drawing: {DIMACS} International Workshop, {GD}
                 '94, Princeton, New Jersey, {USA}, October 10--12,
                 1994: proceedings",
  title =        "Graph drawing: {DIMACS} International Workshop, {GD}
                 '94, Princeton, New Jersey, {USA}, October 10--12,
                 1994: proceedings",
  volume =       "894",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 469",
  year =         "1995",
  CODEN =        "LNCSD9",
  ISBN =         "3-540-58950-3 (Berlin), 0-387-58950-3 (New York)",
  ISBN-13 =      "978-3-540-58950-1 (Berlin), 978-0-387-58950-3 (New
                 York)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "T385 .D55 1994",
  bibdate =      "Fri Apr 12 07:15:02 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  price =        "DM94.00",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  keywords =     "computer graphics --- congresses; graph theory ---
                 congresses",
  xxvolume =     "4004850125",
}

@Proceedings{Brandenburg:1996:GDS,
  editor =       "F. J. (Franz J.) Brandenburg",
  booktitle =    "Graph drawing: Symposium on Graph Drawing, {GD} '95,
                 Passau, Germany, September 20--22, 1995: proceedings",
  title =        "Graph drawing: Symposium on Graph Drawing, {GD} '95,
                 Passau, Germany, September 20--22, 1995: proceedings",
  volume =       "1027",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 526",
  year =         "1996",
  CODEN =        "LNCSD9",
  ISBN =         "3-540-60723-4 (softcover)",
  ISBN-13 =      "978-3-540-60723-6 (softcover)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "T385 .S884 1995",
  bibdate =      "Sat Dec 21 16:06:37 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  keywords =     "Computer graphics --- Congresses; Graph theory ---
                 Congresses.",
}

@Proceedings{DiBattista:1997:GDI,
  editor =       "Giuseppe {Di Battista}",
  booktitle =    "Graph drawing: 5th International Symposium, {GD'97},
                 Rome, Italy, September 18--20, 1997: proceedings",
  title =        "Graph drawing: 5th International Symposium, {GD'97},
                 Rome, Italy, September 18--20, 1997: proceedings",
  volume =       "1353",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xii + 448",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISBN =         "3-540-63938-1",
  ISBN-13 =      "978-3-540-63938-1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "QA267.A1 L43 no.1353",
  bibdate =      "Mon Mar 16 11:38:40 MST 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  keywords =     "computer graphics -- congresses; graph theory --
                 congresses",
}

@Proceedings{North:1997:GDS,
  editor =       "Stephen C. North",
  booktitle =    "Graph drawing: Symposium on Graph Drawing, {GD} '96,
                 Berkeley, California, {USA}, September 18--20, 1996:
                 proceedings",
  title =        "Graph drawing: Symposium on Graph Drawing, {GD} '96,
                 Berkeley, California, {USA}, September 18--20, 1996:
                 proceedings",
  volume =       "1190",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xi + 408",
  year =         "1997",
  CODEN =        "LNCSD9",
  ISBN =         "3-540-62495-3",
  ISBN-13 =      "978-3-540-62495-0",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "T385 .S884 1996",
  bibdate =      "Mon Aug 25 09:50:07 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/trees.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  keywords =     "computer graphics -- congresses; graph theory --
                 congresses",
}