Ziad Ismaili Alaoui

According to our database, Ziad Ismaili Alaoui authored at least 8 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs.

Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata, Sebastian Wild

CoRR, March, 2026

Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms.

Ziad Ismaili Alaoui, Detlef Plump

Log. Methods Comput. Sci., 2026

Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space.

Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025

Implementing Binary Search Trees in GP 2 (Extended Abstract).

Ziad Ismaili Alaoui, Detlef Plump

Proceedings of the Proceedings 16th International Workshop on Graph Computation Models, January, 2025

Succinct Preferential-Attachment Graphs.

Ziad Ismaili Alaoui, Namrata, Sebastian Wild

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2025

Hardness of Finding Kings and Strong Kings.

Ziad Ismaili Alaoui, Nikhil S. Mande

Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

2024

Linear-Time Graph Programs without Preconditions.

Ziad Ismaili Alaoui, Detlef Plump

Proceedings of the Fourteenth and Fifteenth International Workshop on Graph Computation Models, March, 2024

Linear-Time Graph Programs for Unbounded-Degree Graphs.

Ziad Ismaili Alaoui, Detlef Plump

Proceedings of the Graph Transformation - 17th International Conference, 2024