9 citations · 10 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Hardness of Approximation of (Multi-)LCS over Small Alphabet
Amey Bhangale, Diptarka Chakraborty, Rajendra Kumar
The problem of finding longest common subsequence (LCS) is one of the fundamental problems in computer science, which finds application in fields such as computational biology, tex…
cs.CC2015★ 1 cited
Simultaneous Time-Space Upper Bounds for Certain Problems in Planar Graphs
Diptarka Chakraborty, Raghunath Tewari
In this paper, we show that given a weighted, directed planar graph , and any , there exists a polynomial time and space algorithm that computes the…