Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. - Ralf Borndörfer; Katrin Casel; Davis Issac; Aikaterini Niklanovits; Stephan Schwartz; Ziena Zeif (APPROX-RANDOM, 2021)

Balanced Crown Decomposition for Connectivity Constraints. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (ESA, 2021)

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (WG, 2023)

Combining Crown Structures for Vulnerability Measures. - Katrin Casel; Tobias Friedrich 001; Aikaterini Niklanovits; Kirill Simonov; Ziena Zeif (IPEC, 2024)

A Contraction Tree SAT Encoding for Computing Twin-Width. - Yinon Horev; Shiraz Shay; Sarel Cohen; Tobias Friedrich 001; Davis Issac; Lior Kamma; Aikaterini Niklanovits; Kirill Simonov (PAKDD (2), 2024)

A New Approach for Approximating Directed Rooted Networks. - Sarel Cohen; Lior Kamma; Aikaterini Niklanovits (WG, 2024)

Connected Partitions via Connected Dominating Sets. - Aikaterini Niklanovits; Kirill Simonov; Shaily Verma; Ziena Zeif (CoRR, 2025)