Home of Dr. Giacomo Paesani
Contact
![]() | Address: Department of Computer Science Durham University South Road Durham DH1 3LE UK Office: E280 Tel: +39 3714514969 Email: [email protected] [email protected] |
PhD graduate in the Algorithms and Complexity research group (ACiD) in Durham.
Bibliography
- (2017-2021) PhD, Doctor of Philosophy, in Computer Science at Durham University, with thesis Graph Transversals for Hereditary Graph Classes: a Complexity Perspective under the supervision of professor Daniel Paulusma and professor Matthew Johnson. This PhD was mainly founded by a Durham Doctoral Studentship.
- (2013-2016) Master Degree, Laurea Magistrale, in Mathematics at the University of Rome, La Sapienza, with thesis “The relationship between the chromatic number of a graph and clique immersion” under the supervision of professor Paul Wollan.
- (2009-2013) Bachelor Degree, Laurea Triennale, in Mathematics at the University of Rome, La Sapienza, with thesis “Analogies between Zariski topology and a topology defined upon logical formulas” under the supervision of professor Claudio Bernardi.
Research
My research interests include Structural, Algorithmic and Extremal Graph Theory, Combinatorics and Discrete Mathematics. In the past I have been working on graph relations like Minor and Immersion but now we are focusing on some algorithmic and structural problems on transversals in graphs, in particular edge and cycle transversals and their variants.
If you are interested in some of these topics please get in touch with me or with one of my co-authors.
Publications
Journal Papers
- N. Brettel, M. Johnson, G. Paesani and D. Paulusma, Computing Subset Transversals in H-Free Graphs, Theoretical Computer Science, June 2021.
- N. Brettel, J. Horsfield, A. Munaro, G. Paesani and D. Paulusma, Bounding the Mim-Width of Hereditary Graph Classes, Journal of Graph Theory, June 2021.
- H. Bodlaender, N. Brettel, M. Johnson, E.J. Leeuwen, G. Paesani and D. Paulusma, Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective, Theoretical Computer Science, 867 (2021) 30-39.
- K.K. Dabrowski, C. Feghali, M. Johnson, G. Paesani, D. Paulusma and P. Rzazewski, On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, Algorithmica, 82 (2020) 2841-2866.
- M. Johnson, G. Paesani and D. Paulusma, Connected Vertex Cover for (sP1+P5)-Free Graphs, Algorithmica, 82 (2020) 20-40.
Conference Papers
- G. Paesani, D. Paulusma and P. Rzazewski, Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, Proceedings of the 46rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Tallin, Estonia, August 23-27, 2021, Leibniz International Proceedings in Informatics 202, 82:1-14.
- N. Brettel, J. Horsfield, A. Munaro, G. Paesani and D. Paulusma, Bounding the Mim-Width of Hereditary Graph Classes, Proceeding of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, December 14-18, 2020, Leibniz International Proceedings in Informatics 180, 6:1-18.
- N. Brettel, M. Johnson, G. Paesani and D. Paulusma, Computing Subset Transversals in H-Free Graphs, Proceeding of the 46th International Graph-Theoretic Concepts in Computer Science Workshop (WG 2020), Leeds, UK, June 24-26, 2020, Springer LNCS Proceedings, 12301:187-199.
- H. Bodlaender, N. Brettel, M. Johnson, G. Paesani, D. Paulusma and E.J. Leeuwen, Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective, Proceedings of the 14th Latin American Theoretical Informatics Symposium (LATIN 2020), São Paulo, Brasil, May 25-29, 2020, Springer LNCS Proceedings, 12118:613-624.
- K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev, Independent Transversals versus Transversals, Proceedings of the 10th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), Bratislava, Slovakia, August 26-30, 2019, Acta Mathematica Universitatis Comenianae, 88:585-591.
- C. Feghali, M. Johnson, G. Paesani and D. Paulusma, On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, Proceeding of the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019), Copenhagen, Denmark, August 11-14, 2019, Springer LNCS Proceedings, 11651:258-273.
- K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev, On the price of independence for vertex cover, feedback vertex set and odd cycle transversal, Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool, UK, August 27-31, 2018, Leibniz International Proceedings in Informatics 117, 63:1-15.
- M. Matthew Johnson and G. Paesani and D. Paulusma, Connected Vertex Cover for (sP1+P5)-Free Graphs, Proceeding of the 44th International Graph-Theoretic Concepts in Computer Science Workshop (WG 2018), Cottbus, Germany, June 27-29, 2018, Springer LNCS Proceedings, 11159:279-291.
Submitted Journal Papers
- K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev, On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal, October 2019.
Talks and Meetings
Speaker
- 23-27 August 2021, Tallin (Estonia): MFCS 2021 (virtual).
- 5-9 July 2021, Durham (UK): BCC 2021 (virtual).
- 5-8 January 2021, São Paolo (Brazil): LATIN 2020 (virtual).
- 24-26 June 2020, Leeds (UK): WG 2020 (virtual).
- 24 February 2020, Lancaster (UK): Postgraduate Forum.
- 26-30 August 2019, Bratislava (Slovakia): EUROCOMB 2019.
- 11-14 August 2019, Copenhagen (Denmark): FCT 2019.
- 15-17 April 2019, Durham (UK): BCTCS 2019 & AlgoUK Workshop.
- 27-31 August 2018, Liverpool (UK): MFCS 2018.
- 27-29 June 2018, Cottbus (Germany): WG 2018.
- 20-27 April 2018, Jáchymov (Czech Republic): Spring School.
Attendee
- 12 July 2021, Glasgow (UK): GWP 2021 (virtual).
- 29-31 March 2021, Liverpool (UK): BCTCS 2021 (virtual).
- 14-18 December 2020, Hong Kong: IPEC&ISAAC 2020 (virtual).
- 14-16 September 2020, Ischia (Italy): CTW 2020 (virtual).
- 6-8 April 2020, Swansea (UK): BCTCS 2020 & AlgoUK Workshop (virtual).
- 19-20 September 2018, Liverpool (UK): AlgoUK Workshop.
Reviewer Work
I have been a reviewer and subreviewer for conference papers (MFCS2018) and journal papers (Discrete Applied Mathematics, Journal of Graph Theory and Theoretical Computer Science).
Teaching
In 2019/2020, I am Demonstrator together with Chris Lindop, Siani Smith and Isobel Friedlander of the module Mathematics for Computer Science.
In 2018/2019, I am Demonstrator together with Chris Lindop and Siani Smith of the module Mathematics for Computer Science.
In 2017/2018, I am Demonstrator together with Chris Lindop of the module Mathematics for Computer Science.
All materials are on Duo.
Curiosities and Quotes
My Erdős number is 3.
“The hardest thing of all is to find a black cat in a dark room. Especially if there is no cat.” Confucius, 551BC – 479BC
“Audentes Fortuna iuvat.” Virgilio, 70BC – 19BC
Last change: 28 September 2021.