Pages that link to "Item:Q1219686"

The following pages link to On computing the length of longest increasing subsequences (Q1219686):

Displaying 50 items.

• Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
• On compressing permutations and adaptive sorting (Q391981) (← links)
• Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
• A note on adaptive parallel sorting (Q582114) (← links)
• Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
• Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
• The longest almost-increasing subsequence (Q765507) (← links)
• Computing a longest common subsequence for a set of strings (Q786541) (← links)
• A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
• On the longest increasing subsequence of a circular list (Q845894) (← links)
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
• New algorithms for the LCS problem (Q1072704) (← links)
• Another look at the ''longest ascending subsequence'' problem (Q1154283) (← links)
• New clique and independent set algorithms for circle graphs (Q1186158) (← links)
• How good is the information theory bound in sorting? (Q1226391) (← links)
• Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
• Hiding points in arrangements of segments (Q1356667) (← links)
• Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
• Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
• The dual diameter of triangulations (Q1699295) (← links)
• The longest commonly positioned increasing subsequences problem (Q1702817) (← links)
• Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
• Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
• Representing point sets on the plane as permutations (Q2059910) (← links)
• Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
• Fast and longest rollercoasters (Q2118392) (← links)
• Computing the longest common almost-increasing subsequence (Q2166775) (← links)
• Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
• A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
• On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
• The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage (Q2327630) (← links)
• Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
• Longest increasing subsequences in windows based on canonical antichain partition (Q2371801) (← links)
• A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
• Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
• On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
• Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
• Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
• Empirical scaling of the length of the longest increasing subsequences of random walks (Q2969875) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• Rollercoasters and Caterpillars (Q5002684) (← links)
• (Q5090479) (← links)
• (Q5111874) (← links)
• (Q5140763) (← links)
• Ruler Wrapping (Q6173213) (← links)