The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Capacitated domination problem (Q534769) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Selfish bin packing (Q534779) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- Testing periodicity (Q534782) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- On centralized smooth scheduling (Q534791) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- Fitting a step function to a point set (Q547281) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy (Q547283) (← links)
- Better and simpler approximation algorithms for the stable marriage problem (Q547284) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Testing convexity properties of tree colorings (Q547293) (← links)
- Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
- On word equations in one variable (Q547296) (← links)
- Detecting regular visit patterns (Q547297) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Average rate speed scaling (Q547302) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- The directed orienteering problem (Q547309) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- Sweeping points (Q548657) (← links)
- Knowledge state algorithms (Q548658) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- Special issue: European symposium on algorithms, design and analysis. Selected papers based on the presentations at the track A (Design and analysis) of ESA 2009: The 17th annual European symposium on algorithms, Copenhagen, Danmark, September 7--9, 2009. (Q551518) (← links)
- A time bound on the materialization of some recursively defined views (Q578941) (← links)
- A monotonic projective algorithm for fractional linear programming (Q580191) (← links)
- A modification of Karmarkar's linear programming algorithm (Q581231) (← links)
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- An improved parallel algorithm for integer GCD (Q582082) (← links)
