Buch, Englisch, 438 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 680 g
18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
Buch, Englisch, 438 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 680 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-981-97-0565-8
Verlag: Springer Nature Singapore
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik EDV | Informatik Angewandte Informatik
Weitere Infos & Material
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 MAX?SAT 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.
