| Algorithms and applications for a class of bilevel MILPs | 1 | 0.35 | 2020 |
| On the Observability of Smart Grids and Related Optimization Methods. | 0 | 0.34 | 2019 |
| Complexity and inapproximability results for the Power Edge Set problem. | 0 | 0.34 | 2018 |
| Shortest Path Problem variants for the Hydro Unit Commitment Problem | 0 | 0.34 | 2018 |
| Flow-Aware Workload Migration in Data Centers. | 0 | 0.34 | 2018 |
| The power edge set problem. | 4 | 0.48 | 2016 |
| Observing the State of a Smart Grid Using Bilevel Programming. | 3 | 0.43 | 2015 |
| A User-Layered Approach For Modelling And Simulating Terrorist Attacks | 1 | 0.37 | 2014 |
| Critical edges for the assignment problem: Complexity and exact resolution. | 1 | 0.35 | 2013 |
| An Object-Oriented Approach for Modelling Security Scenarios | 1 | 0.37 | 2013 |
| Complexity of determining the most vital elements for the p-median and p-center location problems | 7 | 0.49 | 2013 |
| Critical edges/nodes for the minimum spanning tree problem: complexity and approximation | 8 | 0.48 | 2013 |
| Efficient determination of the k most vital edges for the minimum spanning tree problem | 6 | 0.44 | 2012 |
| Complexity Results for the Empire Problem in Collection of Stars. | 0 | 0.34 | 2012 |
| The most vital nodes with respect to independent set and vertex cover | 17 | 0.71 | 2011 |
| Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem | 1 | 0.37 | 2011 |
| Complexity of determining the most vital elements for the 1-median and 1-center location problems | 5 | 0.46 | 2010 |
| Complexity of most vital nodes for independent set in graphs related to tree structures | 5 | 0.55 | 2010 |
