Giulia Punzi

Orcid: 0000-0001-8738-1595

According to our database1, Giulia Punzi authored at least 13 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs.
Algorithmica, January, 2024

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
CoRR, 2024

2023
Hide and Mine in Strings: Hardness, Algorithms, and Experiments.
IEEE Trans. Knowl. Data Eng., June, 2023

An Efficient Algorithm for Assessing the Number of <i>st</i>-Paths in Large Graphs.
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

A Compact DAG for Storing and Searching Maximal Common Subsequences.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Enumeration of Maximal Common Subsequences Between Two Strings.
Algorithmica, 2022

On Strings Having the Same Length- k Substrings.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

Bounding the Number of Eulerian Tours in Undirected Graphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Hide and Mine in Strings: Hardness and Algorithms.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
Polynomial-Delay Enumeration of Maximal Common Subsequences.
Proceedings of the String Processing and Information Retrieval, 2019

Online Algorithms on Antipowers and Antiperiods.
Proceedings of the String Processing and Information Retrieval, 2019


  Loading...