000 | 05412nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-981-97-0566-5 | ||
003 | DE-He213 | ||
005 | 20240730171429.0 | ||
007 | cr nn 008mamaa | ||
008 | 240228s2024 si | s |||| 0|eng d | ||
020 |
_a9789819705665 _9978-981-97-0566-5 |
||
024 | 7 |
_a10.1007/978-981-97-0566-5 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aWALCOM: Algorithms and Computation _h[electronic resource] : _b18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings / _cedited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen. |
250 | _a1st ed. 2024. | ||
264 | 1 |
_aSingapore : _bSpringer Nature Singapore : _bImprint: Springer, _c2024. |
|
300 |
_aXIII, 438 p. 93 illus., 73 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14549 |
|
505 | 0 | _aRecent 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. | |
520 | _aThis 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. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer graphics. _94088 |
|
650 | 0 |
_aInformation technology _xManagement. _95368 |
|
650 | 1 | 4 |
_aTheory of Computation. _998523 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
650 | 2 | 4 |
_aComputer Graphics. _94088 |
650 | 2 | 4 |
_aComputer Application in Administrative Data Processing. _931588 |
700 | 1 |
_aUehara, Ryuhei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _998526 |
|
700 | 1 |
_aYamanaka, Katsuhisa. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _998528 |
|
700 | 1 |
_aYen, Hsu-Chun. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _998530 |
|
710 | 2 |
_aSpringerLink (Online service) _998532 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9789819705658 |
776 | 0 | 8 |
_iPrinted edition: _z9789819705672 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14549 _923263 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-981-97-0566-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c87578 _d87578 |