The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Efficient Randomized Algorithms for the Repeated Median Line Estimator (Q96586) (← links)
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes (Q134868) (← links)
- FIST: Fast Industrial-Strength Triangulation of Polygons (Q137824) (← links)
- Isotonic Regression via Partitioning (Q152638) (← links)
- One-variable word equations in linear time (Q261339) (← links)
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Space-efficient substring occurrence estimation (Q261345) (← links)
- A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Online bin packing with advice (Q261387) (← links)
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- Backdoors to q-Horn (Q261394) (← links)
- The focus of attention problem (Q262243) (← links)
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- How to allocate goods in an online market? (Q262246) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- The complexity of separating points in the plane (Q262254) (← links)
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- The two-handed tile assembly model is not intrinsically universal (Q262271) (← links)
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- Anonymous meeting in networks (Q262278) (← links)
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- New approximation results for resource replication problems (Q270001) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Optimal encodings for range majority queries (Q270016) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
