| 000 | 04739nam a22005655i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-11805-0 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102140.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100305s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642118050 _9978-3-642-11805-0 |
||
| 024 | 7 |
_a10.1007/978-3-642-11805-0 _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] : _b17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers / _cedited by David Eppstein, Emden R. Gansner. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_a426p. 199 illus. _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 ; _v5849 |
|
| 505 | 0 | _aInvited Talks -- Why Are String Graphs So Beautiful? -- The Art of Cheating When Drawing a Graph -- Papers -- Drawing Hamiltonian Cycles with No Large Angles -- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings -- On the Perspectives Opened by Right Angle Crossing Drawings -- Drawing 3-Polytopes with Good Vertex Resolution -- Planar Drawings of Higher-Genus Graphs -- Splitting Clusters to Get C-Planarity -- On the Characterization of Level Planar Trees by Minimal Patterns -- Characterization of Unlabeled Radial Level Planar Graphs -- Upward Planarization Layout -- More Flexible Radial Layout -- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations -- Port Constraints in Hierarchical Layout of Data Flow Diagrams -- Fast Edge-Routing for Large Graphs -- Leftist Canonical Ordering -- Succinct Greedy Drawings Do Not Always Exist -- Geometric Simultaneous Embeddings of a Graph and a Matching -- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs -- Removing Independently Even Crossings -- Manhattan-Geodesic Embedding of Planar Graphs -- Orthogonal Connector Routing -- On Rectilinear Drawing of Graphs -- Semi-bipartite Graph Visualization for Gene Ontology Networks -- On Open Problems in Biological Network Visualization -- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View -- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs -- Drawing Trees in a Streaming Model -- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree -- Drawing Planar 3-Trees with Given Face-Areas -- 3D Visibility Representations by Regular Polygons -- Complexity of Some Geometric and Topological Problems -- On Planar Supports for Hypergraphs -- DAGmaps and ?-Visibility Representations of DAGs -- Drawing Directed Graphs Clockwise -- An Improved Algorithm for the Metro-line Crossing Minimization Problem -- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection -- Posters -- GMap: Drawing Graphs as Maps -- Using High Dimensions to Compare Drawings of Graphs -- On ?-Constrained Upward Topological Book Embeddings -- 4-Labelings and Grid Embeddings of Plane Quadrangulations -- IBM ILOG Graph Layout for Eclipse -- Layout Techniques Coupled with Web2.0-Based Business Process Modeling -- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles -- Visualization of Complex BPEL Models -- DAGmaps and Dominance Relationships -- Scaffold Hunter – Interactive Exploration of Chemical Space -- Graph Drawing Contest -- Graph Drawing Contest Report. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 |
_aAlgebra _xData processing. |
|
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aMath Applications in Computer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aModels and Principles. |
| 650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
| 650 | 2 | 4 | _aUser Interfaces and Human Computer Interaction. |
| 700 | 1 |
_aEppstein, David. _eeditor. |
|
| 700 | 1 |
_aGansner, Emden R. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642118043 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v5849 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-11805-0 |
| 942 |
_2EBK8943 _cEBK |
||
| 999 |
_c38237 _d38237 |
||