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.
Discrete mathematics and applications
| Discrete mathematics and applications |
| Pubbl/distr/stampa | Utrecht, the Netherlands, : VSP, ©1991- |
| Disciplina | 511.105 |
| Soggetto topico |
Computer science - Mathematics
Mathematics Informatique - Mathématiques Mathématiques Discrete Mathematics Russia |
| Soggetto genere / forma | Periodicals. |
| ISSN | 1569-3929 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Discrete mathematics and its applications |
| Record Nr. | UNISA-996231335003316 |
| Utrecht, the Netherlands, : VSP, ©1991- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete mathematics and applications
| Discrete mathematics and applications |
| Pubbl/distr/stampa | Utrecht, the Netherlands, : VSP, ©1991- |
| Disciplina | 511.105 |
| Soggetto topico |
Computer science - Mathematics
Mathematics Informatique - Mathématiques Mathématiques Discrete Mathematics Russia |
| Soggetto genere / forma | Periodicals. |
| ISSN | 1569-3929 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Discrete mathematics and its applications |
| Record Nr. | UNINA-9910449254803321 |
| Utrecht, the Netherlands, : VSP, ©1991- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete mathematics and applications
| Discrete mathematics and applications |
| Pubbl/distr/stampa | Utrecht, the Netherlands, : VSP, ©1991- |
| Disciplina | 511.105 |
| Soggetto topico |
Computer science - Mathematics
Mathematics Informatique - Mathématiques Mathématiques Discrete Mathematics Russia |
| Soggetto genere / forma | Periodicals. |
| ISSN | 1569-3929 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Discrete mathematics and its applications |
| Record Nr. | UNINA-9910799266303321 |
| Utrecht, the Netherlands, : VSP, ©1991- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete Mathematics with Graph Theory [[electronic resource] /] / by Santosh Kumar Yadav
| Discrete Mathematics with Graph Theory [[electronic resource] /] / by Santosh Kumar Yadav |
| Autore | Yadav Santosh Kumar |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (XX, 648 p. 265 illus.) |
| Disciplina | 511.1 |
| Soggetto topico |
Discrete mathematics
Graph theory Discrete Mathematics Graph Theory Applications of Discrete Mathematics |
| ISBN | 3-031-21321-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preliminaries -- The languages of Sets -- Basic Combinatorics -- Mathematical Logic -- Relations -- Functions -- Lattice Theory -- Boolean Algebra and Applications -- Fuzzy Algebra -- Formal Languages and Automata Theory -- The Basics of Graph Theory -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Coloring of Graphs. . |
| Record Nr. | UNINA-9910735090703321 |
Yadav Santosh Kumar
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Drawing Graphs [[electronic resource] ] : Methods and Models / / edited by Michael Kaufmann, Dorothea Wagner
| Drawing Graphs [[electronic resource] ] : Methods and Models / / edited by Michael Kaufmann, Dorothea Wagner |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 318 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Algorithms Computer science—Mathematics Computer graphics Combinatorics Information technology Business—Data processing Discrete Mathematics Algorithm Analysis and Problem Complexity Mathematics of Computing Computer Graphics IT in Business |
| ISBN | 3-540-44969-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Drawing and Its Applications -- Drawing Planar Graphs -- Drawing Trees, Series-Parallel Digraphs, and Lattices -- Drawing on Physical Analogies -- Layered Drawings of Digraphs -- Orthogonal Graph Drawing -- 3D Graph Drawing -- Drawing Clusters and Hierarchies -- Dynamic Graph Drawing -- Map Labeling with Application to Graph Drawing -- Software Packages. |
| Record Nr. | UNINA-9910145795403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Drawing Graphs [[electronic resource] ] : Methods and Models / / edited by Michael Kaufmann, Dorothea Wagner
| Drawing Graphs [[electronic resource] ] : Methods and Models / / edited by Michael Kaufmann, Dorothea Wagner |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 318 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Algorithms Computer science—Mathematics Computer graphics Combinatorics Information technology Business—Data processing Discrete Mathematics Algorithm Analysis and Problem Complexity Mathematics of Computing Computer Graphics IT in Business |
| ISBN | 3-540-44969-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Drawing and Its Applications -- Drawing Planar Graphs -- Drawing Trees, Series-Parallel Digraphs, and Lattices -- Drawing on Physical Analogies -- Layered Drawings of Digraphs -- Orthogonal Graph Drawing -- 3D Graph Drawing -- Drawing Clusters and Hierarchies -- Dynamic Graph Drawing -- Map Labeling with Application to Graph Drawing -- Software Packages. |
| Record Nr. | UNISA-996466064303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher
| Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (IX, 439 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science—Mathematics Discrete mathematics Algorithms Numerical analysis Programming Techniques Mathematics of Computing Discrete Mathematics Mathematical Applications in Computer Science Numerical Analysis |
| ISBN | 3-642-03456-X |
| Classificazione |
DAT 003f
DAT 530f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models of Computation and Complexity -- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge -- On Negations in Boolean Networks -- The Lovász Local Lemma and Satisfiability -- Kolmogorov-Complexity Based on Infinite Computations -- Pervasive Theory of Memory -- Introducing Quasirandomness to Computer Science -- Sorting and Searching -- Reflections on Optimal and Nearly Optimal Binary Search Trees -- Some Results for Elementary Operations -- Maintaining Ideally Distributed Random Search Trees without Extra Space -- A Pictorial Description of Cole’s Parallel Merge Sort -- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction -- Combinatorial Optimization with Applications -- Algorithms for Energy Saving -- Minimizing Average Flow-Time -- Integer Linear Programming in Computational Biology -- Via Detours to I/O-Efficient Shortest Paths -- Computational Geometry and Geometric Graphs -- The Computational Geometry of Comparing Shapes -- Finding Nearest Larger Neighbors -- Multi-core Implementations of Geometric Algorithms -- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension -- On Map Labeling with Leaders -- The Crossing Number of Graphs: Theory and Computation -- Algorithm Engineering, Exactness, and Robustness -- Algorithm Engineering – An Attempt at a Definition -- Of What Use Is Floating-Point Arithmetic in Computational Geometry? -- Car or Public Transport—Two Worlds -- Is the World Linear? -- In Praise of Numerical Computation -- Much Ado about Zero -- Polynomial Precise Interval Analysis Revisited. |
| Record Nr. | UNISA-996465631403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher
| Efficient Algorithms [[electronic resource] ] : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday / / edited by Susanne Albers, Helmut Alt, Stefan Näher |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (IX, 439 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science—Mathematics Discrete mathematics Algorithms Numerical analysis Programming Techniques Mathematics of Computing Discrete Mathematics Mathematical Applications in Computer Science Numerical Analysis |
| ISBN | 3-642-03456-X |
| Classificazione |
DAT 003f
DAT 530f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Models of Computation and Complexity -- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge -- On Negations in Boolean Networks -- The Lovász Local Lemma and Satisfiability -- Kolmogorov-Complexity Based on Infinite Computations -- Pervasive Theory of Memory -- Introducing Quasirandomness to Computer Science -- Sorting and Searching -- Reflections on Optimal and Nearly Optimal Binary Search Trees -- Some Results for Elementary Operations -- Maintaining Ideally Distributed Random Search Trees without Extra Space -- A Pictorial Description of Cole’s Parallel Merge Sort -- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction -- Combinatorial Optimization with Applications -- Algorithms for Energy Saving -- Minimizing Average Flow-Time -- Integer Linear Programming in Computational Biology -- Via Detours to I/O-Efficient Shortest Paths -- Computational Geometry and Geometric Graphs -- The Computational Geometry of Comparing Shapes -- Finding Nearest Larger Neighbors -- Multi-core Implementations of Geometric Algorithms -- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension -- On Map Labeling with Leaders -- The Crossing Number of Graphs: Theory and Computation -- Algorithm Engineering, Exactness, and Robustness -- Algorithm Engineering – An Attempt at a Definition -- Of What Use Is Floating-Point Arithmetic in Computational Geometry? -- Car or Public Transport—Two Worlds -- Is the World Linear? -- In Praise of Numerical Computation -- Much Ado about Zero -- Polynomial Precise Interval Analysis Revisited. |
| Record Nr. | UNINA-9910484157203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Euclidean Distance Geometry [[electronic resource] ] : An Introduction / / by Leo Liberti, Carlile Lavor
| Euclidean Distance Geometry [[electronic resource] ] : An Introduction / / by Leo Liberti, Carlile Lavor |
| Autore | Liberti Leo |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 133 p. 60 illus., 31 illus. in color.) |
| Disciplina | 514.3 |
| Collana | Springer Undergraduate Texts in Mathematics and Technology |
| Soggetto topico |
Convex geometry
Discrete geometry Mathematical optimization Computer science—Mathematics Algorithms Discrete mathematics Convex and Discrete Geometry Discrete Optimization Discrete Mathematics in Computer Science Discrete Mathematics |
| ISBN | 3-319-60792-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- 1. Motivation -- 2. The Distance Geometry Problem -- 3. Realizing Complete Graphs -- 4. Discretizability -- 5. Molecular Distance Geometry Problems -- 6.Vertex Orders -- 7. Flexibility and Rigidity -- 8. Approximate Realizations -- 9. Taking DG Further -- Appendix A. Mathematical Notions. |
| Record Nr. | UNINA-9910254302503321 |
|
Liberti Leo
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Eulerian Numbers [[electronic resource] /] / by T. Kyle Petersen
| Eulerian Numbers [[electronic resource] /] / by T. Kyle Petersen |
| Autore | Petersen T. Kyle |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 456 p. 78 illus., 4 illus. in color.) |
| Disciplina | 511.6 |
| Collana | Birkhäuser Advanced Texts Basler Lehrbücher |
| Soggetto topico |
Combinatorics
Topology Number theory Group theory Discrete mathematics Number Theory Group Theory and Generalizations Discrete Mathematics |
| ISBN | 1-4939-3091-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Eulerian Numbers -- Narayana Numbers -- Partially Ordered Sets -- Gamma-nonnegativity -- Weak Order, Hyperplane Arrangements, and the Tamari Lattice -- Refined Enumeration -- Simplicial Complexes -- Barycentric Subdivision -- Coxeter Groups -- W-Narayana Numbers -- Cubes, Carries, and an Amazing Matrix -- Characterizing f-vectors -- Combinatorics for Coxeter groups of Types Bn and Dn -- Affine Descents and the Steinberg Torus -- Hints and Solutions. |
| Record Nr. | UNINA-9910300255403321 |
|
Petersen T. Kyle
|
||
| New York, NY : , : Springer New York : , : Imprint : Birkhäuser, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
