Sophie Toulouse

According to our database, Sophie Toulouse authored at least 20 papers between 2001 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Optimizing Alphabet Reduction Pairs of Arrays.

Jean-François Culus, Sophie Toulouse

Math. Comput. Sci., December, 2026

From worst case to the average: Structural guarantees in k-CSP approximation via orthogonal arrays.

Jean-François Culus, Sophie Toulouse

Theor. Comput. Sci., 2026

2024

Deriving differential approximation results for k,CSPs from combinatorial designs.

Jean-François Culus, Sophie Toulouse

CoRR, 2024

2021

Approximation of the Double Traveling Salesman Problem with Multiple Stacks.

Laurent Alfandari, Sophie Toulouse

Theor. Comput. Sci., 2021

2020

Approximation of the Double Travelling Salesman Problem with Multiple Stacks.

Laurent Alfandari, Sophie Toulouse

CoRR, 2020

2018

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems.

Marcos de Melo da Silva, Sophie Toulouse, Roberto Wolfler Calvo

Eur. J. Oper. Res., 2018

How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?

Jean-François Culus, Sophie Toulouse

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2 CSPs All Are Approximable Within a Constant Differential Factor.

Jean-François Culus, Sophie Toulouse

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2012

Differential Approximation of the Multiple Stacks TSP.

Sophie Toulouse

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2010

Approximability of the Multiple Stack TSP.

Sophie Toulouse

Electron. Notes Discret. Math., 2010

2009

On the Complexity of the Multiple Stack TSP, kSTSP.

Sophie Toulouse, Roberto Wolfler Calvo

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Approximation results for the weighted P₄ partition problem.

Jérôme Monnot, Sophie Toulouse

J. Discrete Algorithms, 2008

Rapport de recherche sur le problème du plus court chemin contraint

Olivier Laval, Sophie Toulouse, Anass Nagih

CoRR, 2008

2007

The path partition problem and related problems in bipartite graphs.

Jérôme Monnot, Sophie Toulouse

Oper. Res. Lett., 2007

The P_k Partition Problem and Related Problems in Bipartite Graphs.

Jérôme Monnot, Sophie Toulouse

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2005

Approximation Results for the Weighted P₄ Partition Problems.

Jérôme Monnot, Sophie Toulouse

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Local approximations for maximum partial subgraph problem.

Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse

Oper. Res. Lett., 2004

2003

Optima locaux garantis pour l'approximation différentielle.

Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse

Tech. Sci. Informatiques, 2003

Approximation algorithms for the traveling salesman problem.

Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse

Math. Methods Oper. Res., 2003

2001

Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.

Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001