Homepage of Giacomo Paesani
Address: Department of Computer Science
Second year PhD student in the Algorithms and Complexity research group (ACiD).
- (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.
- (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.
- (2017-2021) PhD at Durham University under the supervision of Daniel Paulusma and Matthew Johnson. This PhD is mainly founded by a Durham Doctoral Studentship.
ResearchMy 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 F-transversals in graphs, like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal, and their variants.
If you are interested in some of these topics please get in touch with me or with one of my supervisors.
- M. Johnson, G. Paesani and D. Paulusma, Connected vertex cover for (sP1+P5)-free graphs, Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018), Cottbus, Germany, June 27-29, 2018, Lecture Notes in Computer Science 11159, 279-291.
- 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-63:15.
Talks and Meetings
- 20-27 April 2018, Jáchymov (Czech Republic): Spring School (speaker).
- 27-29 June 2018, Cottbus (Germany): WG 2018 (speaker).
- 27-31 August 2018, Liverpool (UK): MFCS 2018 (speaker).
- 19-20 September 2018, Liverpool (UK): AlgoUK Liverpool (attendee).
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
Last change: 18 September 2018.