| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA990002080220203316 |
|
|
Autore |
CARDARELLI, Ferruccio |
|
|
Titolo |
Da Oriani al Fascismo : critica letteraria e politica / Ferruccio Cardelli |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Bologna : Cappelli, [1921?] |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Collocazione |
|
320.54 CAR 1 (ISP II 232) |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNISA996391377903316 |
|
|
Titolo |
[These ben the ordynau[n]ces, that the emperour hath caused to be red and declared in his presence, to thestates of his countrees of those partyes at theyr assemblynge to his magestye the .vii. day of Octobre, the yere of our Lorde .M.V.C.xxxi. ... ] [[electronic resource]] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
[London], : [Imprynted by me Robert wyer, dwellynge at the sygne of saynt Ioh[a]n Eua[n]gelyst, i[n] saynt Martyns parysshe in the bysshop of Norwytche rentes besyde charynge Crosse, [1532?]] |
|
|
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Altri autori (Persone) |
|
Charles, Holy Roman Emperor, <1500-1558.> |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from STC. |
Printer's name and adress from colophon; publication date conjectured by STC. |
Formerly STC 5015. |
Identified as STC 5016 on UMI microfilm. |
Imperfect as filmed: title page lacking. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Reproduction of the original in the Bodleian Library. |
|
|
|
|
|
|
Sommario/riassunto |
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910767571403321 |
|
|
Titolo |
Graph Drawing : 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers / / edited by Janos Pach |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
|
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 540 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3383 |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science - Mathematics |
Discrete mathematics |
Algorithms |
Computer graphics |
Artificial intelligence - Data processing |
Discrete Mathematics in Computer Science |
Computer Graphics |
Data Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
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 DimensionalLogic 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. |
|
|
|
|
|
| |