WALCOM: Algorithms and Computation
Springer Nature Switzerland AG (Verlag)
978-981-96-2844-5 (ISBN)
- Titel nicht im Sortiment
- Artikel merken
The 26 full papers were carefully reviewed and selected from 68 submissions. WALCOM 2025 covered a wide range of topics, including approximation algorithms, algorithmic graph theory and combinatorics, algorithmic and combinatorial aspects of logic, combinatorial algorithms, combinatorial optimization, combinatorial reconfiguration, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms and complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
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.
| Erscheinungsdatum | 19.03.2025 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | 61 Illustrations, color; 47 Illustrations, black and white |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| Schlagworte | Algorithmic game theory and mechanism design • approximation algorithms analysis • computational complexity and cryptography • Computational Geometry • Discrete Structures • graph algorithms analysis • Logic • Mathematical Optimization • Models of Computation • parallel and distributed algorithms • parameterized complexity and exact algorithms • randomness |
| ISBN-10 | 981-96-2844-X / 981962844X |
| ISBN-13 | 978-981-96-2844-5 / 9789819628445 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
