PhD Student

Theoretical Computer Science

Hey! I am Ziad (he/him), a current doctoral student at the University of Liverpool since October 2024. I am a member of the ACTO and NDC groups. I work under the guidance of Sebastian Wild, Nikhil Mande and Viktor Zamaraev. Prior to this, I completed my Master’s degree at the University of York under the guidance of Detlef Plump.

Note: My surname is “Ismaili Alaoui,” in full. My first name is “Ziad.” I do not have a middle name.

Interests: graph transformation, graph rewriting, graph algorithms, succinct data structures, compression, tournaments, query complexity (deterministic, randomised and quantum)…

Education

University of Liverpool

• PhD, Computer Science (Since October 2024)

University of York

• MScR, Computer Science (September 2023 to September 2024) [Thesis]
• BSc, Computer Science (September 2020 to July 2023)

Work Experience

Graduate Teaching Assistant at the University of Liverpool (since January 2025)

• I assist with running the tutorials for the module titled “Foundations of Computer Science” (COMP109).
• I assisted with delivering the tutorials for the module titled “Complexity of Algorithms” (COMP202).
• I assisted with demonstrating and delivering the tutorials for the module titled “Data Structures and Algorithms” (COMP108).

Graduate Teaching Assistant at the University of York (February 2024 to May 2024)

• I demonstrated for the module titled “Object Oriented Data Structures & Algorithms” (COM00016C).

Publications

[Google Scholar] [dblp]

1. Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space
   Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
   SOSA 2026: Symposium on Simplicity in Algorithms 2026.
   [arXiv]

2. Succinct Preferential-Attachment Graphs
   Ziad Ismaili Alaoui, Namrata, Sebastian Wild
   WG 2025: International Workshop on Graph-Theoretic Concepts in Computer Science 2025.
   [arXiv]

3. Hardness of Finding Kings and Strong Kings
   Ziad Ismaili Alaoui, Nikhil S. Mande
   FSTTCS 2025: Foundations of Software Technology and Theoretical Computer Science 2025.
   [arXiv]

4. Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
   Ziad Ismaili Alaoui, Detlef Plump
   Under review for Logical Methods in Computer Science (LMCS).
   [arXiv]

5. Linear-Time Graph Programs without Preconditions
   Ziad Ismaili Alaoui, Detlef Plump
   GCM 2024: Proceedings of the 15th International Workshop on Graph Computation Models. Electronic Proceedings in Theoretical Computer Science.
   [arXiv] [White Rose]

6. Linear-Time Graph Programs for Unbounded-Degree Graphs
   Ziad Ismaili Alaoui, Detlef Plump
   ICGT 2024: Proceedings of the 17th International Conference on Graph Transformation. Lecture Notes in Computer Science 14774, pages 3-20. Springer, 2024.
   [Springer]

Talks

1. Succinct Preferential-Attachment Graphs, 51st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Europäische Akademie Otzenhausen (Germany), June 12th 2025.
2. Implementing Binary Search Trees in GP 2, 16th International Workshop on Graph Computation Model (GCM), Koblenz (Germany), June 10th 2025.
3. Succinct Preferential-Attachment Graphs, Analysis of Algorithms (AofA) 2025, Toronto (Canada), May 8th 2025.
4. Finding Strong Kings in Tournaments, Postgraduate Combinatorics Conference (PCC) 2025, Glasgow (the United Kingdom), May 2nd 2025.
5. Linear-Time Graph Programs for Unbounded-Degree Graphs, International Conference on Graph Transformation (ICGT) 2024, Enschede (the Netherlands), July 11th 2024.

---

Theme's Source