4 citations · 5 across the 3 of their papers we have counts for
4 papers
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…
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…
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…
Heuristic algorithms for the min-max edge 2-coloring problem
Radu Stefan Mincu, Alexandru Popa
In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study sev…