The following pages link to Sai Sandeep (Q2133395):
Displaying 11 items.
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Constant approximation for k-median and k-means with outliers via iterative rounding (Q5230327) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Revisiting alphabet reduction in Dinur’s PCP. (Q6062158) (← links)
- Conditional dichotomy of Boolean ordered promise CSPs (Q6566587) (← links)
- On the hardness of scheduling with non-uniform communication delays (Q6575087) (← links)
- Approximate hypergraph vertex cover and generalized Tuza's conjecture (Q6575113) (← links)
- Look before, before you leap: online vector load balancing with few reassignments (Q6610334) (← links)
