Kalpesh Kapoor

Available identifiers

Publication	Date of Publication	Type
The length of the longest sequence of consecutive FS-double squares in a word	2024-03-07	Paper
The square density of words having a sequence of FS-double squares	2023-11-13	Paper
Density of distinct squares in non-primitive words	2023-06-05	Paper
On Complete S-Reachable Graphs	2022-04-19	Paper
Characterization of dense patterns having distinct squares	2022-03-24	Paper
Weighted approximate parameterized string matching	2017-10-13	Paper
Ins-Robust Primitive Words	2017-07-04	Paper
On del-robust primitive words	2016-05-02	Paper
On the language of primitive partial words	2016-04-08	Paper
On reachability in graphs with obstacles	2016-02-22	Paper
Motion planning in Cartesian product graphs	2014-05-16	Paper
Fine-tuning decomposition theorem for maximum weight bipartite matching	2014-04-16	Paper
On multiset of factors of a word	2013-03-20	Paper
On \(m\)RJ reachability in trees	2013-01-24	Paper
Mutant hierarchies support selective mutation	2012-04-24	Paper
Fine-grained concurrency with separation logic	2012-03-09	Paper
Formal Approaches to Software Testing	2005-12-02	Paper

This page was built for person: Kalpesh Kapoor