| An innovative Strategy to Quickly Grade Functional Test Programs F Angione, P Bernardi, A Calabrese, L Cardone, A Niccoletti, D Piumatti, ... 2022 IEEE International Test Conference (ITC), 355-364, 2022 | 4 | 2022 |
| The Multi-Maximum and Quasi-Maximum Common Subgraph Problem L Cardone, S Quer Computation 11 (4), 69, 2023 | 1 | 2023 |
| A web scraping algorithm to improve the computation of the maximum common subgraph A Calabrese, L Cardone, S Licata, P Marco, S Quer ICSOFT 2023, 197-206, 2023 | 1 | 2023 |
| An Experimental Evaluation of Graph Coloring Heuristics on Multi-and Many-Core Architectures A Borione, L Cardone, A Calabrese, S Quer IEEE Access, 2023 | | 2023 |
| About the correlation between logical identified faulty gates and their layout characteristics P Bernardi, L Cardone, G Iaria, D Appello, G Garozzo, V Tancorre 2023 IEEE 29th International Symposium on On-Line Testing and Robust System …, 2023 | | 2023 |
| The Multi-Maximum and Quasi-Maximum Common Subgraph Problem. Computation 2023, 11, 69 L Cardone, S Quer | | 2023 |
| Reporting test programs connectivity in a human-readable format L Cardone Titolo volume non avvalorato, 2023 | | 2023 |
| Problema del Massimo Comune Sottografo: Concorrenza ed Estensioni per Multipli Grafi= The Maximum Common Subgraph problem: Concurrency and Multi-Graph Extentions L Cardone Politecnico di Torino, 2021 | | 2021 |
Andrea CalabresePhD student, Politecnico di TorinoVerified email at polito.it
Andrea CalabresePhD student, Politecnico di TorinoVerified email at polito.it