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.
Algorithms and Data Structures [[electronic resource] ] : 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia
| Algorithms and Data Structures [[electronic resource] ] : 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 492 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Algorithms Data structures (Computer science) Numerical analysis Computer graphics Programming Techniques Theory of Computation Algorithm Analysis and Problem Complexity Data Structures Numeric Computing Computer Graphics |
| ISBN | 3-540-44634-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 - Invited Talk -- Approximation of Multiobjective Optimization Problems -- Session 2A -- Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs -- Optimal Möbius Transformations for Information Visualization and Meshing -- Session 2B -- Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming -- On the Complexity of Scheduling Conditional Real-Time Code -- Session 3A -- Time Responsive External Data Structures for Moving Points -- Voronoi Diagrams for Moving Disks and Applications -- Session 3B -- Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover -- Deciding Clique-Width for Graphs of Bounded Tree-Width -- Session 4A -- Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions -- Optimization over Zonotopes and Training Support Vector Machines -- Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions -- Session 4B -- Seller-Focused Algorithms for Online Auctioning -- Competitive Analysis of the LRFU Paging Algorithm -- Admission Control to Minimize Rejections -- Session 5 - Invited Talk -- Secure Multi-party Computational Geometry -- Session 6A -- The Grid Placement Problem -- On the Reflexivity of Point Sets -- Session 6B -- A 7/8-Approximation Algorithm for Metric Max TSP -- Approximating Multi-objective Knapsack Problems -- Session 7A -- Visual Ranking of Link Structures -- A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs -- Session 7B -- Short and Simple Labels for Small Distances and Other Functions -- Fast Boolean Matrix Multiplication for Highly Clustered Data -- Session 8A -- Partitioning Colored Point Sets into Monochromatic Parts -- The Analysis of a Probabilistic Approach to Nearest Neighbor Searching -- I/O-Efficient Shortest Path Queries in Geometric Spanners -- Session 8B -- Higher-Dimensional Packing with Order Constraints -- Bin Packing with Item Fragmentation -- Practical Approximation Algorithms for Separable Packing Linear Programs -- Session 9 - Invited Talk -- The Challenges of Delivering Content on the Internet -- Session 10A -- Upward Embeddings and Orientations of Undirected Planar Graphs -- An Approach for Mixed Upward Planarization -- Session 10B -- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study -- Computing Phylogenetic Roots with Bounded Degrees and Errors -- Session 11A -- A Decomposition-Based Approach to Layered Manufacturing -- When Can You Fold a Map? -- Session 11B -- Search Trees with Relaxed Balance and Near-Optimal Height -- Succinct Dynamic Data Structures -- Session 12A -- Optimal Algorithms for Two-Guard Walkability of Simple Polygons -- Movement Planning in the Presence of Flows -- Session 12B -- Small Maximal Independent Sets and Faster Exact Graph Coloring -- On External-Memory Planar Depth First Search. |
| Record Nr. | UNISA-996465804103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures : 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia
| Algorithms and Data Structures : 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings / / edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 492 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Algorithms Data structures (Computer science) Numerical analysis Computer graphics Programming Techniques Theory of Computation Algorithm Analysis and Problem Complexity Data Structures Numeric Computing Computer Graphics |
| ISBN | 3-540-44634-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1 - Invited Talk -- Approximation of Multiobjective Optimization Problems -- Session 2A -- Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs -- Optimal Möbius Transformations for Information Visualization and Meshing -- Session 2B -- Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming -- On the Complexity of Scheduling Conditional Real-Time Code -- Session 3A -- Time Responsive External Data Structures for Moving Points -- Voronoi Diagrams for Moving Disks and Applications -- Session 3B -- Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover -- Deciding Clique-Width for Graphs of Bounded Tree-Width -- Session 4A -- Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions -- Optimization over Zonotopes and Training Support Vector Machines -- Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions -- Session 4B -- Seller-Focused Algorithms for Online Auctioning -- Competitive Analysis of the LRFU Paging Algorithm -- Admission Control to Minimize Rejections -- Session 5 - Invited Talk -- Secure Multi-party Computational Geometry -- Session 6A -- The Grid Placement Problem -- On the Reflexivity of Point Sets -- Session 6B -- A 7/8-Approximation Algorithm for Metric Max TSP -- Approximating Multi-objective Knapsack Problems -- Session 7A -- Visual Ranking of Link Structures -- A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs -- Session 7B -- Short and Simple Labels for Small Distances and Other Functions -- Fast Boolean Matrix Multiplication for Highly Clustered Data -- Session 8A -- Partitioning Colored Point Sets into Monochromatic Parts -- The Analysis of a Probabilistic Approach to Nearest Neighbor Searching -- I/O-Efficient Shortest Path Queries in Geometric Spanners -- Session 8B -- Higher-Dimensional Packing with Order Constraints -- Bin Packing with Item Fragmentation -- Practical Approximation Algorithms for Separable Packing Linear Programs -- Session 9 - Invited Talk -- The Challenges of Delivering Content on the Internet -- Session 10A -- Upward Embeddings and Orientations of Undirected Planar Graphs -- An Approach for Mixed Upward Planarization -- Session 10B -- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study -- Computing Phylogenetic Roots with Bounded Degrees and Errors -- Session 11A -- A Decomposition-Based Approach to Layered Manufacturing -- When Can You Fold a Map? -- Session 11B -- Search Trees with Relaxed Balance and Near-Optimal Height -- Succinct Dynamic Data Structures -- Session 12A -- Optimal Algorithms for Two-Guard Walkability of Simple Polygons -- Movement Planning in the Presence of Flows -- Session 12B -- Small Maximal Independent Sets and Faster Exact Graph Coloring -- On External-Memory Planar Depth First Search. |
| Record Nr. | UNINA-9910143592203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings / / edited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia
| Algorithms and Data Structures [[electronic resource] ] : 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings / / edited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 481 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Computer graphics Theory of Computation Programming Techniques Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-69422-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Discrepancy theory and computational geometry -- Dynamic motion planning in low obstacle density environments -- Visibility-based pursuit-evasion in a polygonal environment -- Maintaining the extent of a moving point set -- Finding cores of limited length -- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem -- Approximation algorithms for a genetic diagnostics problem -- Cartographic line simplication and polygon CSG formulae in O(n log* n) time -- Constrained TSP and low-power computing -- On-line load balancing for related machines -- A linear-time algorithm for the 1-mismatch problem -- On some geometric optimization problems in layered manufacturing -- New TSP construction heuristics and their relationships to the 2-opt -- Pattern matching in hypertext -- Multiple approximate string matching -- Applied computational geometry — Abstract -- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) -- Voronoi diagrams for polygon-offset distance functions -- Randomized algorithms for that ancient scheduling problem -- Optimal parallel algorithms for proximate points, with applications -- An efficient algorithm for shortest paths in vertical and horizontal segments -- On geometric path query problems -- On-line scheduling with hard deadlines -- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access -- Parallel vs. parametric complexity -- Position-independent near optimal searching and on-line recognition in star polygons -- Dynamic data structures for fat objects and their applications -- Intractability of assembly sequencing: Unit disks in the plane -- On hamiltonian triangulations in simple polygons (Extended Abstract) -- Computing orthogonal drawings with the minimum number of bends -- On a simple depth-first search strategy for exploring unknown graphs -- Orthogonal drawing of high degree graphs with small area and few bends -- A centroid labelling technique and its application to path selection in trees -- Offset-polygon annulus placement problems -- Computing constrained minimum-width annuli of point sets -- Geometric Applications of Posets -- Constructing pairwise disjoint paths with few links -- Trans-dichotomous algorithms without multiplication — some upper and lower bounds -- An approximation algorithm for stacking up bins from a conveyer onto pallets -- Relaxed balance through standard rotations -- Efficient breakout routing in printed circuit boards -- Planarity, revisited (extended abstract). |
| Record Nr. | UNINA-9910144921303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings / / edited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia
| Algorithms and Data Structures [[electronic resource] ] : 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings / / edited by Frank Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 481 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Algorithms Data structures (Computer science) Computer science—Mathematics Computer graphics Theory of Computation Programming Techniques Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-69422-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Discrepancy theory and computational geometry -- Dynamic motion planning in low obstacle density environments -- Visibility-based pursuit-evasion in a polygonal environment -- Maintaining the extent of a moving point set -- Finding cores of limited length -- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem -- Approximation algorithms for a genetic diagnostics problem -- Cartographic line simplication and polygon CSG formulae in O(n log* n) time -- Constrained TSP and low-power computing -- On-line load balancing for related machines -- A linear-time algorithm for the 1-mismatch problem -- On some geometric optimization problems in layered manufacturing -- New TSP construction heuristics and their relationships to the 2-opt -- Pattern matching in hypertext -- Multiple approximate string matching -- Applied computational geometry — Abstract -- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) -- Voronoi diagrams for polygon-offset distance functions -- Randomized algorithms for that ancient scheduling problem -- Optimal parallel algorithms for proximate points, with applications -- An efficient algorithm for shortest paths in vertical and horizontal segments -- On geometric path query problems -- On-line scheduling with hard deadlines -- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access -- Parallel vs. parametric complexity -- Position-independent near optimal searching and on-line recognition in star polygons -- Dynamic data structures for fat objects and their applications -- Intractability of assembly sequencing: Unit disks in the plane -- On hamiltonian triangulations in simple polygons (Extended Abstract) -- Computing orthogonal drawings with the minimum number of bends -- On a simple depth-first search strategy for exploring unknown graphs -- Orthogonal drawing of high degree graphs with small area and few bends -- A centroid labelling technique and its application to path selection in trees -- Offset-polygon annulus placement problems -- Computing constrained minimum-width annuli of point sets -- Geometric Applications of Posets -- Constructing pairwise disjoint paths with few links -- Trans-dichotomous algorithms without multiplication — some upper and lower bounds -- An approximation algorithm for stacking up bins from a conveyer onto pallets -- Relaxed balance through standard rotations -- Efficient breakout routing in printed circuit boards -- Planarity, revisited (extended abstract). |
| Record Nr. | UNISA-996465508903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994. Proceedings / / edited by Roberto Tamassia, Ioannis G. Tollis
| Graph Drawing [[electronic resource] ] : DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994. Proceedings / / edited by Roberto Tamassia, Ioannis G. Tollis |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (CDLXXXVIII, 478 p.) |
| Disciplina | 006.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Discrete mathematics Algorithms Combinatorics Software engineering Computer graphics Computer Applications Discrete Mathematics Algorithm Analysis and Problem Complexity Software Engineering Computer Graphics |
| ISBN | 3-540-49155-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Three-dimensional graph drawing -- 3-D visualization of program information (extended abstract and system demonstration) -- 3D layout of reachability graphs of communicating processes -- A flow approach to upward drawings of toroidal maps -- Improved algorithms and bounds for orthogonal drawings -- On bend-minimum orthogonal upward drawing of directed planar graphs -- Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract) -- On drawing a graph convexly in the plane (extended abstract) -- On drawing angle graphs -- Regular edge labelings and drawings of planar graphs -- Minimum-width grid drawings of plane graphs extend abstract -- Regular orientations, arboricity, and augmentation -- The polyhedral approach to the maximum planar subgraph problem: New chances for related problems -- Crossing numbers of graphs, lower bound techniques and algorithms: A survey -- Graph-drawing contest report -- Visibility graphs and oriented matroids (extended abstract) -- Rectangle-visibility representations of bipartite graphs -- On the number of directions in visibility representations of graphs (extended abstract) -- Directed VR-representable graphs have unbounded dimension -- GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo) -- Graph layout through the VCG tool -- Drawing telecommunication networks -- Reduction of visual complexity in dynamic graphs -- TOSCANA — A graphical tool for analyzing and exploring data -- Characterization and recognition of point-halfspace and related orders -- Redrawing a graph within a geometric tolerance -- On the difficulty of embedding planar graphs with inaccuracies -- A system for drawing graphs with geometric symmetry -- Demonstration of the interactive graph visualization system da Vinci -- CG: A graph drawing system using graph-grammar parsing -- A demonstration of interactive graph based visual language applications -- A simple algorithm for drawing large graphs on small screens -- Molecular graph eigenvectors for molecular coordinates -- On the computational complexity of upward and rectilinear planarity testing -- Upward planarity testing of outerplanar dags (extended abstract) -- Optimal-area upward drawings of AVL trees -- Upward drawing on the plane grid using less ink -- Proximity drawability: A survey extended abstract -- Proximity constraints and representable trees (extended abstract) -- Recognizing rectangle of influence drawable graphs (extended abstract) -- A simple and unified method for drawing graphs: Magnetic-spring algorithm -- Integration of declarative and algorithmic approaches for layout creation -- A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration) -- Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract) -- Designing graph drawings by layout graph grammars -- Encoding presentation emphasis algorithms for graphs -- A practical approach to static node positioning -- Map generalization as a graph drawing problem -- A geometrical heuristic for drawing concept lattices -- Poster gallery report. |
| Record Nr. | UNISA-996466094003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||