Subset sum is a very old and fundamental problem in theoretical computer...
We consider the classic 1-center problem: Given a set P of n points in a...
Longest common subsequence (𝖫𝖢𝖲) is a classic and central problem
in com...
In this work, we study longest common substring, pattern matching, and
w...
In this paper, we provide new approximation algorithms for dynamic varia...
We study dynamic algorithms for the longest increasing subsequence
(LIS)...
In this note, we present a substantial improvement on the computational
...
Longest common substring (LCS), longest palindrome substring (LPS), and ...
Longest common subsequence (LCS) is one of the most fundamental problems...
Simulated annealing is an effective and general means of optimization. I...
The edit distance (ED) and longest common subsequence (LCS) are two
fund...
The edit distance (ED) and longest common subsequence (LCS) are two
fund...
We study distributed algorithms for string matching problem in presence ...
We study the computational complexity of finding Stackelberg Equilibria ...
Despite persistent efforts, there is no known technique for obtaining
un...
Distributed processing frameworks, such as MapReduce, Hadoop, and Spark ...
The Colonel Blotto game, first introduced by Borel in 1921, is a well-st...
The knapsack problem is a fundamental problem in combinatorial
optimizat...
The edit distance between two strings is defined as the smallest number ...