Researcher identifiers

  • IdHAL : annie-chateau

Export Publications

Export the displayed publications:
Number of documents

18

Publications of Annie Duchateau


Rodolphe Giroudeau   

Journal articles5 documents

Conference papers13 documents

  • Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. New Polynomial-Time Algorithm around the Scaffolding Problem. AlCoB: Algorithms for Computational Biology, May 2019, Berkeley, United States. pp.25-38, ⟨10.1007/978-3-030-18174-1_2⟩. ⟨lirmm-02047701⟩
  • Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. New Results About the Linearization of Scaffolds Sharing Repeated Contigs. COCOA: Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107, ⟨10.1007/978-3-030-04651-4_7⟩. ⟨lirmm-01900389v2⟩
  • Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. On the hardness of approximating Linearization of Scaffolds sharing Repeated Contigs. RECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.91-107, ⟨10.1007/978-3-030-00834-5_5⟩. ⟨lirmm-01900395v2⟩
  • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. New Insights for Power Edge Set Problem. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩. ⟨lirmm-01672895⟩
  • Annie Chateau, Benoit Darties, Rodolphe Giroudeau, Mathias Weller. Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficile. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01516931⟩
  • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Improved Complexity for Power Edge Set Problem. IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩. ⟨hal-01715909⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau. On the Linearization of Scaffolds Sharing Repeated Contigs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.509-517, ⟨10.1007/978-3-319-71147-8_38⟩. ⟨lirmm-01672893⟩
  • Eric Bourreau, Annie Chateau, Rodolphe Giroudeau, Clément Dallard. Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génome. ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2017, Metz, France. ⟨lirmm-01875591⟩
  • Eric Bourreau, Annie Chateau, Clément Dallard, Rodolphe Giroudeau. A Graph Constraints Formulation for Contigs Scaffolding. WCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. pp.136-149. ⟨lirmm-01360463⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. On Residual Approximation in Solution Extension Problems. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩. ⟨lirmm-01378581⟩
  • Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.294-308, ⟨10.1007/978-3-319-48749-6_22⟩. ⟨lirmm-01378584⟩
  • Mathias Weller, Annie Chateau, Rodolphe Giroudeau. On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2015, Houston, United States. pp.409-423, ⟨10.1007/978-3-319-26626-8_30⟩. ⟨lirmm-01250982⟩
  • Annie Chateau, Rodolphe Giroudeau. Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem. AlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58, ⟨10.1007/978-3-319-07953-0_4⟩. ⟨lirmm-01007556⟩