Algorithms and Complexity [E-Book] : 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings / edited by Marios Mavronicolas.
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13-16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all...
Saved in:
Full text |
|
Personal Name(s): | Mavronicolas, Marios, editor |
Edition: |
1st edition 2023. |
Imprint: |
Cham :
Springer,
2023
|
Physical Description: |
XI, 400 pages 90 illustrations, 45 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783031304484 |
DOI: |
10.1007/978-3-031-30448-4 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Lecture Notes in Computer Science ;
13898 |
Subject (LOC): |
- Unifying Gathering Strategies for Swarms of Mobile Robots
- The Complexity of Secure RAMs
- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models
- The power of the Binary Value Principle
- Independent Set under a Change Constraint from an Initial Solution
- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model
- Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time
- How Vulnerable is an Undirected Planar Graph with respect to Max Flow
- Maximum Flows in Parametric Graph Templates
- Dynamic Coloring on Restricted Graph Classes
- Enumeration of Minimal Tropical Connected Sets
- Dynamic Flows with Time-Dependent Capacities
- On One-Sided Testing Affine Subspaces
- Stable Scheduling in Transactional Memory
- Parameterizing Path Partitions
- Maintaining Triconnected Components under Node Expansion
- Approximating Power Node-Deletion Problems
- Phase transition in count approximation by Count-Min sketch with conservative updates
- Minimum-link ´ $C$-Oriented Paths Visiting a Sequence of Regions in the Plane
- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
- Broadcasting in Split Graphs
- Partitioning Subclasses of Chordal Graphs with Few Deletions
- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
- Improved Deterministic Leader Election in Diameter-Two Networks
- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues
- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves
- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree
- Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models.