Background: To expand the opportunity for paired live donor kidney transplantation, computerized matching algorithms have been designed to identify maximal sets of compatible donor/recipient pairs from a registry of incompatible pairs submitted as candidates for transplantation. Methods: Demographic data of patients who had been evaluated for live donor kidney transplantation but found to be incompatible with their potential donor (because of ABO blood group or positive crossmatch) were submitted for computer analysis and matching. Data included ABO and HLA types of donor and recipient, %PRA and specificity of recipient alloantibody, donor/recipient relationship, and the reason the donor was incompatible. The data set used for the ...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/113739/1/ajt13413.pd
The theoretical literature on exchange of indivisible goods finds natural application in organizing ...
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We sho...
Background: To expand the opportunity for paired live donor kidney transplantation, computerized mat...
The old concept of barter exchange has extended to the modern area of living-donor kidney transplant...
Kidney transplantation is the treatment of choice for patients with end-stage renal disease (ESRD). ...
Patients needing kidney transplants may have willing donors who cannot donate to them because of blo...
We design a flexible algorithm that exploits deceased donor kidneys to initiate chains of living do...
In kidney paired donation (KPD), incompatible pairs exchange kidneys so that each recipient receives...
Donor kidney exchange is an established method to overcome incompatibility of donor-recipient pairs ...
Advances in medical technology have made kidney transplants over the blood group barrier feasible. T...
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We sh...
Increasing numbers of compatible pairs are choosing to enter paired exchange programs, but motivatio...
Background: The crisis in organ availability has triggered innovative approaches to meet a rapidly e...
BACKGROUND: Participation of compatible pairs (CP) in kidney paired donation (KPD) could be attract...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/113739/1/ajt13413.pd
The theoretical literature on exchange of indivisible goods finds natural application in organizing ...
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We sho...
Background: To expand the opportunity for paired live donor kidney transplantation, computerized mat...
The old concept of barter exchange has extended to the modern area of living-donor kidney transplant...
Kidney transplantation is the treatment of choice for patients with end-stage renal disease (ESRD). ...
Patients needing kidney transplants may have willing donors who cannot donate to them because of blo...
We design a flexible algorithm that exploits deceased donor kidneys to initiate chains of living do...
In kidney paired donation (KPD), incompatible pairs exchange kidneys so that each recipient receives...
Donor kidney exchange is an established method to overcome incompatibility of donor-recipient pairs ...
Advances in medical technology have made kidney transplants over the blood group barrier feasible. T...
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We sh...
Increasing numbers of compatible pairs are choosing to enter paired exchange programs, but motivatio...
Background: The crisis in organ availability has triggered innovative approaches to meet a rapidly e...
BACKGROUND: Participation of compatible pairs (CP) in kidney paired donation (KPD) could be attract...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/113739/1/ajt13413.pd
The theoretical literature on exchange of indivisible goods finds natural application in organizing ...
We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We sho...