Nidia Obscura Acosta

Doctoral Researcher
Doctoral Researcher
T313 Dept. Computer Science
Full researcher profile
Phone number

Research groups

  • Professorship Chalermsook Parinya, Doctoral Researcher


Simplicity in Eulerian circuits : Uniqueness and safety

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

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai 2023 Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

On Minimum Generalized Manhattan Connections

Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase 2021 Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings

An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph

M. Cairo, P. Medvedev, N. O. Acosta, R. Rizzi, A. I. Tomescu 2019 ACM Transactions on Algorithms