Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Geometry - Intuitive, Discrete, and Convex : A Tribute to László Fejes Tóth / / edited by Imre Bárány, Károly Jr. Böröczky, Gábor Fejes Tóth, Janos Pach
| Geometry - Intuitive, Discrete, and Convex : A Tribute to László Fejes Tóth / / edited by Imre Bárány, Károly Jr. Böröczky, Gábor Fejes Tóth, Janos Pach |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (384 p.) |
| Disciplina | 516 |
| Collana | Bolyai Society Mathematical Studies |
| Soggetto topico |
Discrete mathematics
Convex geometry Discrete geometry Polytopes Topology Discrete Mathematics Convex and Discrete Geometry |
| ISBN | 3-642-41498-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contents -- Preface -- Akiyama, J., Kobayashi, M., Nakagawa, H., Nakamura, G. and Sato, I.: Atoms for Parallelohedra -- Bezdek, K.: Tarski's Plank Problem Revisited -- Bezdek, A. and Kupperbeck, W.: Dense Packing of Space with Various Convex Solids -- Brass, P.: Geometric Problems on Coverage in Sensor Networks -- Gruber, P.M.: Applications of an Idea of Voronoi, a Report -- Grünbaum, B.: Uniform Polyhedrals -- Holmsen, A.F.: Geometric Transversal Theory: T-(3)-families in the Plane -- Montejano, L.: Transversals, Topology and Colorful Geometric Results -- Pach, J. Pálvölgyi, D. and Tóth, G.: Survey on Decomposition of Multiple Coverings -- Schaefer, M.: Hanani-Tutte and Related Results -- Schneider, R.: Extremal Properties of Random Mosaics -- Smorodinsky, S.: Conflict-Free Coloring and its Applications. . |
| Record Nr. | UNINA-9910437876703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers / / edited by Janos Pach
| Graph Drawing [[electronic resource] ] : 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers / / edited by Janos Pach |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Graphics Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Reconfiguring Triangulations with Edge Flips and Point Moves -- Drawing Power Law Graphs -- Hexagonal Grid Drawings: Algorithms and Lower Bounds -- Improved Bounds for the Number of (? k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n -- On the Realizable Weaving Patterns of Polynomial Curves in -- Drawing the AS Graph in 2.5 Dimensions -- Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps -- Convex Drawings of 3-Connected Plane Graphs -- Partitions of Complete Geometric Graphs into Plane Trees -- Additional PC-Tree Planarity Conditions -- GraphML Transformation -- Clustering Cycles into Cycles of Clusters -- Unit Bar-Visibility Layouts of Triangulated Polygons -- Really Straight Graph Drawings -- Layouts of Graph Subdivisions -- Label Number Maximization in the Slider Model -- An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing -- Random Geometric Graph Diameter in the Unit Disk with ? p Metric -- Algorithms for Drawing Media -- Confluent Layered Drawings -- Simultaneous Embedding of Planar Graphs with Few Bends -- A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction -- Contact and Intersection Representations -- Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs -- Graph Drawing by Stress Majorization -- Computing Radial Drawings on the Minimum Number of Circles -- Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem -- Distributed Graph Layout for Sensor Networks -- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm -- Building Blocks of Upward Planar Digraphs -- A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs -- Train Tracks and Confluent Drawings -- The Three Dimensional Logic Engine -- Long Alternating Paths in Bicolored Point Sets -- Intersection Reverse Sequences and Geometric Applications -- New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes -- Drawing Pfaffian Graphs -- 3D Visualization of Semantic Metadata Models and Ontologies -- A Note on the Self-similarity of Some Orthogonal Drawings -- No-Three-in-Line-in-3D -- Visual Navigation of Compound Graphs -- Layout Volumes of the Hypercube -- New Theoretical Bounds of Visibility Representation of Plane Graphs -- Software Demonstrations -- Visualizing Large Graphs with Compound-Fisheye Views and Treemaps -- A Compound Graph Layout Algorithm for Biological Pathways -- Curvilinear Graph Drawing Using the Force-Directed Method -- Graphael: A System for Generalized Force-Directed Layouts -- QUOGGLES: Query On Graphs – A Graphical Largely Extensible System -- Visualisation of Large and Complex Networks Using PolyPlane -- The Metro Map Layout Problem -- An Interactive Multi-user System for Simultaneous Graph Drawing -- Posters -- Gravisto: Graph Visualization Toolkit -- DNA Secondary Structures for Probe Design -- Open Problems Wiki -- Visualization and ILOG CPLEX -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talk -- Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. |
| Record Nr. | UNISA-996466012503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph drawing : 12th international symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004 : revised selected papers / / Janos Pach (ed.)
| Graph drawing : 12th international symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004 : revised selected papers / / Janos Pach (ed.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2004 |
| Descrizione fisica | 1 online resource (XII, 540 p.) |
| Disciplina | 511.5 |
| Altri autori (Persone) | PachJanos |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer graphics
Graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Reconfiguring Triangulations with Edge Flips and Point Moves -- Drawing Power Law Graphs -- Hexagonal Grid Drawings: Algorithms and Lower Bounds -- Improved Bounds for the Number of (? k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n -- On the Realizable Weaving Patterns of Polynomial Curves in -- Drawing the AS Graph in 2.5 Dimensions -- Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps -- Convex Drawings of 3-Connected Plane Graphs -- Partitions of Complete Geometric Graphs into Plane Trees -- Additional PC-Tree Planarity Conditions -- GraphML Transformation -- Clustering Cycles into Cycles of Clusters -- Unit Bar-Visibility Layouts of Triangulated Polygons -- Really Straight Graph Drawings -- Layouts of Graph Subdivisions -- Label Number Maximization in the Slider Model -- An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing -- Random Geometric Graph Diameter in the Unit Disk with ? p Metric -- Algorithms for Drawing Media -- Confluent Layered Drawings -- Simultaneous Embedding of Planar Graphs with Few Bends -- A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction -- Contact and Intersection Representations -- Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs -- Graph Drawing by Stress Majorization -- Computing Radial Drawings on the Minimum Number of Circles -- Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem -- Distributed Graph Layout for Sensor Networks -- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm -- Building Blocks of Upward Planar Digraphs -- A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs -- Train Tracks and Confluent Drawings -- The Three Dimensional Logic Engine -- Long Alternating Paths in Bicolored Point Sets -- Intersection Reverse Sequences and Geometric Applications -- New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes -- Drawing Pfaffian Graphs -- 3D Visualization of Semantic Metadata Models and Ontologies -- A Note on the Self-similarity of Some Orthogonal Drawings -- No-Three-in-Line-in-3D -- Visual Navigation of Compound Graphs -- Layout Volumes of the Hypercube -- New Theoretical Bounds of Visibility Representation of Plane Graphs -- Software Demonstrations -- Visualizing Large Graphs with Compound-Fisheye Views and Treemaps -- A Compound Graph Layout Algorithm for Biological Pathways -- Curvilinear Graph Drawing Using the Force-Directed Method -- Graphael: A System for Generalized Force-Directed Layouts -- QUOGGLES: Query On Graphs – A Graphical Largely Extensible System -- Visualisation of Large and Complex Networks Using PolyPlane -- The Metro Map Layout Problem -- An Interactive Multi-user System for Simultaneous Graph Drawing -- Posters -- Gravisto: Graph Visualization Toolkit -- DNA Secondary Structures for Probe Design -- Open Problems Wiki -- Visualization and ILOG CPLEX -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talk -- Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. |
| Altri titoli varianti | GD 2004 |
| Record Nr. | UNINA-9910767571403321 |
| Berlin ; ; New York, : Springer, c2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Thirty essays on geometric graph theory / / Janos Pach, editor
| Thirty essays on geometric graph theory / / Janos Pach, editor |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, : Springer, 2013 |
| Descrizione fisica | 1 online resource (610 p.) |
| Disciplina | 511.5 |
| Altri autori (Persone) | PachJanos |
| Collana | Algorithms and Combinatorics |
| Soggetto topico | Graph theory |
| ISBN |
1-283-93349-7
1-4614-0110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- 1) B. Ábrego - S. Fernández-Merchant - G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?) -- 2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle-free intersection graph -- 3) G. Aloupis - B. Ballinger - S. Collette - S. Langerman - A. Pór - D.R.Wood: Blocking coloured point sets -- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tóth - A. Winslow: Constrained tri-connected planar straight line graphs -- 5) S. Buzaglo - R. Pinchasi - G. Rote: Topological hypergraphs -- 6) J. Cano Vila - L. F. Barba - J. Urrutia - T. Sakai: On edge-disjoint empty triangles of point sets -- 7) J. Cibulka - J. Kynčl - V. Mészáros - R. Stolař - P. Valtr: Universal sets for straight-line embeddings of bicolored graphs -- 8) G. Di Battista - F. Frati: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in small area -- 9) W. Didimo - G. Liotta: The crossing angle resolution in graph drawing -- 10) A. Dumitrescu: Mover problems -- 11) S. Felsner: Rectangle and square representations of planar graphs -- 12) R. Fulek - N. Saeedi - D. Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs -- 13) R. Fulek - M. Pelsmajer - M. Schaefer - D. Štefankovič: Hanani-Tutte, monotone drawings, and level-planarity -- 14) R. Fulek - A. Suk: On disjoint crossing families in geometric graphs -- 15) M. Hoffmann - A. Schulz - M. Sharir - A. Sheffer - Cs. D. Tóth - E. Welzl: Counting plane graphs: flippability and its applications -- 16) F. Hurtado - Cs. D. Tóth: Geometric graph augmentation: a generic perspective -- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice -- 18) Gy. Károlyi: Ramsey-type problems for geometric graphs -- 19) Ch. Keller - M. Perles - E. Rivera-Campo - V. Urrutia-Galicia: Blockers for non-crossing spanning trees in complete geometric graphs -- 20) A. V. Kostochka - K. G. Milans: Coloring clean and K_4-free circle graphs -- 21) F. Morić - D. Pritchard: Counting large distances in convex polygons: a computational approach -- 22) A. Raigorodskii: Coloring distance graphs and graphs of diameters -- 23) M. Schaefer: Realizability of graphs and linkages -- 24) C. Smyth: Equilateral sets in l_dp -- 25) A. Suk: A note on geometric 3-hypergraphs -- 26) K. Swanepoel: Favourite distances in high dimensions -- 27) M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey -- 28) G. Tardos: Construction of locally plane graphs with many edges -- 29) G. Tóth: A better bound for the pair-crossing number -- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs. |
| Altri titoli varianti | 30 essays on geometric graph theory |
| Record Nr. | UNINA-9910438154003321 |
| New York, : Springer, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Towards a theory of geometric graphs / / Janos Pach, editor
| Towards a theory of geometric graphs / / Janos Pach, editor |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [2004] |
| Descrizione fisica | 1 online resource (xii, 283 p. ) : ill. ; |
| Disciplina | 511/.5 |
| Collana | Contemporary mathematics |
| Soggetto topico | Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
0-8218-7932-4
0-8218-5677-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910480701603321 |
| Providence, Rhode Island : , : American Mathematical Society, , [2004] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Towards a theory of geometric graphs / / Janos Pach, editor
| Towards a theory of geometric graphs / / Janos Pach, editor |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [2004] |
| Descrizione fisica | 1 online resource (xii, 283 p. ) : ill. ; |
| Disciplina | 511/.5 |
| Collana | Contemporary mathematics |
| Soggetto topico | Graph theory |
| ISBN |
0-8218-7932-4
0-8218-5677-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910788666003321 |
| Providence, Rhode Island : , : American Mathematical Society, , [2004] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Towards a theory of geometric graphs / / Janos Pach, editor
| Towards a theory of geometric graphs / / Janos Pach, editor |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , [2004] |
| Descrizione fisica | 1 online resource (xii, 283 p. ) : ill. ; |
| Disciplina | 511/.5 |
| Collana | Contemporary mathematics |
| Soggetto topico | Graph theory |
| ISBN |
0-8218-7932-4
0-8218-5677-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910817973003321 |
| Providence, Rhode Island : , : American Mathematical Society, , [2004] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||