Cerca per relatore della tesi |
Risultati da
1 a 12 di 47
| Titolo | Corso di studi | Anno di discussione | Relatore |
|---|---|---|---|
| Compressed Representations of Set Collections | INFORMATICA | 2026 | |
| NP-Hardness of minimizing BWT runs for consecutive texts under collection permutations | INFORMATICA | 2025 | |
| On Maximal Subgraph Sampling via Proximity Search | INFORMATICA | 2024 | |
| Real-world Graph Analysis: Techniques for Static, Dynamic and Temporal Communities | INFORMATICA | 2024 | |
| Novel Algorithms for Assessing the Number of Solutions in Graph Problems | INFORMATICA | 2023 | |
| Fast Similarity for Large Attributed Networks | INFORMATICA | 2021 | |
| Compression Techniques for Large Graphs: Theory and Practice | INFORMATICA | 2021 | |
| Listing Large Cliques in Real-World Graphs | INFORMATICA | 2020 | |
| Efficient algorithms for compressing linked temporal data | INFORMATICA | 2020 | |
| Efficient Algorithm for time-based similarity of trajectory on graph | INFORMATICA | 2020 | |
| k-Graphlet Counting in Degree Bounded Graphs | INFORMATICA | 2019 | |
| Extending graph properties for listing maximal subgraphs in temporal networks | MATEMATICA | 2019 |
| Nuova ricerca |