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] ] : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
| WALCOM: Algorithms and Computation [[electronic resource] ] : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-030-68211-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
| Record Nr. | UNISA-996464530003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
| WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-030-68211-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
| Record Nr. | UNINA-9910483831703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| 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] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara
| WALCOM: Algorithms and Computation [[electronic resource] ] : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / / edited by Sandip Das, Ryuhei Uehara |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 408 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Bioinformatics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics Computational and Systems Biology |
| ISBN | 3-642-00202-1 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates. |
| Record Nr. | UNISA-996466023903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||