WALCOM: Algorithms and Computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 – March 2, 2025, Proceedings /
This book LNCS 15411 constitutes the refereed proceedings of the 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, held in Chengdu, China, during February 28 – March 2, 2025. The 26 full papers were carefully reviewed and selected from 68 submissions. WALCOM 202...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Electrònic eBook |
| Idioma: | anglès |
| Publicat: |
Singapore :
Springer Nature Singapore : Imprint: Springer,
2025.
|
| Edició: | 1st ed. 2025. |
| Col·lecció: | Lecture Notes in Computer Science,
15411 |
| Matèries: | |
| Accés en línia: | https://doi.org/10.1007/978-981-96-2845-2 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Taula de continguts:
- 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.