Filtrer vos résultats
- 28
- 12
- 1
- 21
- 15
- 4
- 1
- 40
- 4
- 2
- 2
- 2
- 4
- 3
- 4
- 9
- 7
- 4
- 5
- 1
- 40
- 1
- 28
- 21
- 17
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 41
- 18
- 18
- 6
- 6
- 5
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
41 résultats
|
|
|
triés par
|
|
|
What is known about Vertex Cover Kernelization?Böckenhauer, Hans-Joachim and Komm, Dennis and Unger, Walter. Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pp.330--356, 2018, 978-3-319-98355-4. ⟨10.1007/978-3-319-98355-4_19⟩
Chapitre d'ouvrage
hal-02359026v1
|
||
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
|
|||
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
|
|||
Effective and Efficient Data Reduction for the Subset Interconnection Design ProblemAlgorithms and Computation, 2013, Hong-Kong, China. pp.361-371, ⟨10.1007/978-3-642-45030-3_34⟩
Communication dans un congrès
istex
hal-01176632v1
|
|||
|
|
Exact approaches for scaffoldingBMC Bioinformatics, 2015, 16 (Suppl 14), pp.S2. ⟨10.1186/1471-2105-16-S14-S2⟩
Article dans une revue
lirmm-01219627v1
|
||
|
|
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
|
||
|
|
Interval scheduling and colorful independent setsJournal of Scheduling, 2015, 18 (5), pp.449-469. ⟨10.1007/s10951-014-0398-5⟩
Article dans une revue
lirmm-01349213v1
|
||
|
|
Polynomial-Time Data Reduction for the Subset Interconnection Design ProblemSIAM Journal on Discrete Mathematics, 2015, 29 (1), pp.1-25. ⟨10.1137/140955057⟩
Article dans une revue
lirmm-01349211v1
|
||
|
|
Phylogenetic incongruence through the lens of Monadic Second Order logicJournal of Graph Algorithms and Applications, 2016, 20 (2), pp.189-215. ⟨10.7155/jgaa.00390⟩
Article dans une revue
lirmm-01348425v1
|
||
|
|
Listing Conflicting Triples in Optimal Time2019
Pré-publication, Document de travail
hal-01698097v1
|
||
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
|
|||
|
|
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special CasesAlgorithmica, 2018, 80 (6), pp.1771-1803. ⟨10.1007/s00453-018-0405-x⟩
Article dans une revue
hal-01833303v1
|
||
|
|
On the fixed parameter tractability of agreement-based phylogenetic distancesJournal of Mathematical Biology, 2017, 74 (1-2), pp.239-257. ⟨10.1007/s00285-016-1023-3⟩
Article dans une revue
lirmm-01348420v1
|
||
|
|
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks21st International Workshop on Algorithms in Bioinformatics (WABI), Aug 2021, Chicago. Due to COVID-19, WABI 2021 will be held online., United States. pp.6:1, ⟨10.4230/LIPIcs.WABI.2021.6⟩
Communication dans un congrès
hal-03287112v1
|
||
|
|
Scanning Phylogenetic Networks is NP-hardSOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.519-530, ⟨10.1007/978-3-030-38919-2_42⟩
Communication dans un congrès
hal-02353161v2
|
||
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 polynomial-time algorithm for Outerplanar Diameter ImprovementJournal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩
Article dans une revue
hal-01592242v1
|
||
|
|
When Three Trees Go to War2023
Pré-publication, Document de travail
hal-04013152v3
|
||
|
|
A Timecop's Work Is Harder Than You Think45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Aug 2020, Prague, Czech Republic. pp.71:1--71:14, ⟨10.4230/LIPIcs.MFCS.2020.71⟩
Communication dans un congrès
hal-03004095v1
|
||
|
|
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower BoundsAlgorithmica, 2021, 83, pp.2063-2095. ⟨10.1007/s00453-021-00819-6⟩
Article dans une revue
lirmm-03218029v2
|
||
|
|
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
|
||
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
|
|||
|
|
Parameterized Algorithms in Bioinformatics: An OverviewAlgorithms, 2019, 12 (12), pp.256. ⟨10.3390/a12120256⟩
Article dans une revue
hal-03004037v1
|
||
|
|
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
|
||
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
|
|||
|
|
A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Communication dans un congrès
hal-01178222v1
|
||
|
|
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
|
||
|
|
Complexity and lowers bounds for Power Edge Set ProblemJournal of Discrete Algorithms, 2018, 52-53, pp.70-91. ⟨10.1016/j.jda.2018.11.006⟩
Article dans une revue
lirmm-01950398v1
|
||
|
|
Quantifying Hierarchical Conflicts in Homology StatementsRECOMB-CG 2022 - 19th International Conference on Comparative Genomics, May 2022, La Jolla, CA, United States. pp.146-167, ⟨10.1007/978-3-031-06220-9_9⟩
Communication dans un congrès
hal-03875727v1
|
||
|
|
Constructing a Consensus Phylogeny from a Leaf-Removal DistanceSPIRE 2017, Sep 2017, Palermo, Italy. pp.129--143, ⟨10.1007/978-3-319-67428-5\_12⟩
Communication dans un congrès
hal-02155266v1
|
- 1
- 2