default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Cardone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j5]Andrea Calabrese
, Lorenzo Cardone, Salvatore Licata, Marco Porro, Stefano Quer:
Improving state-of-the-art vertex sorting algorithms to compute the maximum common induced subgraph. J. Heuristics 32(1): 1 (2026)- 2025
- [j4]Giusy Iaria, Paolo Bernardi, Claudia Bertani, Lorenzo Cardone, Giuseppe Garozzo, Vincenzo Tancorre:
A Comprehensive Scan Test Cost Model to Optimize the Production of Very Large SoCs. IEEE Trans. Computers 74(4): 1278-1292 (2025) - [j3]Francesco Angione, Paolo Bernardi, Andrea Calabrese, Lorenzo Cardone, Stefano Quer, Claudia Bertani, Vincenzo Tancorre:
A Novel Indirect Methodology Based on Execution Traces for Grading Functional Test Programs. IEEE Trans. Computers 74(11): 3582-3595 (2025) - [c6]Francesco Angione, Paolo Bernardi, Claudia Bertani, Lorenzo Bertetto, Lorenzo Cardone, Nicola Di Gruttola Giardino, Stefano Quer, Vincenzo Tancorre:
Leveraging ATE to Optimize System-Level-Test for Multicore Automotive SoCs. LATS 2025: 1-6 - 2024
- [c5]Lorenzo Cardone, Salvatore Di Martino, Stefano Quer:
Efficiently Computing Maximum Clique of Sparse Graphs with Many-Core Graphical Processing Units. ICSOFT 2024: 539-546 - [c4]Paolo Bernardi, Lorenzo Cardone, Tommaso Foscale:
Exploring trade-offs in multi-site wafer testing. LATS 2024: 1-4 - 2023
- [j2]Alessandro Borione, Lorenzo Cardone, Andrea Calabrese, Stefano Quer:
An Experimental Evaluation of Graph Coloring Heuristics on Multi- and Many-Core Architectures. IEEE Access 11: 125226-125243 (2023) - [j1]Lorenzo Cardone, Stefano Quer:
The Multi-Maximum and Quasi-Maximum Common Subgraph Problem. Comput. 11(4): 69 (2023) - [c3]Andrea Calabrese, Lorenzo Cardone, Salvatore Licata, Marco Porro, Stefano Quer:
A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph. ICSOFT 2023: 197-206 - [c2]Paolo Bernardi, Lorenzo Cardone, Giusy Iaria, Davide Appello, Giuseppe Garozzo, Vincenzo Tancorre:
About the Correlation between Logical Identified Faulty Gates and their Layout Characteristics. IOLTS 2023: 1-7 - 2022
- [c1]Francesco Angione, Paolo Bernardi, Andrea Calabrese, Lorenzo Cardone, A. Niccoletti, Davide Piumatti, Stefano Quer, Davide Appello, Vincenzo Tancorre, Roberto Ugioli:
An innovative Strategy to Quickly Grade Functional Test Programs. ITC 2022: 355-364
Coauthor Index
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 2026-01-10 00:33 CET 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:
