The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Synthetic sequence design for signal location search (Q378252) (← links)
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- Efficient two-stage group testing algorithms for genetic screening (Q378260) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Special issue: Algorithm design and analysis. Selected papers based on the presentations at the 18th European symposium on Algorithms (ESA), Liverpool, UK, September 6--8, 2010. (Q429709) (← links)
- Special issue: Parametrized and exact computation. Part I. Selected papers based on the presentations at the international symposium (IPEC 2010), Chennai, India, December 13--15, 2010. (Q431504) (← links)
- Is submodularity testable? (Q472463) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Counting or producing all fixed cardinality transversals (Q472469) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Analysis of agglomerative clustering (Q472480) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Cache-oblivious hashing (Q472489) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Computing the throughput of probabilistic and replicated streaming applications (Q472492) (← links)
- Multikey quickselect (Q472494) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Emergency connectivity in ad-hoc networks with selfish nodes (Q476427) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Speed scaling on parallel processors (Q476431) (← links)
- An optimal lower bound for buffer management in multi-queue switches (Q476433) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- The complexity of the empire colouring problem (Q476435) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Fast sequential importance sampling to estimate the graph reliability polynomial (Q476443) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Online square packing with gravity (Q476449) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
