Kalpesh Kapoor
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The length of the longest sequence of consecutive FS-double squares in a word (available as arXiv preprint) | 2024-03-07 | Paper |
| The square density of words having a sequence of FS-double squares Discrete Applied Mathematics | 2023-11-13 | Paper |
| Density of distinct squares in non-primitive words Information Processing Letters | 2023-06-05 | Paper |
| On Complete S-Reachable Graphs Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
| Characterization of dense patterns having distinct squares | 2022-03-24 | Paper |
| Weighted approximate parameterized string matching AKCE International Journal of Graphs and Combinatorics | 2017-10-13 | Paper |
| Ins-Robust Primitive Words | 2017-07-04 | Paper |
| On del-robust primitive words Discrete Applied Mathematics | 2016-05-02 | Paper |
| On the language of primitive partial words Language and Automata Theory and Applications | 2016-04-08 | Paper |
| On reachability in graphs with obstacles Discrete Mathematics, Algorithms and Applications | 2016-02-22 | Paper |
| Motion planning in Cartesian product graphs Discussiones Mathematicae Graph Theory | 2014-05-16 | Paper |
| Fine-tuning decomposition theorem for maximum weight bipartite matching Lecture Notes in Computer Science | 2014-04-16 | Paper |
| On multiset of factors of a word Information Processing Letters | 2013-03-20 | Paper |
| On \(m\)RJ reachability in trees Discrete Mathematics, Algorithms and Applications | 2013-01-24 | Paper |
| Mutant hierarchies support selective mutation | 2012-04-24 | Paper |
| Fine-grained concurrency with separation logic Journal of Philosophical Logic | 2012-03-09 | Paper |
| Formal Approaches to Software Testing Lecture Notes in Computer Science | 2005-12-02 | Paper |
Research outcomes over time
This page was built for person: Kalpesh Kapoor
