The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Refinements to nearest-neighbor searching in k-dimensional trees (Q802864) (← links)
- Optimal algorithms for adjacent side routing (Q802877) (← links)
- Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
- On sorting triangles in a Delaunay tessellation (Q802898) (← links)
- Order-k Voronoi diagrams of sites with additive weights in the plane (Q802900) (← links)
- Efficient simulated annealing on fractal energy landscapes (Q805499) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Parallel sorting on Cayley graphs (Q807014) (← links)
- A strongly competitive randomized paging algorithm (Q808246) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Chain packing in graphs (Q808291) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- Stochastic neural networks (Q810379) (← links)
- Simulated annealing type algorithms for multivariate optimization (Q810383) (← links)
- Near-linear time approximation algorithms for curve simplification (Q818650) (← links)
- Approximation algorithms for a \(k\)-line center (Q818652) (← links)
- The \(k\)-splittable flow problem (Q818654) (← links)
- Constructing plane spanners of bounded degree and low weight (Q818655) (← links)
- Optimal terrain construction problems and applications in intensity-modulated radiation therapy (Q818658) (← links)
- A comparison of multicast pull models (Q818661) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- A linear-time algorithm for 7-coloring 1-plane graphs (Q818664) (← links)
- Sparse normalized local alignment (Q818666) (← links)
- Efficient collision detection among moving spheres with unknown trajectories (Q818668) (← links)
- Average case analysis of Gosper's algorithm for a class of urn model inputs (Q818669) (← links)
- Optimal read-once parallel disk scheduling (Q818672) (← links)
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673) (← links)
- Representing trees of higher degree (Q818675) (← links)
- Rooted maximum agreement supertrees (Q818677) (← links)
- Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk (Q818824) (← links)
- Building edge-failure resilient networks (Q818826) (← links)
- Wavelength conversion in all-optical networks with shortest-path routing (Q818828) (← links)
- Improved competitive guarantees for QoS buffering (Q818829) (← links)
- Better alternatives to OSPF routing (Q818835) (← links)
- Effective routing and scheduling in adversarial queueing networks (Q818836) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- Mechanisms for (mis)allocating scientific credit (Q832517) (← links)
- Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
