EUVIMED · CrossrefJournal
ACM Transactions on Algorithms
ISSN 1549-6325 · Association for Computing Machinery (ACM)
Latest articles
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
Testing Cluster Structure of Graphs
On Parallel k -Center Clustering
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
Incremental Approximate Maximum Flow via Residual Graph Sparsification
Strong Approximations and Irrationality in Financial Networks with Derivatives
Tight Streaming Lower Bounds for Deterministic Approximate Counting
Prophet Secretary and Matching: the Significance of the Largest Item
Faster Algorithms for Longest Common Substring
Fast and Small Subsampled R-indexes
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures
On the Complexity of Symmetric vs. Functional PCSPs
Scalable High-Quality Hypergraph Partitioning
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs
Fast and Perfect Sampling of Subgraphs and Polymer Systems
Synchronized Planarity with Applications to Constrained Planarity Problems
A Faster Algorithm for Finding Tarski Fixed Points
Rapid Mixing from Spectral Independence beyond the Boolean Domain
Max Flows in Planar Graphs with Vertex Capacities
Better Distance Preservers and Additive Spanners
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Ramsey Spanning Trees and Their Applications
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
Online Vertex-Weighted Bipartite Matching
Faster Pseudopolynomial Time Algorithms for Subset Sum
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
The Simplex Algorithm Is NP-Mighty
Data Structures for Weighted Matching and Extensions to b -matching and f -factors
EUVIMED