1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2019
Heuristic Algorithm for Generalized Function Matching
Radu Stefan Mincu
The problem of generalized function matching can be defined as follows: given a pattern and a text , find a mapping a…
math.OC2019★ 1 cited
IP Solutions for International Kidney Exchange Programmes
Péter Biró, Márton Gyetvai, Radu Stefan Mincu +2
In kidney exchange programmes patients with end-stage renal failure may exchange their willing, but incompatible living donors among each other. National kidney exchange programmes…
cs.DS2019
Heuristic algorithms for the Longest Filled Common Subsequence Problem
Radu Stefan Mincu, Alexandru Popa
At CPM 2017, Castelli et al. define and study a new variant of the Longest Common Subsequence Problem, termed the Longest Filled Common Subsequence Problem (LFCS). For the LFCS pro…