Combinatorial Algorithms: 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings: Lecture Notes in Computer Science, cartea 14764
Editat de Adele Anna Rescigno, Ugo Vaccaroen Limba Engleză Paperback – 22 iun 2024
The 40 full papers included in this book were carefully reviewed and selected from 110 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1061.55 lei - 20%
Preț: 307.71 lei - 20%
Preț: 438.69 lei - 20%
Preț: 579.30 lei -
Preț: 410.88 lei - 17%
Preț: 427.22 lei - 20%
Preț: 596.46 lei - 15%
Preț: 448.04 lei - 20%
Preț: 353.50 lei -
Preț: 389.49 lei - 20%
Preț: 309.90 lei - 20%
Preț: 645.28 lei - 20%
Preț: 763.23 lei - 15%
Preț: 580.46 lei - 20%
Preț: 310.28 lei - 20%
Preț: 655.02 lei - 20%
Preț: 1183.14 lei - 20%
Preț: 340.32 lei -
Preț: 449.57 lei - 20%
Preț: 591.51 lei - 18%
Preț: 938.83 lei - 20%
Preț: 337.00 lei - 20%
Preț: 649.50 lei - 20%
Preț: 607.40 lei - 20%
Preț: 1414.79 lei - 20%
Preț: 1024.44 lei - 20%
Preț: 583.40 lei - 20%
Preț: 453.32 lei - 20%
Preț: 575.49 lei - 20%
Preț: 1075.26 lei - 20%
Preț: 585.88 lei - 20%
Preț: 825.93 lei - 17%
Preț: 360.20 lei - 20%
Preț: 763.23 lei - 20%
Preț: 340.32 lei - 20%
Preț: 504.58 lei - 20%
Preț: 369.13 lei - 20%
Preț: 580.93 lei - 20%
Preț: 343.62 lei - 20%
Preț: 350.21 lei - 20%
Preț: 583.40 lei - 20%
Preț: 583.40 lei - 15%
Preț: 438.59 lei - 20%
Preț: 341.95 lei - 20%
Preț: 238.01 lei - 20%
Preț: 538.30 lei
Preț: 466.81 lei
Preț vechi: 549.19 lei
-15% Nou
Puncte Express: 700
Preț estimativ în valută:
89.34€ • 92.92$ • 73.75£
89.34€ • 92.92$ • 73.75£
Carte tipărită la comandă
Livrare economică 14-28 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031630200
ISBN-10: 3031630203
Ilustrații: XXII, 538 p. 132 illus., 55 illus. in color.
Dimensiuni: 155 x 235 mm
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031630203
Ilustrații: XXII, 538 p. 132 illus., 55 illus. in color.
Dimensiuni: 155 x 235 mm
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
- On computing sets of integers with maximum number of pairs summing to powers of 2.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.