Sai Sandeep

Available identifiers

Publication	Date of Publication	Type
Look before, before you leap: online vector load balancing with few reassignments	2024-09-25	Paper
On the hardness of scheduling with non-uniform communication delays	2024-07-19	Paper
Approximate hypergraph vertex cover and generalized Tuza's conjecture	2024-07-19	Paper
Conditional dichotomy of Boolean ordered promise CSPs	2024-07-03	Paper
SDPs and robust satisfiability of promise CSP	2024-05-08	Paper
Revisiting alphabet reduction in Dinur’s PCP.	2023-10-31	Paper
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms	2023-02-03	Paper
Minmax regret for sink location on dynamic flow paths with general capacities	2022-04-29	Paper
On Petri Nets with Hierarchical Special Arcs	2020-05-27	Paper
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms	2020-02-26	Paper
Constant approximation for k-median and k-means with outliers via iterative rounding	2019-08-22	Paper
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two	2017-04-07	Paper

This page was built for person: Sai Sandeep