1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2026
Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
Mircea-Adrian Digulescu
Until now, Computer Scientists have concerned themselves with identifying efficient algorithms for solving the general case of some problem -- that is finding one which performs we…
cs.GT2019
Farsighted Collusion in Stable Marriage Problem
Mircea Digulescu
The Stable Marriage Problem, as proposed by Gale and Shapley, considers producing a bipartite matching between two equally sized sets of boys (proposers) and respectively girls (ac…
cs.GT2016★ 1 cited
Strategic play in stable marriage problem
Mircea Adrian Digulescu
The stable marriage problem, as addressed by Gale and Shapely [1] consists of providing a bipartite matching between n " boys " and n " girls "-each of whom have a totally ordered…