WALCOM: Algorithms and Computation: 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 – March 2, 2025, Proceedings

Author:   Shin-ichi Nakano ,  Mingyu Xiao
Publisher:   Springer Nature Switzerland AG
Volume:   15411
ISBN:  

9789819628445


Pages:   426
Publication Date:   22 February 2025
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $168.16 Quantity:  
Add to Cart

Share |

WALCOM: Algorithms and Computation: 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 – March 2, 2025, Proceedings


Add your own review!

Overview

Full Product Details

Author:   Shin-ichi Nakano ,  Mingyu Xiao
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Volume:   15411
ISBN:  

9789819628445


ISBN 10:   981962844
Pages:   426
Publication Date:   22 February 2025
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Parameterized Voter Relevance in Facility Location Games with Tree Shaped Invitation Graphs.- Proportionally dense subgraphs parameterized hardness and efficiently solvable cases.- Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons.- On the approximability of graph visibility problems.- Algorithms for the Collaborative Delivery Problem with Monitored Constraints.- A Piecewise Approach for the Analysis of Exact Algorithms.- Parameterized Complexity of (d,r) Domination via Modular Decomposition.- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs.- Evaluating Monotone Circuits on Surfaces.- Ranking and Unranking of the Planar Embeddings of a Planar Graph.- Optimal Uniform Shortest Path Sampling.- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata.- Popularity on the 3D-Euclidean Stable Roommates.- Independent Set Reconfiguration Under Bounded Hop Token Jumping.- Approximation algorithms for non-sequential star packing problems.- Reconfiguration Using Generalized Token Jumping.- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems.- Min Sum Disjoint Paths on Subclasses of Chordal Graphs.- Maximize the Rightmost Digit Gray Codes for Restricted Growth Strings.- NP Completeness and Physical Zero Knowledge Proofs for Zeiger.- Abelian and stochastic sandpile models on complete bipartite graphs.- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules.- A Unified Model of Congestion Games with Priorities Two Sided Markets with Ties, Finite and Non Affine Delay Functions, and Pure Nash Equilibria.- Dag like unit refutations in UTVPI Constraint Systems.- Online Contention Resolution Schemes for Size stochastic Knapsacks.- The Connected k Vertex One Center Problem on Graphs.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List