
Efficient Estimation of Graph Trussness
A ktruss is an edgeinduced subgraph H such that each of its edges belo...
read it

Zuckerli: A New Compressed Representation for Graphs
Zuckerli is a scalable compression system meant for large realworld gra...
read it

Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
read it

Succinct Representation for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical...
read it

String Sanitization: A Combinatorial Approach
String data are often disseminated to support applications such as locat...
read it

On the Complexity of Exact Pattern Matching in Graphs: Determinism and ZigZag Matching
Exact pattern matching in labeled graphs is the problem of searching pat...
read it

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
Exact pattern matching in labeled graphs is the problem of searching pat...
read it

Longest PropertyPreserved Common Factor
In this paper we introduce a new family of string processing problems. W...
read it

Compressed Communication Complexity of Longest Common Prefixes
We consider the communication complexity of fundamental longest common p...
read it

RoundHashing for Data Storage: Distributed Servers and ExternalMemory Tables
This paper proposes roundhashing, which is suitable for data storage on...
read it

Listing Maximal Subgraphs in Strongly Accessible Set Systems
Algorithms for listing the subgraphs satisfying a given property (e.g.,b...
read it
Roberto Grossi
is this you? claim profile