<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>05400nam a22006495i 4500</leader>
  <controlfield tag="001">978-981-97-0566-5</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20251030111451.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">240228s2024    si |    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9789819705665</subfield>
    <subfield code="9">978-981-97-0566-5</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/978-981-97-0566-5</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
    <subfield code="a">QA75.5-76.95</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYA</subfield>
    <subfield code="2">bicssc</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">COM014000</subfield>
    <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYA</subfield>
    <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">WALCOM: Algorithms and Computation</subfield>
    <subfield code="h">[electronic resource] :</subfield>
    <subfield code="b">18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18&#x2013;20, 2024, Proceedings /</subfield>
    <subfield code="c">edited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1st ed. 2024.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Singapore :</subfield>
    <subfield code="b">Springer Nature Singapore :</subfield>
    <subfield code="b">Imprint: Springer,</subfield>
    <subfield code="c">2024.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">XIII, 438 p. 93 illus., 73 illus. in color.</subfield>
    <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14549</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">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&#x2012;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.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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&#x2013;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.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer science.</subfield>
    <subfield code="9">58552</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer science</subfield>
    <subfield code="x">Mathematics.</subfield>
    <subfield code="9">64041</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Discrete mathematics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Numerical analysis.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Algorithms.</subfield>
    <subfield code="9">58677</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer graphics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Information technology</subfield>
    <subfield code="x">Management.</subfield>
    <subfield code="9">57223</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
    <subfield code="a">Theory of Computation.</subfield>
    <subfield code="9">67552</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Discrete Mathematics in Computer Science.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Numerical Analysis.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Design and Analysis of Algorithms.</subfield>
    <subfield code="9">67299</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Computer Graphics.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Computer Application in Administrative Data Processing.</subfield>
    <subfield code="9">66531</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Uehara, Ryuhei.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">72004</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Yamanaka, Katsuhisa.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">72005</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Yen, Hsu-Chun.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">72006</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Springer Nature eBook</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9789819705658</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9789819705672</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">14549</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://doi.org/10.1007/978-981-97-0566-5</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SXCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-LNC</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">57972</subfield>
    <subfield code="d">57972</subfield>
  </datafield>
</record>
