The meeting graph: a new model for loop cyclic register allocation
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
Proceedings of the sixth annual international conference on Computational biology
Complexity aspects of two-dimensional data compression
Nordic Journal of Computing
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Longest increasing subsequences in sliding windows
Theoretical Computer Science
Longest increasing subsequences in windows based on canonical antichain partition
Theoretical Computer Science
Efficiently implementing maximum independent set algorithms on circle graphs
Journal of Experimental Algorithmics (JEA)
An output sensitive algorithm for computing a maximum independent set of a circle graph
Information Processing Letters
The longest almost-increasing subsequence
Information Processing Letters
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The longest almost-increasing subsequence
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Sparse RNA folding: Time and space efficient algorithms
Journal of Discrete Algorithms
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Longest common subsequences in permutations and maximum cliques in circle graphs
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Longest increasing subsequences in windows based on canonical antichain partition
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.05 |