default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNidia Obscura Acosta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Nidia Obscura Acosta:
On the connectivity interdiction problem, the geometry of data structures and Eulerian circuits. Aalto University, Espoo, Finland, 2024
Journal Articles
- 2024
- [j3]Nidia Obscura Acosta
, Alexandru I. Tomescu:
Simplicity in Eulerian circuits: Uniqueness and safety. Inf. Process. Lett. 183: 106421 (2024) - 2019
- [j2]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms 15(4): 48:1-48:17 (2019) - 2018
- [j1]Nidia Obscura Acosta, Veli Mäkinen, Alexandru I. Tomescu:
A safe and complete algorithm for metagenomic assembly. Algorithms Mol. Biol. 13(1): 3:1-3:12 (2018)
Conference and Workshop Papers
- 2024
- [c4]Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai:
An FPTAS for Connectivity Interdiction. IPCO 2024: 210-223 - 2023
- [c3]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: 509-534 - 2021
- [c2]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: 85-100 - 2017
- [c1]Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
Optimal Omnitig Listing for Safe and Complete Contig Assembly. CPM 2017: 29:1-29:12
Informal and Other Publications
- 2022
- [i3]Nidia Obscura Acosta, Alexandru I. Tomescu:
Simplicity in Eulerian Circuits: Uniqueness and Safety. CoRR abs/2208.08522 (2022) - [i2]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR abs/2211.04112 (2022) - 2020
- [i1]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
