Saket Saurabh

This study presents methods for finding minimum weight feedback vertex sets in tournaments.

A look at how satisfiability, coverage, and fairness intersect in optimization.

Explore methods for identifying stable sets within graph structures governed by matroid rules.

This study examines methods to minimize crossings in ordered graphs using efficient algorithms.

This paper examines how distance influences voter satisfaction in committee selection.

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.