The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- Program size and temperature in self-assembly (Q494811) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- On minimum sum of radii and diameters clustering (Q494937) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Resilient dynamic programming (Q513272) (← links)
- An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Tight bounds for active self-assembly using an insertion primitive (Q513280) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287) (← links)
- Revenue and reserve prices in a probabilistic single item auction (Q513288) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- A polynomial time approximation scheme for the closest shared center problem (Q513292) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- A grouping approach for succinct dynamic dictionary matching (Q513298) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Fast prefix adders for non-uniform input arrival times (Q513308) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- Substring range reporting (Q517792) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Opaque sets (Q517796) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Switching to directional antennas with constant increase in radius and hop distance (Q517801) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- On minimum witnesses for Boolean matrix multiplication (Q517804) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Evaluation of monotone DNF formulas (Q521804) (← links)
