Sonia Toubaline

According to our database1, Sonia Toubaline authored at least 20 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A survivable variant of the ring star problem.
Networks, March, 2024

2022
A robust variant of the Ring Star Problem.
Proceedings of the 10th International Network Optimization Conference, 2022

2020
Algorithms and applications for a class of bilevel MILPs.
Discret. Appl. Math., 2020

2019
On the Observability of Smart Grids and Related Optimization Methods.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Flow-Aware Workload Migration in Data Centers.
J. Netw. Syst. Manag., 2018

Complexity and inapproximability results for the Power Edge Set problem.
J. Comb. Optim., 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem.
Electron. Notes Discret. Math., 2018

2016
The power edge set problem.
Networks, 2016

2015
Observing the State of a Smart Grid Using Bilevel Programming.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
A user-layered approach for modelling and simulating terrorist attacks.
Int. J. Crit. Infrastructures, 2014

2013
Critical edges for the assignment problem: Complexity and exact resolution.
Oper. Res. Lett., 2013

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation.
J. Comb. Optim., 2013

Complexity of determining the most vital elements for the p-median and p-center location problems.
J. Comb. Optim., 2013

An Object-Oriented Approach for Modelling Security Scenarios.
Proceedings of the 15th International Conference on Computer Modelling and Simulation, 2013

2012
Efficient determination of the k most vital edges for the minimum spanning tree problem.
Comput. Oper. Res., 2012

Complexity Results for the Empire Problem in Collection of Stars.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
The most vital nodes with respect to independent set and vertex cover.
Discret. Appl. Math., 2011

Efficient Algorithms for Finding the <i>k</i> Most Vital Edges for the Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems.
Proceedings of the Combinatorial Optimization and Applications, 2010


  Loading...