morLAB
morLAB
Research
People
Publications
Contact
Light
Dark
Automatic
Networks
Kidney paired donations
Matching pools of kidney patients to eligible donors to maximize total transplants
Pandemic modeling and planning
Predicting pandemic disease spread through very large agent-based simulations and optimizing mitigation strategies through graph theory and machine learning
A branch-and-price algorithm enhanced by decision diagrams for the kidney exchange problem
Kidney paired donation programs allow patients registered with an incompatible donor to receive a suitable kidney from another donor, …
PDF
Cite
Deriving pandemic disease mitigation strategies by mining social contact networks
In this chapter we propose a robust approach to deriving disease mitigation strategies from contact networks that are generated from …
Cite
DOI
Efficiently identifying critical nodes in large complex networks
The critical node detection problem (CNDP) aims to fragment a graph G=(V,E) by removing a set of vertices R with cardinality |R|≤k, …
Cite
DOI
Network robustness versus multi-strategy sequential attack
We examine the robustness of networks under attack when the attacker sequentially selects from a number of different attack strategies, …
Cite
DOI
A derandomized approximation algorithm for the critical node detection problem
In this paper we propose an efficient approximation algorithm for determining solutions to the critical node detection problem (CNDP) …
Cite
DOI
A fast greedy algorithm for the critical node detection problem
Cite
A randomized algorithm with local search for containment of pandemic disease spread
In this paper we present a randomized rounding algorithm for approximating the cardinality-constrained critical node detection problem. …
Cite
DOI
A region growing algorithm for detecting critical nodes
Cite
»
Cite
×