[go: up one dir, main page]
Skip to main content
Springer Nature Link
Account

WALCOM: Algorithms and Computation

18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings

  • Conference proceedings
  • © 2024

Overview

Editors:
  1. Ryuhei Uehara

    1. Japan Advanced Institute of Science and Technology, Nomi, Japan

  2. Katsuhisa Yamanaka

    1. Iwate University, Morioka, Japan

  3. Hsu-Chun Yen

    1. National Taiwan University, Taipei, Taiwan

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14549)

Included in the following conference series:

Conference proceedings info: WALCOM 2024.

  • 13k Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook EUR 67.40
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 84.39
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.


Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (30 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Recent Research Activities on Algorithmic Foundations for Social Advancement

    • Shin-ichi Minato
    Pages 1-8

  3. Reasons to Fall (More) in Love with Combinatorial Reconfiguration

    • Naomi Nishimura
    Pages 9-14

  4. Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle

    • Csaba D. Tóth
    Pages 15-31

  5. Quantum Graph Drawing [Best Student Paper]

    • Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
    Pages 32-46

  6. Simultaneous Drawing of Layered Trees

    • Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink
    Pages 47-61

  7. Fully Dynamic Algorithms for Euclidean Steiner Tree

    • T-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue
    Pages 62-75

  8. The Parameterized Complexity of Terminal Monitoring Set

    • N. R. Aravind, Roopam Saxena
    Pages 76-90

  9. Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words

    • Dennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im
    Pages 91-102

  10. On the Hardness of Gray Code Problems for Combinatorial Objects

    • Arturo Merino, Namrata, Aaron Williams
    Pages 103-117

  11. On MAX–SAT with Cardinality Constraint

    • Fahad Panolan, Hannane Yaghoubizade
    Pages 118-133

  12. Minimizing Corners in Colored Rectilinear Grids

    • Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms
    Pages 134-148

  13. On Layered Area-Proportional Rectangle Contact Representations

    • Carolina Haase, Philipp Kindermann
    Pages 149-162

  14. Short Flip Sequences to Untangle Segments in the Plane

    • Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
    Pages 163-178

  15. Improved Approximation Algorithms for Cycle and Path Packings

    • Jingyang Zhao, Mingyu Xiao
    Pages 179-193

  16. Exact and Approximate Hierarchical Hub Labeling

    • Ruoying Li, Sabine Storandt
    Pages 194-211

  17. Reconfiguration of Multisets with Applications to Bin Packing

    • Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura
    Pages 212-226

  18. The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules

    • Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou
    Pages 227-241

  19. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis

    • Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara
    Pages 242-256

  20. A Bisection Approach to Subcubic Maximum Induced Matching

    • Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan
    Pages 257-272
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • Japan Advanced Institute of Science and Technology, Nomi, Japan

    Ryuhei Uehara

  • Iwate University, Morioka, Japan

    Katsuhisa Yamanaka

  • National Taiwan University, Taipei, Taiwan

    Hsu-Chun Yen

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top