Skip to main content

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

Conference Papers

Submitted Journal Papers


Talks and Meetings

Speaker

Attendee


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 LindopSiani 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.