Giacomo Paesani

1. Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
   2021/05/06 by Giacomo Paesani, Daniël Paulusma, Paesani, Giacomo +3 · 2 citations
   Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Graph Theory Research #Advanced biosensing and bioanalysis techniques #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
2. On Cycle Transversals and Their Connected Variants in the Absence of a\n Small Linear Forest
   2019/08/01 by Konrad K. Dabrowski, Carl Feghali, Dabrowski, Konrad K. +9 · 1 citation
   Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #VLSI and FPGA Design Techniques
3. The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
   2025/04/07 by Tiziana Calamoneri, Calamoneri, Tiziana, Federico Corò +3 · 1 citation
   Computer Science · #05C85 #68R10 #Advanced Graph Theory Research #Artificial Intelligence in Games #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2