Pages that link to "Item:Q294846"

The following pages link to Enumerating longest increasing subsequences and patience sorting (Q294846):

Displaying 24 items.

• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
• Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
• A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
• A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
• A review of metrics on permutations for search landscape analysis (Q878593) (← links)
• Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
• Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
• Longest increasing subsequences in sliding windows (Q1885912) (← 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)
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
• Fast and longest rollercoasters (Q2118392) (← links)
• A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
• Co-divergence and tree topology (Q2315220) (← links)
• On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
• Longest increasing subsequences in windows based on canonical antichain partition (Q2371801) (← links)
• Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• (Q5090479) (← links)
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems (Q5140142) (← links)
• Longest increasing subsequence under persistent comparison errors (Q5916089) (← links)
• The longest almost increasing subsequence problem with sliding windows (Q6562878) (← links)
• Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)