A dynamic flow network consists of a directed graph, where nodes called
...
In this paper, we propose new algorithms for evacuation problems defined...
Given a graph G and two independent sets S, T of G, the independent set
...
This paper addresses the minmax regret 1-sink location problem on dynami...
We address the facility location problems on dynamic flow path networks....
Given a set of persistence diagrams P_1,..., P_m, for the data
reduction...
The problem called "String reconstruction from substrings" is a mathemat...