Manuel Cáceres

40 papers A* 2A 2B 5C 3Journal 26Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs. Bioinform. Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2025	J	`jnl`	Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework. CoRR Francisco Sena, Aleksandr Politov, Corentin Moumard, Manuel Cáceres, Sebastian Schmidt, Juha Harviainen, Alexandru I. Tomescu
2025	J	`jnl`	Maximum Coverage CoRR Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak, Alexandru I. Tomescu
2025	—	`conf`	Practical Colinear Chaining on Sequences Revisited. ISBRA (2) Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2025	J	`jnl`	Practical colinear chaining on sequences revisited. CoRR Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2024	J	`jnl`	Finding maximal exact matches in graphs. Algorithms Mol. Biol. Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2024	B	`conf`	Practical Minimum Path Cover. SEA Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2024	J	`jnl`	Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2023	J	`jnl`	A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. CoRR Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	J	`jnl`	A safety framework for flow decomposition problems via integer linear programming. Bioinform. Fernando H. C. Dias, Manuel Cáceres, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
2023	J	`jnl`	Chaining for accurate alignment of erroneous long reads to acyclic variation graphs. Bioinform. Jun Ma, Manuel Cáceres, Leena Salmela, Veli Mäkinen, Alexandru I. Tomescu
2023	C	`conf`	Chaining of Maximal Exact Matches in Graphs. SPIRE Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2023	J	`jnl`	Chaining of Maximal Exact Matches in Graphs. CoRR Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2023	C	`conf`	Finding Maximal Exact Matches in Graphs. WABI Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2023	J	`jnl`	Finding Maximal Exact Matches in Graphs. CoRR Nicola Rizzo, Manuel Cáceres, Veli Mäkinen
2023	A*	`conf`	Minimum Chain Cover in Almost Linear Time. ICALP Manuel Cáceres
2023	J	`jnl`	Minimum Chain Cover in Almost Linear Time. CoRR Manuel Cáceres
2023	J	`jnl`	Minimum Path Cover: The Power of Parameterization. CoRR Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2023	B	`conf`	Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CPM Manuel Cáceres
2023	—	`—`	Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. Manuel Cáceres
2023	A	`conf`	Sorting Finite Automata via Partition Refinement. ESA Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
2023	J	`jnl`	Sorting Finite Automata via Partition Refinement. CoRR Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza
2022	J	`jnl`	Faster repetition-aware compressed suffix trees based on Block Trees. Inf. Comput. Manuel Cáceres, Gonzalo Navarro
2022	J	`jnl`	Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	J	`jnl`	Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond. CoRR Manuel Cáceres
2022	B	`conf`	Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022	J	`jnl`	Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu
2022	A*	`conf`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2022	A	`conf`	Width Helps and Hinders Splitting Flows. ESA Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2022	J	`jnl`	Width Helps and Hinders Splitting Flows. CoRR Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2021	B	`conf`	A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021	J	`jnl`	Block trees. J. Comput. Syst. Sci. Djamal Belazzougui, Manuel Cáceres, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Gonzalo Navarro, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei
2021	J	`jnl`	Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2020	B	`conf`	Fast Indexes for Gapped Pattern Matching. SOFSEM Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
2020	J	`jnl`	Fast Indexes for Gapped Pattern Matching. CoRR Manuel Cáceres, Simon J. Puglisi, Bella Zhukova
2020	J	`jnl`	On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2019	C	`conf`	Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees. SPIRE Manuel Cáceres, Gonzalo Navarro
2019	J	`jnl`	Faster Repetition-Aware Compressed Suffix Trees based on Block Trees. CoRR Manuel Cáceres, Gonzalo Navarro