WALCOM: Algorithms and Computation: Lecture Notes in Computer Science
Editat de Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liottaen Limba Engleză Paperback – 19 feb 2023
The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 390.18 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 461.77 lei - 20%
Preț: 527.36 lei - 20%
Preț: 497.04 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.14 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.06 lei - 20%
Preț: 390.69 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 390.35 lei - 20%
Preț: 391.20 lei - 20%
Preț: 392.64 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.72 lei - 20%
Preț: 461.65 lei - 20%
Preț: 462.05 lei - 15%
Preț: 388.50 lei - 5%
Preț: 516.27 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 535.77 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 400.17 lei - 20%
Preț: 403.00 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 490.96 lei
Preț vechi: 613.71 lei
-20% Nou
Puncte Express: 736
Preț estimativ în valută:
86.86€ • 101.20$ • 75.85£
86.86€ • 101.20$ • 75.85£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031270505
ISBN-10: 3031270509
Pagini: 412
Ilustrații: XIII, 398 p. 106 illus., 49 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1st edition 2023
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031270509
Pagini: 412
Ilustrații: XIII, 398 p. 106 illus., 49 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1st edition 2023
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Invited Talks.- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult.- The Family of Fan-planar Graphs.- Computational Geometry.- Minimum Ply Covering of Points with Unit Squares.- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms.- Flipping Plane Spanning Paths.- Away from Each Other.- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.- Reflective Guarding a Gallery.- Improved and Generalized Algorithms for Burning a Planar Point Set.- On the Longest Flip Sequence to Untangle Segments in the Plane.- String Algorithm.-Inferring Strings from Position Heaps in Linear Time.- Internal Longest Palindrome Queries in Optimal Time.- Finding the Cyclic Covers of a String.- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.- Optimization.- Better Hardness Results for the Minimum Spanning Tree Congestion
Problem.- Energy Efficient Sorting, Selection and Searching.- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs.- k-Transmitter Watchman Routes.- Graph Algorithm.- Splitting Plane Graphs to Outerplanarity.- Certifying Induced Subgraphs in Large Graphs.- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.- On the Complexity of Distance-d Independent Set Reconfiguration.- On Star-multi-interval Pairwise Compatibility Graphs.- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration.- Parameterized Complexity of Path Set Packing.- Approximation Algorithm.- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput.- Recognizing When a Preference System Is Close to Admitting a Master List.- Groups Burning: Analyzing Spreading Processes in Community-based Networks.- Roman k-domination:Hardness, Approximation and Parameterized Results.- Parameterized Complexity.- On the Parameterized Complexity of Compact Set Packing.- Structural Parameterization of Cluster Deletion.- Parity Permutation Pattern Matching.