The following pages link to Journal of Algorithms (Q2709787):
Displaying 50 items.
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions (Q2709794) (← links)
- Efficient Algorithms for Petersen's Matching Theorem (Q2709795) (← links)
- Greedy Local Improvement and Weighted Set Packing Approximation (Q2729651) (← links)
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434) (← links)
- On the Common Substring Alignment Problem (Q2775894) (← links)
- On Bipartite and Multipartite Clique Problems (Q2775896) (← links)
- Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles (Q2775900) (← links)
- The 2-Center Problem with Obstacles (Q2777608) (← links)
- Maximum matchings in general graphs through randomization (Q3031945) (← links)
- The Analysis of Heapsort (Q3141523) (← links)
- Approximation of pathwidth of outerplanar graphs (Q3150282) (← links)
- MAX CUT in cubic graphs (Q3159488) (← links)
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs (Q3333069) (← links)
- NP-complete stable matching problems (Q3485870) (← links)
- NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185) (← links)
- A new upper bound for Shellsort (Q3742727) (← links)
- Single bend wiring (Q3745779) (← links)
- The NP-completeness column: an ongoing guide (Q3747723) (← links)
- A lower bound for probabilistic distributed algorithms (Q3783527) (← links)
- An algorithm for finding hamilton cycles in random directed graphs (Q3790664) (← links)
- Solution to a linear diophantine equation for nonnegative integers (Q3791221) (← links)
- Edge-Coloring Partialk-Trees (Q3837389) (← links)
- A linear-time approximation algorithm for the weighted vertex cover problem (Q3910012) (← links)
- A linear algorithm for computing the visibility polygon from a point (Q3910036) (← links)
- Generating coset representatives for permutation groups (Q3913569) (← links)
- The minimum-length generator sequence problem is NP-hard (Q3920644) (← links)
- Fast solution of toeplitz systems of equations and computation of Padé approximants (Q3930541) (← links)
- A weighted matroid intersection algorithm (Q3942972) (← links)
- Irreducible polynomials with integral coefficients have succinct certificates (Q3951538) (← links)
- An improved algorithm for the rectangle enclosure problem (Q3956420) (← links)
- The Byzantine generals strike again (Q3959472) (← links)
- Maintenance of a minimum spanning forest in a dynamic plane graph (Q3990614) (← links)
- Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains (Q4209262) (← links)
- A Survey of Fast Exponentiation Methods (Q4209277) (← links)
- Graphs with Branchwidth at Most Three (Q4264493) (← links)
- On Rotations and the Generation of Binary Trees (Q4275333) (← links)
- Two Fast GCD Algorithms (Q4289843) (← links)
- Genus g Graphs Have Pagenumber O(√g) (Q4304062) (← links)
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time (Q4304063) (← links)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph (Q4314500) (← links)
- On the Diameter of the Pancake Network (Q4366875) (← links)
- Isomorph-Free Exhaustive Generation (Q4386451) (← links)
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations (Q4538079) (← links)
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082) (← links)
- 3-coloring in time (Q4652410) (← links)
- Building heaps fast (Q4730782) (← links)
- On the average performance of orthogonal range search in multidimensional data structures (Q4799528) (← links)
- A linear time algorithm for scheduling outforests with communication delays on three processors (Q4805397) (← links)
- Polynomial-time approximation schemes for packing and piercing fat objects (Q4808318) (← links)
