Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Versari
- > Home > Persons > Luca Versari
Publications
- 2022
[j8]Alessio Conte
, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51(5): 1580-1625 (2022)- 2020
- [j6]Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access 8: 139096-139109 (2020) - [j5]Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. IEEE Access 8: 219233-219243 (2020) - [j4]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82(6): 1547-1573 (2020) - [i7]Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. CoRR abs/2009.01353 (2020) - [i6]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Estimation of Graph Trussness. CoRR abs/2010.00967 (2020) - 2019
- [j3]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268: 210-222 (2019) - [j2]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33(2): 587-613 (2019) - [i3]Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari:
Proximity Search For Maximal Subgraph Enumeration. CoRR abs/1912.13446 (2019) - 2018
- [c13]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON 2018: 328-340 - [c12]Roberto Grossi, Luca Versari:
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. ESA 2018: 43:1-43:14 - [c11]Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
Discovering $k$-Trusses in Large-Scale Networks. HPEC 2018: 1-6 - [c9]Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. KDD 2018: 1272-1281 - [c8]Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN 2018: 544-557 - [c7]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16 - [c6]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari:
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG 2018: 100-110 - [i2]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR abs/1803.03659 (2018) - [i1]Roberto Grossi, Luca Versari:
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. CoRR abs/1805.03158 (2018) - 2017
- [c5]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB 2017: 62-74 - [c4]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c3]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE 2017: 144-160 - 2016
- [c2]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP 2016: 148:1-148:15 - [c1]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. IWOCA 2016: 83-95
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-12 18:29 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:
