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.
Combinatorial geometry and graph theory : Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003 : revised selected papers / / Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.)
| Combinatorial geometry and graph theory : Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003 : revised selected papers / / Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (VIII, 227 p.) |
| Disciplina | 516/.13 |
| Altri autori (Persone) |
AkiyamaJ
BaskoroEdy Tri KanoMikio <1949-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial geometry
Graph theory |
| ISBN |
3-540-30540-8
3-540-24401-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One. |
| Altri titoli varianti | IJCCGGT 2003 |
| Record Nr. | UNINA-9910483030203321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers / / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.)
| Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers / / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (VIII, 213 p.) |
| Disciplina | 516/.11 |
| Altri autori (Persone) |
AkiyamaJ
KanoMikio <1949-> TanXuehou |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial geometry
Geometry - Data processing |
| ISBN |
3-540-32089-X
3-540-30467-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Matching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Vertex-Unfolding Orthostacks -- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem -- Tight Time Bounds for the Minimum Local Convex Partition Problem -- I/O-Efficiently Pruning Dense Spanners -- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons -- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon -- Wedges in Euclidean Arrangements -- Visual Pascal Configuration and Quartic Surface -- Nonexistence of 2-Reptile Simplices -- Single-Vertex Origami and Spherical Expansive Motions -- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms -- Crossing Stars in Topological Graphs -- The Geometry of Musical Rhythm. |
| Altri titoli varianti | JCDCG 2004 |
| Record Nr. | UNINA-9910484985903321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete and Computational Geometry, Graphs, and Games [[electronic resource] ] : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
| Discrete and Computational Geometry, Graphs, and Games [[electronic resource] ] : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (196 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer graphics
Computer science Computer science—Mathematics Data structures (Computer science) Information theory Computer Graphics Theory of Computation Mathematics of Computing Data Structures and Information Theory |
| ISBN | 3-030-90048-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Geometric Graphs on Point Sets in the Plane -- The Two-distance Sets in Dimension Four -- Negative Instance for the Edge Patrolling Beacon Problem -- Global Location-Domination in the Join and Cartesian Product of Graphs -- The Metric Dimension of the Join of Paths and Cycles -- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes -- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey -- On Structural Parameterizations of Node Kayles -- Robustness in power-law kinetic systems with reactant-determined interactions -- Toward Unfolding Doubly Covered n-Stars -- Crystallographic Flat Origami from n-Uniform Tilings -- Packing Cube Nets into Rectangles with O(1) Holes -- On the Complexity of Jelly-no-Puzzle -- Computational Complexity of Two Pencil Puzzles. |
| Record Nr. | UNISA-996464386103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete and Computational Geometry, Graphs, and Games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
| Discrete and Computational Geometry, Graphs, and Games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (196 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer graphics
Computer science Computer science—Mathematics Data structures (Computer science) Information theory Computer Graphics Theory of Computation Mathematics of Computing Data Structures and Information Theory |
| ISBN | 3-030-90048-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Geometric Graphs on Point Sets in the Plane -- The Two-distance Sets in Dimension Four -- Negative Instance for the Edge Patrolling Beacon Problem -- Global Location-Domination in the Join and Cartesian Product of Graphs -- The Metric Dimension of the Join of Paths and Cycles -- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes -- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey -- On Structural Parameterizations of Node Kayles -- Robustness in power-law kinetic systems with reactant-determined interactions -- Toward Unfolding Doubly Covered n-Stars -- Crystallographic Flat Origami from n-Uniform Tilings -- Packing Cube Nets into Rectangles with O(1) Holes -- On the Complexity of Jelly-no-Puzzle -- Computational Complexity of Two Pencil Puzzles. |
| Record Nr. | UNINA-9910508477603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete Geometry, Combinatorics and Graph Theory [[electronic resource] ] : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu
| Discrete Geometry, Combinatorics and Graph Theory [[electronic resource] ] : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (297 p.) |
| Disciplina | 516/.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer graphics Algorithms Artificial intelligence—Data processing Convex geometry Discrete geometry Discrete Mathematics in Computer Science Computer Graphics Data Science Convex and Discrete Geometry |
| ISBN |
1-280-93576-6
9786610935765 3-540-70666-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Infinite Series of Generalized Gosper Space Filling Curves -- Contractible Edges in a k-Connected Graph -- An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs -- On the Choice Numbers of Some Complete Multipartite Graphs -- On Convex Quadrangulations of Point Sets on the Plane -- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs -- Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order -- A Neighborhood Condition for Graphs to Have [a, b]-Factors III -- General Balanced Subdivision of Two Sets of Points in the Plane -- Coverage Problem of Wireless Sensor Networks -- Some Topics on Edge-Coloring -- Hamiltonicity of Complements of Total Graphs -- Isolated Toughness and Existence of f-Factors -- A Note on the Integrity of Middle Graphs -- Indecomposable Coverings -- The Decycling Number of Cubic Planar Graphs -- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs -- Rotational Steiner Ratio Problem Under Uniform Orientation Metrics -- Two Classes of Simple MCD Graphs -- Core Stability of Flow Games -- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs -- Three Classes of Bipartite Integral Graphs -- Reconfirmation of Two Results on Disjoint Empty Convex Polygons -- The Binding Number of a Digraph -- The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph -- Fractional Vertex Arboricity of Graphs -- Fitting Triangles into Rectangles -- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs -- On the Upper Chromatic Numbers of Mixed Interval Hypertrees -- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs. |
| Record Nr. | UNISA-996465507703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete Geometry, Combinatorics and Graph Theory : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu
| Discrete Geometry, Combinatorics and Graph Theory : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (297 p.) |
| Disciplina | 516/.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer graphics Algorithms Artificial intelligence—Data processing Convex geometry Discrete geometry Discrete Mathematics in Computer Science Computer Graphics Data Science Convex and Discrete Geometry |
| ISBN |
1-280-93576-6
9786610935765 3-540-70666-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Infinite Series of Generalized Gosper Space Filling Curves -- Contractible Edges in a k-Connected Graph -- An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs -- On the Choice Numbers of Some Complete Multipartite Graphs -- On Convex Quadrangulations of Point Sets on the Plane -- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs -- Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order -- A Neighborhood Condition for Graphs to Have [a, b]-Factors III -- General Balanced Subdivision of Two Sets of Points in the Plane -- Coverage Problem of Wireless Sensor Networks -- Some Topics on Edge-Coloring -- Hamiltonicity of Complements of Total Graphs -- Isolated Toughness and Existence of f-Factors -- A Note on the Integrity of Middle Graphs -- Indecomposable Coverings -- The Decycling Number of Cubic Planar Graphs -- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs -- Rotational Steiner Ratio Problem Under Uniform Orientation Metrics -- Two Classes of Simple MCD Graphs -- Core Stability of Flow Games -- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs -- Three Classes of Bipartite Integral Graphs -- Reconfirmation of Two Results on Disjoint Empty Convex Polygons -- The Binding Number of a Digraph -- The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph -- Fractional Vertex Arboricity of Graphs -- Fitting Triangles into Rectangles -- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs -- On the Upper Chromatic Numbers of Mixed Interval Hypertrees -- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs. |
| Record Nr. | UNINA-9910483905803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||