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.
WALCOM: Algorithms and Computation [[electronic resource] ] : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
| WALCOM: Algorithms and Computation [[electronic resource] ] : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XIII, 350 p. 140 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Data Structures and Information Theory Mathematics of Computing Artificial Intelligence |
| ISBN | 3-030-39881-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms. |
| Record Nr. | UNISA-996418205403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
| WALCOM: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XIII, 350 p. 140 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Data Structures and Information Theory Mathematics of Computing Artificial Intelligence |
| ISBN | 3-030-39881-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms. |
| Record Nr. | UNINA-9910373927803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
| WALCOM: Algorithms and Computation [[electronic resource] ] : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XX, 265 p. 37 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-319-75172-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465303703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
| WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XX, 265 p. 37 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-319-75172-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910349460303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
| WALCOM: Algorithms and Computation [[electronic resource] ] : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXIV, 336 p. 110 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
| ISBN | 3-319-15612-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. |
| Record Nr. | UNISA-996198744003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita
| WALCOM: Algorithms and Computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / / edited by M. Sohel Rahman, Etsuji Tomita |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXIV, 336 p. 110 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Symbolic and Algebraic Manipulation Computer Graphics |
| ISBN | 3-319-15612-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs. |
| Record Nr. | UNINA-9910484540503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||