Atjaunināt sīkdatņu piekrišanu

WALCOM: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 1820, 2024, Proceedings 2024 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 438 pages, height x width: 235x155 mm, 73 Illustrations, color; 20 Illustrations, black and white; XIII, 438 p. 93 illus., 73 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 14549
  • Izdošanas datums: 29-Feb-2024
  • Izdevniecība: Springer Nature
  • ISBN-10: 9819705657
  • ISBN-13: 9789819705658
  • Mīkstie vāki
  • Cena: 73,68 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 86,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
WALCOM: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation,  WALCOM 2024, Kanazawa, Japan, March 1820, 2024, Proceedings 2024 ed.
  • Formāts: Paperback / softback, 438 pages, height x width: 235x155 mm, 73 Illustrations, color; 20 Illustrations, black and white; XIII, 438 p. 93 illus., 73 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 14549
  • Izdošanas datums: 29-Feb-2024
  • Izdevniecība: Springer Nature
  • ISBN-10: 9819705657
  • ISBN-13: 9789819705658

This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18–20, 2024.

The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.


Recent Research Activities on Algorithmic Foundations for Social
Advancement.- Reasons to Fall (More) in Love with Combinatorial
Reconfiguration.- Plane Multigraphs with One-Bend and Circular-Arc Edges of a
Fixed Angle.- Quantum Graph Drawing.- Simultaneous Drawing of Layered
Trees.- Fully Dynamic Algorithms for Euclidean Steiner Tree.-  The
Parameterized Complexity of Terminal Monitoring Set.- Generating cyclic
2-Gray codes for Fibonacci q-decreasing words.- On the Hardness of Gray Code
Problems for Combinatorial Objects.- On MAXSAT with Cardinality Constraint.-
Minimizing Corners in Colored Rectilinear Grids.- On Layered
Area-Proportional Rectangle Contact Representations.- Short Flip Sequences to
Untangle Segments in the Plane.- Improved Approximation Algorithms for Cycle
and Path Packings.- Exact and Approximate Hierarchical Hub Labeling.-
Reconfiguration of Multisets with Applications to Bin Packing.- The Shortest
Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.-
Combinatorial Reconfiguration with Answer Set Programming: Algorithms,
Encodings, and Empirical Analysis.- A bisection approach to subcubic maximum
induced matching.- Stable and Dynamic Minimum Cuts.- Black Hole Search in
Dynamic Cactus Graph.- Recognition and Isomorphism of Proper H-graphs for
unicyclic H in FPT-time.- Canonization of a random circulant graph by
counting walks.- Counting Vanishing Matrix-Vector Products.- Efficient
Enumeration of Drawings and Combinatorial Structures for Maximal Planar
Graphs.- (t,s)-completely Independent Spanning Trees.- Orientable Burning
Number of Graphs.- Dichotomies for Tree Minor Containment with Structural
Parameters.- Structural Parameterizations of Vertex Integrity.- On the
Complexity of List H-Packing for Sparse Graph Classes.