I am currently a third year Computer Science PhD student, supervised by Ramanujan Sridharan. I graduated from the University of Warwick in 2022 with an MEng in Discrete Mathematics. I am a member of the Theory and Foundations group (FoCS) and of the Centre for Discrete Mathematics and its Applications (DIMAP).

Research

My main research interests are in parameterized complexity, with a focus on parameters that measure acyclicity of graphs. I have recently been working in social choice theory on tournaments and on FPT fault tolerant oracles. I am also interested in temporal graphs and their applications.

Publications

• An Exercise in Tournament Design: When Some Matches Must Be Scheduled - with Sushmita Gupta and Ramanujan Sridharan (AAAI 2024, arXiv)
• Decremental Sensitivity Oracles for Covering and Packing Minors - with M. S. Ramanujan, Fahad Panolan, and Lawqueen Kanesh (STACS 2024)
• On Controlling Knockout Tournaments Without Perfect Information - with Václav Blažej, Sushmita Gupta, and M. S. Ramanujan (IPEC 2024, arXiv)
• On the Parameterized Complexity of Eulerian Strong Component Arc Deletion - with Václav Blažej, Satyabrata Jana, and M. S. Ramanujan (IPEC 2024, arXiv)

Teaching

Senior Graduate Teaching Assistant:

• Term 1, 2022/23 and 2023/24: Associate Tutor for CS130 - Mathematics for Computer Scientists 1
• Term 2, 2022/23 and 2023/24: Associate Tutor for CS259 - Formal Languages
• Term 1, 2024/25: Associate Tutor for CS301 - Complexity of Algorithms

Contact

Peter dot Strulo at warwick dot ac dot uk