Meirav Zehavi

Combining k-center and k-median for advanced data analysis.

New algorithm improves bipartization solutions in disk graphs.

Exploring the significance and applications of hitting subgraphs in various fields.

A look into clustered planarity and linear saturation in graph representation.