Research Activities

 

My recent research activities focus on the following key areas:

In my research, I address various NP-complete problems related to these areas. Key contributions include:

To address this problem, we proposed a heuristic based on Dijkstra's algorithm, where up to k paths are stored at each node in the substrate network. Simulations revealed that increasing the value of k yields diminishing returns, suggesting that small values of k provide a high probability of achieving solutions close to the optimum. These findings underscore the effectiveness of our approach in tackling this complex challenge. More details on this contribution can be found in our publication: link.

 

The complete list of my publications can be found here: link.