EUVIMED · CrossrefZeitschrift
ACM Transactions on Algorithms
ISSN 1549-6325 · Association for Computing Machinery (ACM)
Neueste Artikel
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 and Perfect Sampling of Subgraphs and Polymer Systems
Synchronized Planarity with Applications to Constrained Planarity Problems
A Faster Algorithm for Finding Tarski Fixed Points
Better Distance Preservers and Additive Spanners
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
A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
The Traveling Salesman Problem for Lines, Balls, and Planes
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
Optimal Lower and Upper Bounds for Representing Sequences
Testing Planarity of Partially Embedded Graphs
Constraint Solving via Fractional Edge Covers
Online Optimization with Uncertain Information
All-pairs shortest paths with a sublinear additive error
Succinct indexes for strings, binary relations and multilabeled trees
Clustering for metric and nonmetric distance measures
Low distortion spanners
The priority R-tree
Faster approximation schemes for fractional multicommodity flow problems
EUVIMED