default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Cáceres
Person information
- affiliation: Aalto University, Helsinki, Finland
- affiliation (former): University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i15]Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak, Alexandru I. Tomescu:
Maximum Coverage k-Antichains and Chains: A Greedy Approach. CoRR abs/2502.06459 (2025)- 2024
- [j8]Nicola Rizzo
, Manuel Cáceres, Veli Mäkinen:
Finding maximal exact matches in graphs. Algorithms Mol. Biol. 19(1): 10 (2024) - [j7]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024) - [c12]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Practical Minimum Path Cover. SEA 2024: 3:1-3:19 - 2023
- [b1]Manuel Cáceres:
Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. University of Helsinki, Finland, 2023 - [j6]Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu:
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. Bioinform. 39(8) (2023) - [j5]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A safety framework for flow decomposition problems via integer linear programming. Bioinform. 39(10) (2023) - [c11]Manuel Cáceres:
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CPM 2023: 7:1-7:19 - [c10]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. ESA 2023: 15:1-15:15 - [c9]Manuel Cáceres:
Minimum Chain Cover in Almost Linear Time. ICALP 2023: 31:1-31:12 - [c8]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Chaining of Maximal Exact Matches in Graphs. SPIRE 2023: 353-366 - [c7]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Finding Maximal Exact Matches in Graphs. WABI 2023: 10:1-10:17 - [i14]Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu:
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR abs/2301.13245 (2023) - [i13]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Chaining of Maximal Exact Matches in Graphs. CoRR abs/2302.01748 (2023) - [i12]Manuel Cáceres:
Minimum Chain Cover in Almost Linear Time. CoRR abs/2305.02166 (2023) - [i11]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. CoRR abs/2305.05129 (2023) - [i10]Nicola Rizzo, Manuel Cáceres, Veli Mäkinen:
Finding Maximal Exact Matches in Graphs. CoRR abs/2305.09752 (2023) - [i9]Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu:
Minimum Path Cover: The Power of Parameterization. CoRR abs/2308.08960 (2023) - 2022
- [j4]Manuel Cáceres, Gonzalo Navarro:
Faster repetition-aware compressed suffix trees based on Block Trees. Inf. Comput. 285(Part): 104749 (2022) - [j3]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. 29(12): 1270-1287 (2022) - [j2]Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - [c6]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - [c5]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB 2022: 177-192 - [c4]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA 2022: 359-376 - [i8]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR abs/2201.10372 (2022) - [i7]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - [i6]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - [i5]Manuel Cáceres:
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CoRR abs/2212.07870 (2022) - 2021
- [j1]Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Block trees. J. Comput. Syst. Sci. 117: 1-22 (2021) - [c3]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG 2021: 257-269 - [i4]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR abs/2107.05717 (2021) - 2020
- [c2]Manuel Cáceres, Simon J. Puglisi, Bella Zhukova:
Fast Indexes for Gapped Pattern Matching. SOFSEM 2020: 493-504 - [i3]Manuel Cáceres, Simon J. Puglisi, Bella Zhukova:
Fast Indexes for Gapped Pattern Matching. CoRR abs/2002.12662 (2020) - [i2]Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR abs/2007.07575 (2020)
2010 – 2019
- 2019
- [c1]Manuel Cáceres, Gonzalo Navarro:
Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. SPIRE 2019: 434-451 - [i1]Manuel Cáceres, Gonzalo Navarro:
Faster Repetition-Aware Compressed Suffix Trees based on Block Trees. CoRR abs/1902.03274 (2019)
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 2025-05-18 20:20 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:
