Nidia Obscura Acosta

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 10

Top Topics

Worst Case Scenario

Top Venues

Inf. Process. Lett.

Publications

Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai
An FPTAS for Connectivity Interdiction. IPCO (2024)
Nidia Obscura Acosta, Alexandru I. Tomescu
Simplicity in Eulerian circuits: Uniqueness and safety. Inf. Process. Lett. 183 (2024)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. SODA (2023)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR (2022)
Nidia Obscura Acosta, Alexandru I. Tomescu
Simplicity in Eulerian Circuits: Uniqueness and Safety. CoRR (2022)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. WADS (2021)
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase
On Minimum Generalized Manhattan Connections. CoRR (2020)
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15 (4) (2019)
Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu
A safe and complete algorithm for metagenomic assembly. Algorithms Mol. Biol. 13 (1) (2018)
Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM (2017)