Memory-Adaptive Dynamic Spatial Approximation Trees. - Diego Arroyuelo; Francisca Muñoz; Gonzalo Navarro 001; Nora Reyes (SPIRE, 2003)

Space-Efficient Construction of LZ-Index. - Diego Arroyuelo; Gonzalo Navarro 001 (ISAAC, 2005)

Reducing the Space Requirement of LZ-Index. - Diego Arroyuelo; Gonzalo Navarro 001; Kunihiko Sadakane (CPM, 2006)

A Lempel-Ziv Text Index on Secondary Storage. - Diego Arroyuelo; Gonzalo Navarro 001 (CPM, 2007)

An Improved Succinct Representation for Dynamic k-ary Trees. - Diego Arroyuelo (CPM, 2008)

Fast In-Memory XPath Search over Compressed Text and Tree Indexes - Diego Arroyuelo; Francisco Claude; Sebastian Maneth; Veli Mäkinen; Gonzalo Navarro 001; Kim Nguyen 001; Jouni Sirén; Niko Välimäki (CoRR, 2009)

Succinct Trees in Practice. - Diego Arroyuelo; Rodrigo Cánovas; Gonzalo Navarro 001; Kunihiko Sadakane (ALENEX, 2010)

Compressed Self-indices Supporting Conjunctive Queries on Document Collections. - Diego Arroyuelo; Senén González; Mauricio Oyarzún (SPIRE, 2010)

Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices. - Diego Arroyuelo; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2010)

Space-efficient construction of Lempel-Ziv compressed text indexes. - Diego Arroyuelo; Gonzalo Navarro 001 (Inf. Comput., 2011)

Untangled monotonic chains and adaptive range search. - Diego Arroyuelo; Francisco Claude; Reza Dorrigiv; Stephane Durocher; Meng He 001; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson; Alejandro Salinger; Matthew Skala (Theor. Comput. Sci., 2011)

To index or not to index: time-space trade-offs in search engines with positional ranking functions. - Diego Arroyuelo; Senén González; Mauricio Marín; Mauricio Oyarzún; Torsten Suel (SIGIR, 2012)

Stronger Lempel-Ziv Based Compressed Text Indexing. - Diego Arroyuelo; Gonzalo Navarro 001; Kunihiko Sadakane (Algorithmica, 2012)

Distributed search based on self-indexed compressed text. - Diego Arroyuelo; Veronica Gil-Costa; Senén González; Mauricio Marín; Mauricio Oyarzún (Inf. Process. Manag., 2012)

Document identifier reassignment and run-length-compressed inverted indexes for improved search performance. - Diego Arroyuelo; Senén González; Mauricio Oyarzún; Victor Sepulveda (SIGIR, 2013)

A Dynamic Pivoting Algorithm Based on Spatial Approximation Indexes. - Diego Arroyuelo (SISAP, 2014)

Distributed text search using suffix arrays. - Diego Arroyuelo; Carolina Bonacic; Veronica Gil-Costa; Mauricio Marín; Gonzalo Navarro 001 (Parallel Comput., 2014)

Fast in-memory XPath search using compressed indexes. - Diego Arroyuelo; Francisco Claude; Sebastian Maneth; Veli Mäkinen; Gonzalo Navarro 001; Kim Nguyen 001; Jouni Sirén; Niko Välimäki (Softw. Pract. Exp., 2015)

Succinct Dynamic Cardinal Trees. - Diego Arroyuelo; Pooya Davoodi; Srinivasa Rao Satti (Algorithmica, 2016)

LZ78 Compression in Low Main Memory Space. - Diego Arroyuelo; Rodrigo Cánovas; Gonzalo Navarro 001; Rajeev Raman (SPIRE, 2017)

Hybrid compression of inverted lists for reordered document collections. - Diego Arroyuelo; Mauricio Oyarzún; Senén González; Victor Sepulveda (Inf. Process. Manag., 2018)

Compressed Data Structures for Astronomical Content-Aware Resource Search. - Mauricio Araya; Diego Arroyuelo; Camilo Saldías; Mauricio Solar (SCCC, 2019)

A Compact Rank/Select Data Structure for the Streaming Model. - Natalia González; Diego Arroyuelo (SCCC, 2019)

Faster Dynamic Compressed d-ary Relations. - Diego Arroyuelo; Guillermo de Bernardo; Travis Gagie; Gonzalo Navarro 001 (SPIRE, 2019)

A Practical Alphabet-Partitioning Rank/Select Data Structure. - Diego Arroyuelo; Erick Sepúlveda (SPIRE, 2019)

Compressing and Randomly Accessing Sequences (note). - Laith Ali Abdusahib; Diego Arroyuelo; Rajeev Raman (DCC, 2020)

A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences. - Diego Arroyuelo; Manuel Weitzman (SCCC, 2020)

Three success stories about compact data structures. - Diego Arroyuelo; José Fuentes-Sepúlveda; Diego Seco (Commun. ACM, 2020)

To index or not to index: Time-space trade-offs for positional ranking functions in search engines. - Diego Arroyuelo; Senén González; Mauricio Marín; Mauricio Oyarzún; Torsten Suel; Luis Valenzuela (Inf. Syst., 2020)

Worst-Case Optimal Graph Joins in Almost No Space. - Diego Arroyuelo; Aidan Hogan; Gonzalo Navarro 001; Juan L. Reutter; Javiel Rojas-Ledesma; Adrián Soto (SIGMOD Conference, 2021)

MillenniumDB: A Persistent, Open-Source, Graph Database. - Domagoj Vrgoc; Carlos Rojas; Renzo Angles; Marcelo Arenas; Diego Arroyuelo; Carlos Buil-Aranda; Aidan Hogan; Gonzalo Navarro 001; Cristian Riveros; Juan Romero (CoRR, 2021)

Time- and Space-Efficient Regular Path Queries on Graphs. - Diego Arroyuelo; Aidan Hogan; Gonzalo Navarro 001; Javiel Rojas-Ledesma (CoRR, 2021)

Engineering Practical Lempel-Ziv Tries. - Diego Arroyuelo; Rodrigo Cánovas; Johannes Fischer 001; Dominik Köppl; Marvin Löbel; Gonzalo Navarro 001; Rajeev Raman (ACM J. Exp. Algorithmics, 2021)

Time- and Space-Efficient Regular Path Queries. - Diego Arroyuelo; Aidan Hogan; Gonzalo Navarro 001; Javiel Rojas-Ledesma (ICDE, 2022)

Adaptive Succinctness. - Diego Arroyuelo; Rajeev Raman (Algorithmica, 2022)

Trie-Compressed Intersectable Sets. - Diego Arroyuelo; Juan Pablo Castillo (CoRR, 2022)

Optimal Joins Using Compressed Quadtrees. - Diego Arroyuelo; Gonzalo Navarro 001; Juan L. Reutter; Javiel Rojas-Ledesma (ACM Trans. Database Syst., 2022)

Datasets of Time- and Space-Efficient Regular Path Queries. - Diego Arroyuelo; Adrián Gómez-Brandón; Aidan Hogan; Gonzalo Navarro 001; Javiel Rojas-Ledesma (Zenodo, 2022)

Trie-Compressed Adaptive Set Intersection. - Diego Arroyuelo; Juan Pablo Castillo (CPM, 2023)

Engineering Rank/Select Data Structures for Big-Alphabet Strings. - Diego Arroyuelo; Gabriel Carmona; Héctor Larrañaga; Francisco Riveros; Erick Sepúlveda (CoRR, 2023)

MillenniumDB: An Open-Source Graph Database System. - Domagoj Vrgoc; Carlos Rojas; Renzo Angles; Marcelo Arenas; Diego Arroyuelo; Carlos Buil-Aranda; Aidan Hogan; Gonzalo Navarro 001; Cristian Riveros; Juan Romero (Data Intell., 2023)

Space & Time Efficient Leapfrog Triejoin. - Diego Arroyuelo; Daniela Campos; Adrián Gómez-Brandón; Gonzalo Navarro 001; Carlos Rojas; Domagoj Vrgoc (GRADES/NDA, 2024)

New Compressed Indices for Multijoins on Graph Databases. - Diego Arroyuelo; Fabrizio Barisione; Antonio Fariña; Adrián Gómez-Brandón; Gonzalo Navarro 001 (CoRR, 2024)

Optimizing RPQs over a compact graph representation. - Diego Arroyuelo; Adrián Gómez-Brandón; Aidan Hogan; Gonzalo Navarro 001; Javiel Rojas-Ledesma (VLDB J., 2024)

Worst-Case-Optimal Similarity Joins on Graph Databases. - Diego Arroyuelo; Benjamin Bustos; Adrián Gómez-Brandón; Aidan Hogan; Gonzalo Navarro 001; Juan L. Reutter (Proc. ACM Manag. Data, 2024)

The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space. - Diego Arroyuelo; Adrián Gómez-Brandón; Aidan Hogan; Gonzalo Navarro 001; Juan L. Reutter; Javiel Rojas-Ledesma; Adrián Soto (ACM Trans. Database Syst., 2024)

The Ring: Worst-Case Optimal Joins in Graph Databases using (Almost) No Extra Space. - Diego Arroyuelo; Adrián Gómez-Brandón; Aidan Hogan; Gonzalo Navarro 001; Juan L. Reutter; Javiel Rojas-Ledesma; Adrián Soto (Zenodo, 2024)

Tackling Challenges in Implementing Large-Scale Graph Databases. - Diego Arroyuelo; Aidan Hogan; Gonzalo Navarro 001; Juan L. Reutter; Domagoj Vrgoc (Commun. ACM, 2024)

BWT Indexes for Optimal Joins in Graph Databases. - Diego Arroyuelo; Gonzalo Navarro 001 (The Expanding World of Compressed Data, 2025)

Evaluating regular path queries on compressed adjacency matrices. - Diego Arroyuelo; Adrián Gómez-Brandón; Gonzalo Navarro 001 (VLDB J., 2025)