We study a very restrictive graph exploration problem. In our model, an ...
We analyze the Disjoint Path Allocation problem (DPA) in the priority
fr...
In the proportional knapsack problem, we are given a knapsack of some
ca...
Parameterized complexity allows us to analyze the time complexity of pro...
Moving an autonomous agent through an unknown environment is one of the
...