About
With numbers and characters, relational structures (where a base set is paired up with additional information about its elements and their mutual interactions) are the third most important type of data structure. I am deeply interested in understanding the mathematical and computational properties of these entities and their applications. I also think that Computer Science offers a unique opportunity to work at the cross-road between a number of different fields. Educating young people to the fundamentals and the specific features of our discipline is my main teaching goal.
Short Bio.
Lecturer in Liverpool since 2000.
1999. Ph.D. in Computer Science (Warwick - UK)
1993. MSc in Computer Science (Edinburgh - UK)
1991. Laurea in Scienze dell'Informazione (Bari - Italy)
PhD Students
Yuting Zheng (2020-)
Elektra Kypridemou (2018-)
Martin Guest (2015-)
Pavan Sangha (2014-2018) Independent Sets in Line of Sight Networks
Mohamed Arikiez (2012-2016) Algorithms for Energy Management in Micro-grids
Wen Yu (2011-2015) Vertex Unique Labelled Subgraph Mining
Ayesh Alshukri (2008-2012) Website Boundary Detection via Machine Learning
Chuntao Jiang (2007-2011) Frequent Subgraph Mining Algorithms on Weighted Graphs
Andrew McGrae (2003-2009) Colouring Empires in Random Trees
Michail Beis (2001-2005) Greedy Algorithms for Random Regular Graphs