Nidia Obscura Acosta

According to our database, Nidia Obscura Acosta authored at least 8 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Simplicity in Eulerian circuits: Uniqueness and safety.

Nidia Obscura Acosta, Alexandru I. Tomescu

Inf. Process. Lett., January, 2024

On the connectivity interdiction problem, the geometry of data structures and Eulerian circuits.

Nidia Obscura Acosta

PhD thesis, 2024

An FPTAS for Connectivity Interdiction.

Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2021

On Minimum Generalized Manhattan Connections.

Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2019

An Optimal <i>O</i>(<i>nm</i>) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph.

Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu

ACM Trans. Algorithms, 2019

2018

A safe and complete algorithm for metagenomic assembly.

Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu

Algorithms Mol. Biol., 2018

2017

Optimal Omnitig Listing for Safe and Complete Contig Assembly.

Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017