Longest increasing subsequences in sliding windows
Theoretical Computer Science
A linear space algorithm for computing a longest common increasing subsequence
Information Processing Letters
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
Longest increasing subsequences in windows based on canonical antichain partition
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Neighbourhood Counting Metric for Sequences
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
A fast algorithm for computing a longest common increasing subsequence
Information Processing Letters
Tracking code patterns over multiple software versions with Herodotos
Proceedings of the 9th International Conference on Aspect-Oriented Software Development
On a conjecture on Wiener indices in combinatorial chemistry
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
New algorithms for efficient parallel string comparison
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Fast computation of a longest increasing subsequence and application
Information and Computation
Parallel longest increasing subsequences in scalable time and memory
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Faster algorithms for computing longest common increasing subsequences
Journal of Discrete Algorithms
Longest common subsequences in permutations and maximum cliques in circle graphs
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Faster algorithms for computing longest common increasing subsequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Finding longest increasing and common subsequences in streaming data
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient algorithms for finding a longest common increasing subsequence
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Longest increasing subsequences in windows based on canonical antichain partition
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A CGM algorithm solving the longest increasing subsequence problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Computing a longest increasing subsequence of length k in time O(n log log k)
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Journal of Discrete Algorithms
Hi-index | 0.89 |