( en | de | ru )

 

Disambiguation of "Obscura, Nidia"

Author of the publication

copydeleteadd this publication to your clipboard
On Minimum Generalized Manhattan Connections

, , , , , , , and . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, page 85--100. (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nidia Pullés-Linares

Nidia Martínez Avellaneda

Nidia Sánchez Puigvert

Nidia Catherine González Piñeros

 

Other publications of authors with the same name

On Minimum Generalized Manhattan Connections, , , , , , , and . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, page 85--100. (2021)A safe and complete algorithm for metagenomic assembly., , and . Algorithms Mol. Biol., 13 (1): 3:1-3:12 (2018)On Minimum Generalized Manhattan Connections., , , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 85-100. Springer, (2021)Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition., , , , , and . SODA, page 509-534. SIAM, (2023)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , and . CPM, volume 78 of LIPIcs, page 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph., , , , and . ACM Trans. Algorithms, 15 (4): 48:1-48:17 (2019)Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition., , , , , and . CoRR, (2022)On Minimum Generalized Manhattan Connections., , , , , , , and . CoRR, (2020)Simplicity in Eulerian circuits: Uniqueness and safety., and . Inf. Process. Lett., (January 2024)Simplicity in Eulerian Circuits: Uniqueness and Safety., and . CoRR, (2022)