The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- A new algorithm for the largest empty rectangle problem (Q582097) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- On the benefits of adaptivity in property testing of dense graphs (Q603911) (← links)
- Slow mixing of Markov chains using fault lines and fat contours (Q603913) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On robustness of forward-looking in sponsored search auction (Q603916) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- Maintaining equilibria during exploration in sponsored search auctions (Q603920) (← links)
- Gaming prediction markets: equilibrium strategies with a market maker (Q603926) (← links)
- A sequential algorithm for generating random graphs (Q603928) (← links)
- Special issue: Latin American theoretical informatics (LATIN 2008). Selected papers based on the presentations at the 8th conference, Buzios, Rio de Janeiro, Brazil, April 2008. (Q624759) (← links)
- Random 2 XORSAT phase transition (Q627513) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Quantum property testing of group solvability (Q627520) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- Origami embedding of piecewise-linear two-manifolds (Q627524) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544) (← links)
- Finding total unimodularity in optimization problems solved by linear programs (Q627545) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Precision, local search and unimodal functions (Q633830) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns (Q633835) (← links)
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded (Q633837) (← links)
- Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments (Q633840) (← links)
- Special issue: Theory of evolutionary computation. Selected papers based on the presentations at the PPSN 2008, 10th international conference on parallel problem solving from nature, September 13--17, 2008, Dortmund, Germany, and the international confere (Q633841) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Competitive algorithms for due date scheduling (Q633847) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- Special issue: European symposium on algorithms. Selected papers based on the presentations at the 16th annual symposium (ESA 2008), Karlsruhe, Germany, September 15--17, 2008. (Q633863) (← links)
- Piercing translates and homothets of a convex body (Q634671) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Maximum flow in directed planar graphs with vertex capacities (Q634675) (← links)
