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 Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
| Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XX, 766 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-49696-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. |
| Record Nr. | UNINA-9910484314703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du
| Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 1190 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Computer networks Theory of Computation Programming Techniques Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks |
| ISBN | 3-540-32426-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465545203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du
| Algorithms and Computation [[electronic resource] ] : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings / / edited by Xiaotie Deng, Dingzhu Du |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XX, 1190 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Computer networks Theory of Computation Programming Techniques Numerical Analysis Discrete Mathematics in Computer Science Computer Communication Networks |
| ISBN | 3-540-32426-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484526303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNINA-9910736011703321 |
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNISA-996542665403316 |
|
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings / / edited by Anna Lubiw, Mohammad Salavatipour, Meng He
| Algorithms and Data Structures [[electronic resource] ] : 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings / / edited by Anna Lubiw, Mohammad Salavatipour, Meng He |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (687 pages) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science - Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-030-83508-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2π/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane—local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs. |
| Record Nr. | UNINA-9910494560003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings / / edited by Anna Lubiw, Mohammad Salavatipour, Meng He
| Algorithms and Data Structures [[electronic resource] ] : 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings / / edited by Anna Lubiw, Mohammad Salavatipour, Meng He |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (687 pages) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science - Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-030-83508-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Adjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed Ѳ6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2π/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane—local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs. |
| Record Nr. | UNISA-996464533503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings / / edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour
| Algorithms and Data Structures [[electronic resource] ] : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings / / edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XX, 594 p. 416 illus., 95 illus. in color.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Computer networks Data Science Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer Communication Networks |
| ISBN | 3-030-24766-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graphs in Nature -- Set Similarity - a Survey -- Concurrent Connected Components Algorithms: Recent Results and Open Problems -- Succinct Data Structures for Families of Interval Graphs -- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow -- Efficient Nearest-Neighbor Query and Clustering of Planar Curves -- Positive-Instance Driven Dynamic Programming for Graph Searching -- How to Morph a Tree on a Small Grid -- Approximating the robust bin-packing with budget uncertainty -- Rank-Select Indices Without Tears -- A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs -- A Framework for Vehicle Routing Approximation Schemes in Trees -- Avoidable Vertices and Edges in Graphs -- Plane Hop Spanners for Unit Disk Graphs -- On the Minimum Consistent Subset Problem -- Parameterized Complexity of Conict-free Graph Coloring -- Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy -- Hamiltonicity for convex shape Delaunay and Gabriel graphs -- Computing Maximum Independent Set on Outerstring Graphs and Their Relatives -- Online Bin Covering with Advice -- Stackelberg Packing Games -- Range closest-pair search in higher dimensions -- Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles -- Kernelization of Graph Hamiltonicity: Proper H-Graphs -- Weighted Throughput Maximization with Calibrations -- Maximizing Dominance in the Plane and its Applications -- Extending Upward Planar Graph Drawings -- Online Circle Packing -- Guess Free Maximization of Submodular and Linear Sums -- Efficient Second-Order Shape-Constrained Function Fitting -- Dynamic Online Dictionary Matching -- Balanced Stable Marriage: How Close is Close Enough? -- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint -- Inventory Routing Problem with Facility Location -- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space -- Geometric Firefighting in the Half-plane -- Most vital segment barriers -- Splaying Preorders and Postorders -- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS -- Discrete Morse Theory for Computing Zigzag Persistence -- Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity -- Zip Trees -- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. |
| Record Nr. | UNISA-996466449803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings / / edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour
| Algorithms and Data Structures [[electronic resource] ] : 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings / / edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XX, 594 p. 416 illus., 95 illus. in color.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Computer networks Data Science Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Computer Communication Networks |
| ISBN | 3-030-24766-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graphs in Nature -- Set Similarity - a Survey -- Concurrent Connected Components Algorithms: Recent Results and Open Problems -- Succinct Data Structures for Families of Interval Graphs -- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow -- Efficient Nearest-Neighbor Query and Clustering of Planar Curves -- Positive-Instance Driven Dynamic Programming for Graph Searching -- How to Morph a Tree on a Small Grid -- Approximating the robust bin-packing with budget uncertainty -- Rank-Select Indices Without Tears -- A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs -- A Framework for Vehicle Routing Approximation Schemes in Trees -- Avoidable Vertices and Edges in Graphs -- Plane Hop Spanners for Unit Disk Graphs -- On the Minimum Consistent Subset Problem -- Parameterized Complexity of Conict-free Graph Coloring -- Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy -- Hamiltonicity for convex shape Delaunay and Gabriel graphs -- Computing Maximum Independent Set on Outerstring Graphs and Their Relatives -- Online Bin Covering with Advice -- Stackelberg Packing Games -- Range closest-pair search in higher dimensions -- Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles -- Kernelization of Graph Hamiltonicity: Proper H-Graphs -- Weighted Throughput Maximization with Calibrations -- Maximizing Dominance in the Plane and its Applications -- Extending Upward Planar Graph Drawings -- Online Circle Packing -- Guess Free Maximization of Submodular and Linear Sums -- Efficient Second-Order Shape-Constrained Function Fitting -- Dynamic Online Dictionary Matching -- Balanced Stable Marriage: How Close is Close Enough? -- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint -- Inventory Routing Problem with Facility Location -- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space -- Geometric Firefighting in the Half-plane -- Most vital segment barriers -- Splaying Preorders and Postorders -- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS -- Discrete Morse Theory for Computing Zigzag Persistence -- Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity -- Zip Trees -- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. |
| Record Nr. | UNINA-9910349308303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings / / edited by Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack
| Algorithms and Data Structures [[electronic resource] ] : 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings / / edited by Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XX, 594 p. 129 illus.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks |
| ISBN | 3-319-62127-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorics -- Computational geometry -- Databases -- Graphics -- Parallel and distributed computing. |
| Record Nr. | UNISA-996466295903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Discrete mathematics
(1409)
- Discrete Mathematics in Computer Science (1256)
- Computer science—Mathematics (1213)
- Algorithms (1064)
- Computer science (580)