default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSonia Toubaline
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j12]Julien Khamphousone
, Fabián Castaño, André Rossi, Sonia Toubaline:
A survivable variant of the ring star problem. Networks 83(2): 324-347 (2024)- 2020
- [j11]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
Algorithms and applications for a class of bilevel MILPs. Discret. Appl. Math. 272: 75-89 (2020) - 2018
- [j10]Wim van Ackooij, Claudia D'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, Sonia Toubaline:
Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electron. Notes Discret. Math. 69: 309-316 (2018) - [j9]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j8]Yoann Desmouceaux, Sonia Toubaline, Thomas H. Clausen:
Flow-Aware Workload Migration in Data Centers. J. Netw. Syst. Manag. 26(4): 1034-1057 (2018) - 2016
- [j7]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
The power edge set problem. Networks 68(2): 104-120 (2016) - 2014
- [j6]Tanya Le Sage, Hervé Borrion, Sonia Toubaline:
A user-layered approach for modelling and simulating terrorist attacks. Int. J. Crit. Infrastructures 10(3/4): 398-412 (2014) - 2013
- [j5]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25(2): 191-207 (2013) - [j4]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26(1): 178-189 (2013) - [j3]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges for the assignment problem: Complexity and exact resolution. Oper. Res. Lett. 41(6): 685-689 (2013) - 2012
- [j2]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Efficient determination of the k most vital edges for the minimum spanning tree problem. Comput. Oper. Res. 39(11): 2888-2898 (2012) - 2011
- [j1]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159(17): 1933-1946 (2011)
Conference and Workshop Papers
- 2022
- [c8]Julien Khamphousone, André Rossi, Fabián Castaño, Sonia Toubaline:
A robust variant of the Ring Star Problem. INOC 2022: 1-6 - 2019
- [c7]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Sonia Toubaline:
On the Observability of Smart Grids and Related Optimization Methods. OR 2019: 281-287 - 2015
- [c6]Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Observing the State of a Smart Grid Using Bilevel Programming. COCOA 2015: 364-376 - 2013
- [c5]Tanya Le Sage, Sonia Toubaline, Hervé Borrion:
An Object-Oriented Approach for Modelling Security Scenarios. UKSim 2013: 396-400 - 2012
- [c4]Basile Couëtoux, Jérôme Monnot, Sonia Toubaline:
Complexity Results for the Empire Problem in Collection of Stars. COCOA 2012: 73-82 - 2011
- [c3]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140 - 2010
- [c2]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) 2010: 237-251 - [c1]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA 2010: 154-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
