The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Note on the structure of Kruskal's algorithm (Q848958) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Faster two dimensional scaled matching (Q848963) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- On the longest common rigid subsequence problem (Q848965) (← links)
- Algorithms for the homogeneous set sandwich problem (Q850795) (← links)
- A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths (Q850796) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment (Q850800) (← links)
- Special issue: Selected papers based on the presentations at the `Analysis of algorithms' workshop, Berkely, CA, USA, July 2004. (Q862740) (← links)
- Destruction of very simple trees (Q866949) (← links)
- A local limit theorem in the theory of overpartitions (Q866950) (← links)
- Asymptotics of largest components in combinatorial structures (Q866953) (← links)
- The expected size of the Rule \(k\) dominating set (Q866955) (← links)
- Scalar multiplication on Koblitz curves using the Frobenius endomorphism and its combination with point halving: extensions and mathematical analysis (Q866957) (← links)
- Asymptotics of the moments of extreme-value related distribution functions (Q866958) (← links)
- The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees (Q866959) (← links)
- The average size of giant components between the double-jump (Q866960) (← links)
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees (Q866961) (← links)
- Large deviations for the weighted height of an extended class of trees (Q866962) (← links)
- Optimal coding and sampling of triangulations (Q866963) (← links)
- On the number of \(t\)-ary trees with a given path length (Q866964) (← links)
- Average-case analysis of approximate trie search (Q866965) (← links)
- Left and right pathlengths in random binary trees (Q866966) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q868436) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- Approximation algorithms for the unsplittable flow problem (Q868438) (← links)
- Selfish load balancing and atomic congestion games (Q868439) (← links)
- Deterministic communication in radio networks with large labels (Q868440) (← links)
- R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks (Q870454) (← links)
- Detecting holes and antiholes in graphs (Q870455) (← links)
- Safe reduction rules for weighted treewidth (Q870458) (← links)
- Motorcycle graphs and straight skeletons (Q870459) (← links)
- Power assignment in radio networks with two power levels (Q870460) (← links)
- Special issue: 12th international symposium on graph drawing (GD '04). Selected papers based on the presentations at the symposium, New York, NY, September 29--October 2, 2004. (Q876825) (← links)
- Special issue: An Appol meeting in Bertinoro. Papers based on the presentations at the Appol 2 workshop, Bertinoro, Italy, March 23--28, 2003 (Q877449) (← links)
- A study of integrated document and connection caching in the WWW (Q878433) (← links)
- Call control in rings (Q878435) (← links)
- An algorithmic view on OVSF code assignment (Q878438) (← links)
- Real-time scheduling with a budget (Q878439) (← links)
- Minimizing total flow time and total completion time with immediate dispatching (Q878441) (← links)
- Maximizing the total profit of rectangles packed into a rectangle (Q878442) (← links)
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times (Q878444) (← links)
- Representations by contact and intersection of segments (Q879951) (← links)
- No-three-in-line-in-3D (Q879952) (← links)
- Confluent layered drawings (Q879954) (← links)
- Drawing power law graphs using a local/global decomposition (Q879956) (← links)
- Train tracks and confluent drawings (Q879959) (← links)
