000 05016nam a22005415i 4500
001 978-3-540-45848-7
003 DE-He213
005 20160624102009.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540458487
_9978-3-540-45848-7
024 7 _a10.1007/3-540-45848-4
_2doi
050 4 _aQA76.9.M35 
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aGraph Drawing
_h[electronic resource] :
_b9th International Symposium, GD 2001 Vienna, Austria, September 23–26, 2001 Revised Papers /
_cedited by Petra Mutzel, Michael Jünger, Sebastian Leipert.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aXVI, 528 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2265
505 0 _aHierarchical Drawing -- A Fixed-Parameter Approach to Two-Layer Planarization -- How to Layer a Directed Acyclic Graph -- Fast and Simple Horizontal Coordinate Assignment -- Automated Visualization of Process Diagrams -- Planarity -- Planarization of Clustered Graphs -- An Algorithm for Finding Large Induced Planar Subgraphs -- A Characterization of DFS Cotree Critical Graphs -- Crossing Theory -- An Improved Lower Bound for Crossing Numbers -- Crossing-Critical Graphs and Path-Width -- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs -- Compaction -- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size -- Labeling Heuristics for Orthogonal Drawings -- Planar Graphs -- Untangling a Polygon -- Drawing with Fat Edges -- Symmetries -- Detecting Symmetries by Branch & Cut -- Drawing Graphs Symmetrically in Three Dimensions -- Interactive Drawing -- User Hints for Directed Graph Drawing -- Graph Drawing in Motion II -- Online Hierarchical Graph Drawing -- Representations -- Recognizing String Graphs Is Decidable -- On Intersection Graphs of Segments with Prescribed Slopes -- Aesthetics -- A Short Note on the History of Graph Drawing -- Towards an Aesthetic Invariant for Graph Drawing -- 2D-and 3D-Embeddings -- Orthogonal Drawings with Few Layers -- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing -- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions -- Low-Distortion Embeddings of Trees -- Data Visualization -- Insight into Data through Visualization -- Floor-Planning -- Floor-Planning via Orderly Spanning Trees -- Disconnected Graph Layout and the Polyomino Packing Approach -- Planar Drawings -- Orthogonal Drawings of Plane Graphs without Bends -- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution -- Corrected Printing of GD 2000 Paper -- On Polar Visibility Representations of Graphs -- Software Exhibition -- Tulip -- The ILOG JViews Graph Layout Module -- WAVE -- WilmaScope— An Interactive 3D Graph Visualisation System -- Exploration and Visualization of Computer Networks: Polyphemus and Hermes -- CrocoCosmos -- The Graph Drawing Server -- Drawing Database Schemas with DBdraw -- yFiles: Visualization and Automatic Layout of Graphs -- BioPath -- Graph Visualization API Library for Application Builders -- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms -- Caesar Automatic Layout of UML Class Diagrams -- Visone Software for Visual Social Network Analysis -- Generating Schematic Cable Plans Using Springembedder Methods -- SugiBib -- Knowledge Index Manager -- Planarity Testing of Graphs on Base of a Spring Model -- AGD: A Library of Algorithms for Graph Drawing -- Industrial Plant Drawer -- Pajek— Analysis and Visualization of Large Networks -- GLIDE -- ViSta -- Graphviz— Open Source Graph Drawing Tools -- Graph Exchange Formats -- Exchanging Graphs with GXL -- GraphML Progress Report Structural Layer Proposal -- Graph Drawing Contest -- Graph-Drawing Contest Report.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aMutzel, Petra.
_eeditor.
700 1 _aJünger, Michael.
_eeditor.
700 1 _aLeipert, Sebastian.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540433095
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2265
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45848-4
942 _2EBK5609
_cEBK
999 _c34903
_d34903