- 8
- 6
- 6
- 1
- 1
AC
Annie CHATEAU
22
Documents
Identifiants chercheurs
- annie-chateau
- 0000-0003-4760-8171
- IdRef : 227798856
Présentation
Publications
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 22
- 18
- 6
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 20
- 5
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 5
- 5
- 3
- 3
- 1
|
Linearizing Genomes: Exact Methods and Local SearchSOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.505-518, ⟨10.1007/978-3-030-38919-2_41⟩
Communication dans un congrès
lirmm-02332049v2
|
|
New Polynomial-Time Algorithm around the Scaffolding ProblemAlCoB 2019 - 6th International Conference on Algorithms for Computational Biology, May 2019, Berkeley, United States. pp.25-38, ⟨10.1007/978-3-030-18174-1_2⟩
Communication dans un congrès
lirmm-02047701v1
|
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic GraphsIWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Jul 2019, Pisa, Italy. pp.122-135, ⟨10.1007/978-3-030-25005-8_11⟩
Communication dans un congrès
hal-02359076v1
|
|
|
New Results About the Linearization of Scaffolds Sharing Repeated ContigsCOCOA 2018 - 12th International Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107, ⟨10.1007/978-3-030-04651-4_7⟩
Communication dans un congrès
lirmm-01900389v2
|
|
On the hardness of approximating Linearization of Scaffolds sharing Repeated ContigsRECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.91-107, ⟨10.1007/978-3-030-00834-5_5⟩
Communication dans un congrès
lirmm-01900395v2
|
|
Surveiller un réseau électrique en plaçant des dispositifs sur ses liens : un problème difficileAlgoTel: Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Communication dans un congrès
hal-01516931v1
|
On the Linearization of Scaffolds Sharing Repeated ContigsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.509-517, ⟨10.1007/978-3-319-71147-8_38⟩
Communication dans un congrès
lirmm-01672893v1
|
|
|
Une modélisation par Contrainte de graphe pour résoudre l’échafaudage de génomeROADEF 2017 - 18e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2017, Metz, France
Communication dans un congrès
lirmm-01875591v1
|
New Insights for Power Edge Set ProblemCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194, ⟨10.1007/978-3-319-71150-8_17⟩
Communication dans un congrès
lirmm-01672895v1
|
|
|
Improved Complexity for Power Edge Set ProblemIWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩
Communication dans un congrès
hal-01715909v1
|
On Residual Approximation in Solution Extension ProblemsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩
Communication dans un congrès
lirmm-01378581v1
|
|
Instance Guaranteed Ratio on Greedy Heuristic for Genome ScaffoldingCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.294-308, ⟨10.1007/978-3-319-48749-6_22⟩
Communication dans un congrès
lirmm-01378584v1
|
|
|
A Graph Constraints Formulation for Contigs ScaffoldingWCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. pp.136-149
Communication dans un congrès
lirmm-01360463v1
|
On the Complexity of Scaffolding Problems: From Cliques to Sparse GraphsCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2015, Houston, United States. pp.409-423, ⟨10.1007/978-3-319-26626-8_30⟩
Communication dans un congrès
lirmm-01250982v1
|
|
Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding ProblemAlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58, ⟨10.1007/978-3-319-07953-0_4⟩
Communication dans un congrès
lirmm-01007556v1
|