default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrom Strings to Graphs, and Back Again:
A Festschrift for Roberto Grossi 's 60th Birthday 2025
- Alessio Conte
, Andrea Marino, Giovanna Rosone, Jeffrey Scott Vitter:
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday, Grossi's Festschrift, July 25, 2025, Venice, Italy. OASIcs 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-391-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxxii
- Xiaoyang Chen, Yujia Wang, Hongwei Huo, Jeffrey Scott Vitter:
An Efficient Heuristic for Graph Edit Distance. 1:1-1:18 - Nicola Rizzo, Veli Mäkinen, Nadia Pisanti:
On the Construction of Elastic Degenerate Strings. 2:1-2:13 - Anna Bernasconi, Linda Pagli:
"Strutture Di Dati e Algoritmi. Progettazione, Analisi e Visualizzazione", a Book Beating Its Own Drum. 3:1-3:5 - Giuseppe F. Italiano, Athanasios L. Konstantinidis, Manas Jyoti Kashyop:
On Graph Burning and Edge Burning. 4:1-4:18 - Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Generalized Fibonacci Cubes Based on Swap and Mismatch Distance. 5:1-5:14 - Jarno N. Alanko, Philip Bille, Inge Li Gørtz, Gonzalo Navarro, Simon J. Puglisi:
Compact Data Structures for Collections of Sets. 6:1-6:7 - Massimo Equi:
Conditional Lower Bounds for String Matching in Labelled Graphs. 7:1-7:13 - Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno:
Enumeration of Ordered Trees with Leaf Restrictions. 8:1-8:19 - Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis:
On String and Graph Sanitization. 9:1-9:10 - Nathaniel K. Brown, Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Marinella Sciortino:
Faster Run-Length Compressed Suffix Arrays. 10:1-10:15 - Giorgio Audrito, Luigi Laura, Alessio Orlandi, Dario Ostuni, Romeo Rizzi, Luca Versari:
Turing Arena Light: Enhancing Programming Education Through Competitive Environments. 11:1-11:14 - Seungbum Jo, Srinivasa Rao Satti:
Encoding Data Structures for Range Queries on Arrays. 12:1-12:12 - Kunihiko Sadakane:
Secure Compressed Suffix Arrays. 13:1-13:8 - Marie-Pierre Béal, Maxime Crochemore:
Specific Patterns Against Reference Sequences. 14:1-14:12 - Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Rossano Venturini, Jeffrey Scott Vitter:
Wavelet Tree, Part I: A Brief History. 15:1-15:11 - Yakov Nekirch, Sharma V. Thankachan:
Faster Range LCP Queries in Linear Space. 16:1-16:6 - Nicola Cotumaccio:
On Inverting the Burrows-Wheeler Transform. 17:1-17:8 - Roberto Marangoni:
DNA Is a Puzzle Enthusiast. 18:1-18:8 - Alessio Conte, Kazuhiro Kurita, Andrea Marino, Giulia Punzi, Takeaki Uno, Kunihiro Wasa:
Designing Output Sensitive Algorithms for Subgraph Enumeration. 19:1-19:40 - Giovanni Buzzega, Alessio Conte, Veronica Guerrini, Giulia Punzi, Giovanna Rosone, Lorenzo Tattini:
Subsequence-Based Indices for Genome Sequence Analysis. 20:1-20:21
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.
last updated on 2025-10-24 02:50 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:
