Saket Saurabh

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

New algorithm improves bipartization solutions in disk graphs.

Examining vertex cuts and their applications in graph theory and matroid structures.

Exploring the complexity of dividing graphs into two connected groups.

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

New algorithms improve efficiency in hypergraph tree decompositions.