default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSophie Toulouse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Jean-François Culus, Sophie Toulouse:
Optimizing alphabet reduction pairs of arrays. CoRR abs/2406.10930 (2024)- [i5]Jean-François Culus, Sophie Toulouse:
Deriving differential approximation results for k,CSPs from combinatorial designs. CoRR abs/2409.03903 (2024) - 2021
- [j9]Laurent Alfandari, Sophie Toulouse:
Approximation of the Double Traveling Salesman Problem with Multiple Stacks. Theor. Comput. Sci. 877: 74-89 (2021) - 2020
- [i4]Laurent Alfandari, Sophie Toulouse:
Approximation of the Double Travelling Salesman Problem with Multiple Stacks. CoRR abs/2010.00138 (2020)
2010 – 2019
- 2018
- [j8]Marcos de Melo da Silva
, Sophie Toulouse, Roberto Wolfler Calvo:
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. Eur. J. Oper. Res. 271(1): 40-56 (2018) - [c7]Jean-François Culus, Sophie Toulouse:
2 CSPs All Are Approximable Within a Constant Differential Factor. ISCO 2018: 389-401 - [c6]Jean-François Culus, Sophie Toulouse:
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? IWOCA 2018: 374-386 - 2012
- [c5]Sophie Toulouse:
Differential Approximation of the Multiple Stacks TSP. ISCO 2012: 404-415 - 2010
- [j7]Sophie Toulouse:
Approximability of the Multiple Stack TSP. Electron. Notes Discret. Math. 36: 813-820 (2010) - [i3]Sophie Toulouse, Roberto Wolfler Calvo:
On the complexity of the multiple stack TSP, kSTSP. CoRR abs/1009.5029 (2010) - [i2]Sophie Toulouse:
Approximability of the Multiple Stack TSP. CoRR abs/1009.5030 (2010)
2000 – 2009
- 2009
- [c4]Sophie Toulouse, Roberto Wolfler Calvo:
On the Complexity of the Multiple Stack TSP, kSTSP. TAMC 2009: 360-369 - 2008
- [j6]Jérôme Monnot, Sophie Toulouse:
Approximation results for the weighted P4 partition problem. J. Discrete Algorithms 6(2): 299-312 (2008) - [i1]Olivier Laval, Sophie Toulouse, Anass Nagih:
Rapport de recherche sur le problème du plus court chemin contraint. CoRR abs/0803.2615 (2008) - 2007
- [j5]Jérôme Monnot, Sophie Toulouse:
The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5): 677-684 (2007) - [c3]Jérôme Monnot, Sophie Toulouse:
The Pk Partition Problem and Related Problems in Bipartite Graphs. SOFSEM (1) 2007: 422-433 - 2005
- [c2]Jérôme Monnot, Sophie Toulouse:
Approximation Results for the Weighted P4 Partition Problems. FCT 2005: 388-396 - 2004
- [j4]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Local approximations for maximum partial subgraph problem. Oper. Res. Lett. 32(3): 217-224 (2004) - 2003
- [j3]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential approximation results for the traveling salesman problem with distances 1 and 2. Eur. J. Oper. Res. 145(3): 557-568 (2003) - [j2]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Approximation algorithms for the traveling salesman problem. Math. Methods Oper. Res. 56(3): 387-405 (2003) - [j1]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Optima locaux garantis pour l'approximation différentielle. Tech. Sci. Informatiques 22(3): 257-288 (2003) - 2001
- [c1]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. FCT 2001: 275-286
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-10-22 21:14 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:
