Curriculum vitae

Toubaline Sonia

Maître de conférences
Tel : 01 44 05 44 15
Bureau : P626


Sonia Toubaline is an Assistant Professor in Computer Science at Paris-Dauphine University since September 2016. She holds an Engineering degree in Operational Research, a Master’s degree in modeling, optimization, decision and organisation, and a Ph.D. in computer science and combinatorial optimization. She was previously a post-doc at the Jill Dando Institute of Security and Crime Science, University College London and then at Laboratoire d'informatique LIX, Ecole Polytechnique. She has been teaching courses for more than 10 years in general computer science, optimization, operations research, and security, at both undergraduate and postgraduate levels. Her research interests concern combinatorial optimization, multi-objective decision making, mathematical modeling of real world applications, resilience and security of infrastructures (terrorist attacks), network optimization and sustainable development.

Dernières publications

BU Paris-Dauphine


Poirion P-L., Toubaline S., D'Ambrosio C., Liberti L. (2020), Algorithms and applications for a class of bilevel MILPs, Discrete Applied Mathematics, vol. 272, p. 75-89

Ackooij W., D'Ambrosio C., Liberti L., Taktak R., Thomopulos D., Toubaline S. (2018), Shortest Path Problem variants for the Hydro Unit Commitment Problem, Electronic Notes in Discrete Mathematics, vol. 69, p. 309-316

Desmouceaux Y., Toubaline S., Clausen T. (2018), Flow-Aware Workload Migration in Data Centers, Journal of Network and Systems Management, vol. 26, n°4, p. 1034-1057

Toubaline S., D’Ambrosio C., Liberti L., Poirion P-L., Schieber B., Shachnai H. (2018), Complexity and inapproximability results for the Power Edge Set problem, Journal of Combinatorial Optimization, vol. 35, n°3, p. 895-905

Poirion P-L., Toubaline S., D'Ambrosio C., Liberti L. (2016), The power edge set problem, Networks, vol. 68, n°2, p. 104-120

Sage T., Borrion H., Toubaline S. (2014), A user-layered approach for modelling and simulating terrorist attacks, International Journal of Critical Infrastructures, vol. 10, n°3/4

Bazgan C., Toubaline S., Vanderpooten D. (2013), Complexity of determining the most vital elements for the p-median and p-center location problems, Journal of Combinatorial Optimization, vol. 25, n°2, p. 191-207

Bazgan C., Toubaline S., Vanderpooten D. (2013), Critical edges for the assignment problem : complexity and exact resolution, Operations Research Letters, vol. 41, n°6, p. 685-689

Bazgan C., Toubaline S., Vanderpooten D. (2013), Critical edges/nodes for the minimum spanning tree problem: complexity and approximation, Journal of Combinatorial Optimization, vol. 26, n°1, p. 178-189

Bazgan C., Toubaline S., Vanderpooten D. (2012), Efficient determination of the k most vital edges for the minimum spanning tree problem, Computers and Operations Research, vol. 39, n°11, p. 2888-2898

Bazgan C., Toubaline S., Tuza Z. (2011), The most vital nodes with respect to independent set and vertex cover, Discrete Applied Mathematics, vol. 159, n°17, p. 1933-1946

Communications avec actes

Toubaline S., Poirion P-L., D’Ambrosio C., Liberti L. (2015), Observing the State of a Smart Grid Using Bilevel Programming, in Zaixin Lu; Donghyun Kim; Weili Wu; Wei Li; Ding-Zhu Du, Combinatorial Optimization and Applications, 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, Springer International Publishing, 364-376 p.

Couëtoux B., Monnot J., Toubaline S. (2012), Complexity Results for the Empire Problem in Collection of Stars, in Lin, Guohui, Combinatorial Optimization and Applications 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012, Proceedings, Berlin, Springer, 73-82 p.

Bazgan C., Toubaline S., Tuza Z. (2011), Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures, in Smyth, William F., Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Londres, Springer, 154-166 p.

Bazgan C., Toubaline S., Vanderpooten D. (2011), Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem, in Zhu, Xuding, Combinatorial Optimization and Applications 5th International Conference, COCOA 2011, Zhangjiajie, Springer, 126-140 p.

Retour à la liste