Algorithms and Computation [[electronic resource] ] : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XIV, 362 p. 107 illus.) |
Disciplina | 005.1 |
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 |
Soggetto genere / forma |
Kongress2014.Chennai
Kongress2013.Kharagpur (West Bengal) Conference papers and proceedings. |
ISBN | 3-319-04657-8 |
Classificazione |
DAT 530f
SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.- Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings. |
Record Nr. | UNISA-996205183403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Computation : 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings / / edited by Sudebkumar Prasant Pal, Kunihiko Sadakane |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XIV, 362 p. 107 illus.) |
Disciplina | 005.1 |
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 |
Soggetto genere / forma |
Kongress2014.Chennai
Kongress2013.Kharagpur (West Bengal) Conference papers and proceedings. |
ISBN | 3-319-04657-8 |
Classificazione |
DAT 530f
SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computational Geometry -- Algorithms and Approximations -- Distributed Computing and Networks.- Graph Algorithms -- Complexity and Bounds -- Graph Embeddings and Drawings. |
Record Nr. | UNINA-9910483901203321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
String Processing and Information Retrieval [[electronic resource] ] : 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings / / edited by Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 273 p. 58 illus.) |
Disciplina | 025.04 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Database management Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery Database Management |
ISBN | 3-319-46049-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Fundamental studies of string processes and information retrieval -- Applications in bioinformatics -- Applications in Web mining -- Applications in other areas. |
Record Nr. | UNISA-996465985903316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
String Processing and Information Retrieval : 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings / / edited by Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 273 p. 58 illus.) |
Disciplina | 025.04 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Database management Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery Database Management |
ISBN | 3-319-46049-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Fundamental studies of string processes and information retrieval -- Applications in bioinformatics -- Applications in Web mining -- Applications in other areas. |
Record Nr. | UNINA-9910484643703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
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 |
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 | ||
|