@TechReport{ocad:LTN06,
  author =       {Olivier Laval and Sophie Toulouse and Anass Nagih},
  title =        {{R}apport de recherche sur le probl{\`e}me du plus court chemin contraint},
  institution =  {LIPN - CNRS UMR 7030 - Universit\'e Paris Nord},
  number =        {2006-05},
  type =     {RR},
  year = {2006},
  lipn-category = {rapl}
}

@inproceedings{ocad:MT05,
  author =   {J{\'e}r{\^o}me Monnot and Sophie Toulouse},
  title =    {Approximation Results for the Weighted P$_{\mbox{4}}$ Partition Problems.},
  booktitle = {Foundamentals of Computation Theory},
  year =     2005,
  pages =    {388-396},
  lipn-category = "intc"
}

@inproceedings{ocad:MT07,
  author =   {J{\'e}r{\^o}me Monnot and Sophie Toulouse},
  title =    {The complexity of the P$_{\mbox{k}}$ partition problem and related problems in bipartite graphs.},
  booktitle = {SOFSEM 2007: Theory and Practice of Computer Science},
  series = LNCS,
  volume = 4362,
  year =     2005,
  pages =    {422-433},
  lipn-category = "intc"
}

@InBook{ocad:MT07a,
  Author =   {J\'er\^{o}me Monnot and Sophie Toulouse},
  title =   {Le voyageur de commerce et ses variations : un tour d'horizon de ses r\'esolutions},
  BookTitle =  {Optimisation Combinatoire 5 : probl\`emes paradigmatiques et probl\'ematiques nouvelles},
  Publisher =  {Herm\`es (V. Paschos ed.)},
  chapter = {2},
  Year =     {2007},
  lipn-category = {chap}
}

@Article{ocad:MT07b,
  author = 	 {J{\'e}r{\^o}me Monnot and Sophie Toulouse},
  title = 	 {The complexity of the P$_{\mbox{k}}$ partition problem and related problems in bipartite graphs},
  journal =  {Operations Research Letters},
  year = 	 2007,
  lipn-status = 	 {apar},
  lipn-category = {jour}
}

@Article{ocad:MT07c,
  author = 	 {J{\'e}r{\^o}me Monnot and Sophie Toulouse},
  title = 	 {Approximation results for the weighted P$_{\mbox{4}}$ partition problem},
  journal =  {Journal of Discrete Algorithms},
  year = 	 2007,
  lipn-status = 	 {apar},
  lipn-category = {jour}
}

@InBook{ocad:MT07d,
  Author =   {J\'er\^{o}me Monnot and Sophie Toulouse},
  Title =   {Complexity and approximation results for bounded-size paths packing problems},
  BookTitle =  {Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives},
chapter = 18,
  Publisher =  {ISTE (V. Paschos ed.)},
  Year =     {2007},
  lipn-category = {chap}
}

@InProceedings{ocad:T07,
author = "Sophie Toulouse",
title= {Approximation diff\'erentielle : histoire, motivations, enjeux},
year = 2007,
booktitle = "{R}{O}{A}{D}{E}{F} 2007",
pages = {423-424},
address = "Grenoble",
lipn-category = "autc"
}