Luís M. S. Russo

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 28

Top Topics

Graph Representations

Finding Optimal

Top Venues

Theor. Comput. Sci.

Publications

Luís M. S. Russo
Searching for a Feedback Vertex Set with the link-cut tree. J. Comput. Sci. 72 (2023)
Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz
On Finding Optimal (Dynamic) Arborescences. CoRR (2023)
Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo, Cátia Vaz
On Finding Optimal (Dynamic) Arborescences. Algorithms 16 (12) (2023)
Luís M. S. Russo, Daniel Castro, Aleksandar Ilic, Paolo Romano, Ana Sofia D. Correia
Stochastic simulated annealing for directed feedback vertex set. Appl. Soft Comput. 129 (2022)
Miguel E. Coimbra, Joana Hrotkó, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
A practical succinct dynamic graph representation. Inf. Comput. 285 (Part) (2022)
Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
Order-preserving pattern matching indeterminate strings. Inf. Comput. 289 (Part) (2022)
Luís M. S. Russo
Range minimum queries in minimal space. Theor. Comput. Sci. 909 (2022)
Luís M. S. Russo, Alexandre P. Francisco
Small Longest Tandem Scattered Subsequences. Sci. Ann. Comput. Sci. 31 (1) (2021)
Luís M. S. Russo
Range Minimum Queries in Minimal Space. CoRR (2021)
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
On Dynamic Succinct Graph Representations. DCC (2020)
Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika
Sparsifying parity-check matrices. Appl. Soft Comput. 96 (2020)
Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco
Approximating Optimal Bidirectional Macro Schemes. DCC (2020)
Luís M. S. Russo, Alexandre P. Francisco
Small Longest Tandem Scattered Subsequences. CoRR (2020)
Luís M. S. Russo, Ana Sofia D. Correia, Gonzalo Navarro, Alexandre P. Francisco
Approximating Optimal Bidirectional Macro Schemes. CoRR (2020)
Diogo M. Costa, Alexandre P. Francisco, Luís M. S. Russo
Hardness of Modern Games. CoRR (2020)
Luís M. S. Russo, Alexandre P. Francisco, Tatiana Rocher
Incremental Multiple Longest Common Sub-Sequences. CoRR (2020)
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo
More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms 13 (9) (2020)
Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika
Sparsifying Parity-Check Matrices. CoRR (2020)
Maxime Crochemore, Luís M. S. Russo
Cartesian and Lyndon trees. Theor. Comput. Sci. 806 (2020)
Luís M. S. Russo
A study on splay trees. Theor. Comput. Sci. 776 (2019)
Rafael Marques, Luís M. S. Russo, Nuno Roma
Flying tourist problem: Flight time and cost minimization in complex routes. Expert Syst. Appl. 130 (2019)
Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
Order-Preserving Pattern Matching Indeterminate Strings. CoRR (2019)
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo, Guillermo de Bernardo, Susana Ladra, Gonzalo Navarro
On dynamic succinct graph representations. CoRR (2019)
Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai
Order-Preserving Pattern Matching Indeterminate Strings. CPM (2018)
Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco
Linking and Cutting Spanning Trees. Algorithms 11 (4) (2018)
Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco
Linking and Cutting Spanning Trees. CoRR (2018)
Maxime Crochemore, Luís M. S. Russo
Cartesian trees and Lyndon trees. CoRR (2017)
Luís M. S. Russo, Alexandre P. Francisco
Extending quick hypervolume. J. Heuristics 22 (3) (2016)
Luís M. S. Russo
A Study on Splay Trees. CoRR (2015)
Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo
Improving Bilingual Search Performance Using Compact Full-Text Indices. CICLing (1) (2015)
Gonzalo Navarro, Luís M. S. Russo
Fast Fully-Compressed Suffix Trees. DCC (2014)
Filipe Ferreira, Miguel E. Coimbra, Raquel Bairrão, Ricardo Viera, Ana T. Freitas, Luís M. S. Russo, José Borbinha
Data Management in Metagenomics: A Risk Management Approach. Int. J. Digit. Curation 9 (1) (2014)
Miguel Ferreira, Nuno Roma, Luís M. S. Russo
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER. BMC Bioinform. 15 (2014)
Luís M. S. Russo, Alexandre P. Francisco
Quick Hypervolume. IEEE Trans. Evol. Comput. 18 (4) (2014)
Miguel E. Coimbra, Francisco Fernandes, Luís M. S. Russo, Ana T. Freitas
Parallel efficient aligner of pyrosequencing reads. EuroMPI (2013)
Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo
Space-efficient data-analysis queries on grids. Theor. Comput. Sci. 482 (2013)
Jorge Costa, Luís Gomes, Gabriel Pereira Lopes, Luís M. S. Russo, Nieves R. Brisaboa
Compact and Fast Indexes for Translation Related Tasks. EPIA (2013)
Luís M. S. Russo, Alexandre P. Francisco
Quick HyperVolume CoRR (2012)
Luís M. S. Russo
Monge properties of sequence alignment. Theor. Comput. Sci. 423 (2012)
Susana Vinga, Alexandra M. Carvalho, Alexandre P. Francisco, Luís M. S. Russo, Jonas S. Almeida
Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms Mol. Biol. 7 (2012)
Francisco Fernandes, Paulo G. S. da Fonseca, Luís M. S. Russo, Arlindo L. Oliveira, Ana T. Freitas
Efficient alignment of pyrosequencing reads for re-sequencing applications. BMC Bioinform. 12 (2011)
Gonzalo Navarro, Luís M. S. Russo
Space-Efficient Data-Analysis Queries on Grids CoRR (2011)
Jorge Costa, Gabriel Pereira Lopes, Luís Gomes, Luís M. S. Russo
Representing a bilingual lexicon with suffix trees. SAC (2011)
Gonzalo Navarro, Luís M. S. Russo
Space-Efficient Data-Analysis Queries on Grids. ISAAC (2011)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Fully compressed suffix trees. ACM Trans. Algorithms 7 (4) (2011)
Luís M. S. Russo, German Tischler
Succinct Gapped Suffix Arrays. SPIRE (2011)
Luís M. S. Russo
Multiplication Algorithms for Monge Matrices. SPIRE (2010)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Parallel and Distributed Compressed Indexes. CPM (2010)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales
Approximate String Matching with Compressed Indexes. Algorithms 2 (3) (2009)
Luís M. S. Russo, Arlindo L. Oliveira
A compressed self-index using a Ziv-Lempel dictionary. Inf. Retr. 11 (4) (2008)
Gonzalo Navarro, Luís M. S. Russo
Re-pair Achieves High-Order Entropy. DCC (2008)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Dynamic Fully-Compressed Suffix Trees. CPM (2008)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Fully-Compressed Suffix Trees. LATIN (2008)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Indexed Hierarchical Approximate String Matching. SPIRE (2008)
Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Approximate String Matching with Lempel-Ziv Compressed Indexes. SPIRE (2007)
Luís M. S. Russo, Arlindo L. Oliveira
Efficient generation of super condensed neighborhoods. J. Discrete Algorithms 5 (3) (2007)
Luís M. S. Russo, Arlindo L. Oliveira
A Compressed Self-index Using a Ziv-Lempel Dictionary. SPIRE (2006)
Luís M. S. Russo, Arlindo L. Oliveira
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata. SPIRE (2005)
Luís M. S. Russo, Arlindo L. Oliveira
An Efficient Algorithm for Generating Super Condensed Neighborhoods. CPM (2005)