Ziena Zeif

Orcid: 0000-0003-0378-1458

Affiliations:
  • University of Potsdam, Hasso Plattner Institute, Germany


According to our database1, Ziena Zeif authored at least 11 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Padded Decomposition For Bounded Treewidth Graphs.
CoRR, 2024

Combining Crown Structures for Vulnerability Measures.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

On the Giant Component of Geometric Inhomogeneous Random Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Analysis of a gray-box operator for vertex cover.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.
Proceedings of the Approximation, 2022

2021
Balanced Crown Decomposition for Connectivity Constraints.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.
Proceedings of the Approximation, 2021

2016
Line Planning on Path Networks with Application to the Istanbul Metrobüs.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016


  Loading...