Ziad Ismaili Alaoui

11 papers B 2Journal 5Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs.
CoRR
Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata, Sebastian Wild
2026 — conf
Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space.
SOSA
Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
2025 — conf
Hardness of Finding Kings and Strong Kings.
FSTTCS
Ziad Ismaili Alaoui, Nikhil S. Mande
2025 J jnl
Hardness of Finding Kings and Strong Kings.
CoRR
Ziad Ismaili Alaoui, Nikhil S. Mande
2025 — conf
Implementing Binary Search Trees in GP 2 (Extended Abstract).
GCM@STAF
Ziad Ismaili Alaoui, Detlef Plump
2025 J jnl
Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms.
CoRR
Ziad Ismaili Alaoui, Detlef Plump
2025 J jnl
Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space.
CoRR
Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
2025 J jnl
Succinct Preferential Attachment Graphs.
CoRR
Ziad Ismaili Alaoui, Namrata, Sebastian Wild
2025 B conf
Succinct Preferential-Attachment Graphs.
WG
Ziad Ismaili Alaoui, Namrata, Sebastian Wild
2024 B conf
Linear-Time Graph Programs for Unbounded-Degree Graphs.
ICGT
Ziad Ismaili Alaoui, Detlef Plump
2024 — conf
Linear-Time Graph Programs without Preconditions.
GCM
Ziad Ismaili Alaoui, Detlef Plump