E-LIB Suche - Ergebnisse für: Obscura Acosta, Nidia

1

Simplicity in Eulerian circuits: Uniqueness and safety:

Obscura Acosta, Nidia ; Tomescu, Alexandru I.
Information Processing Letters. 183 (2024) - p. 106421 , 2024

Link: https://doi.org/10.1016/..

2

An FPTAS for Connectivity Interdiction:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,

Huang, Chien-Chung ; Obscura Acosta, Nidia ; Yingchareonthawornchai, Sorrachai - p. 210-223 , 2024

Link: https://doi.org/10.1007/..

3

On Minimum Generalized Manhattan Connections:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Antoniadis, Antonios ; Capretto, Margarita ; Chalermsook, Parinya... - p. 85-100 , 2021

Link: https://doi.org/10.1007/..

4

A safe and complete algorithm for metagenomic assembly:

Obscura Acosta, Nidia ; Mäkinen, Veli ; Tomescu, Alexandru I.
Algorithms for Molecular Biology. 13 (2018) 1 - p. , 2018

Link: https://doi.org/10.1186/..

5

An Optimal O(nm) Algorithm for Enumerating All Walks Common..:

Cairo, Massimo ; Medvedev, Paul ; Acosta, Nidia Obscura..
ACM Transactions on Algorithms (TALG). 15 (2019) 4 - p. 1-17 , 2019

Link: https://dl.acm.org/doi/1..

6

An OptimalO(nm) Algorithm for Enumerating All Walks Common ..:

Cairo, Massimo ; Medvedev, Paul ; Acosta, Nidia Obscura..
ACM Transactions on Algorithms. 15 (2019) 4 - p. 1-17 , 2019

Link: https://doi.org/10.1145/..

7

Simplicity in Eulerian circuits : Uniqueness and safety:

Obscura Acosta, Nidia ; Tomescu, Alexandru I
Information Processing Letters. , 2024

Link: https://aaltodoc.aalto.f..

8

Simplicity in Eulerian circuits: Uniqueness and safety:

Obscura Acosta, Nidia ; Tomescu, Alexandru I
10.1016/j.ipl.2023.106421. , 2023

Link: http://hdl.handle.net/10..

9

Optimal Omnitig Listing for Safe and Complete Contig Assemb..:

Cairo, Massimo ; Medvedev, Paul ; Obscura Acosta, Nidia..
doi:10.4230/LIPIcs.CPM.2017.29. , 2017

Link: https://doi.org/10.4230/..

10

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matri..:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote...
info:eu-repo/grantAgreement/EC/H2020/759557/EU//ALGOCom. , 2023

Link: https://aaltodoc.aalto.f..

11

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matri..:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote...
http://arxiv.org/abs/2211.04112. , 2022

Link: http://arxiv.org/abs/221..

12

Simplicity in Eulerian Circuits: Uniqueness and Safety:

Acosta, Nidia Obscura ; Tomescu, Alexandru I
http://arxiv.org/abs/2208.08522. , 2022

Link: http://arxiv.org/abs/220..

13

An Optimal O(nm) Algorithm for Enumerating All Walks Common..:

Cairo, Massimo ; Medvedev, Paul ; Acosta, Nidia Obscura..
10.1145/3341731. , 2019

Link: http://hdl.handle.net/10..

14

A safe and complete algorithm for metagenomic assembly:

Acosta, Nidia Obscura ; Mäkinen, Veli ; Tomescu, Alexandru I
10.1186/s13015-018-0122-7. , 2018

Link: http://hdl.handle.net/10..

15

A safe and complete algorithm for metagenomic assembly:

Nidia Obscura Acosta ; Veli Mäkinen ; Alexandru I. Tomescu
http://link.springer.com/article/10.1186/s13015-018-0122-7. , 2018

Link: https://doi.org/10.1186/..