Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs - S. K. Gupta 001; Sahil Singla 001; Akash Khandelwal; Apurv Tiwari; Srilekha (CoRR, 2010)

The impact of electricity pricing schemes on storage adoption in Ontario. - Tommy Carpenter; Sahil Singla 001; Parsiad Azimzadeh; Srinivasan Keshav (e-Energy, 2012)

Demand response through a temperature setpoint market in Ontario. - Sahil Singla 001; Srinivasan Keshav (SmartGridComm, 2012)

Morphing Planar Graph Drawings with a Polynomial Number of Steps. - Soroush Alamdari; Patrizio Angelini; Timothy M. Chan; Giuseppe Di Battista; Fabrizio Frati; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; Bryan T. Wilkinson (SODA, 2013)

Battery provisioning and scheduling for a hybrid battery-diesel generator system. - Sahil Singla 001; Yashar Ghiassi-Farrokhfal; Srinivasan Keshav (SIGMETRICS Perform. Evaluation Rev., 2013)

Exact analysis of TTL cache networks: the case of caching policies driven by stopping times. - Daniel S. Berger; Philipp Gland; Sahil Singla 001; Florin Ciucu (SIGMETRICS, 2014)

Exact analysis of TTL cache networks. - Daniel S. Berger; Philipp Gland; Sahil Singla 001; Florin Ciucu (Perform. Evaluation, 2014)

Algorithms and Adaptivity Gaps for Stochastic Probing. - Anupam Gupta 001; Viswanath Nagarajan; Sahil Singla 001 (SODA, 2016)

On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. - Joseph Cheriyan; Zhihan Gao 002; Konstantinos Georgiou; Sahil Singla 001 (Math. Program., 2016)

Online Matroid Intersection: Beating Half for Random Arrival. - Guru Prashanth Guruganesh; Sahil Singla 001 (IPCO, 2017)

Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. - Anupam Gupta 001; Viswanath Nagarajan; Sahil Singla 001 (SODA, 2017)

Combinatorial Prophet Inequalities. - Aviad Rubinstein; Sahil Singla 001 (SODA, 2017)

How to Morph Planar Graph Drawings. - Soroush Alamdari; Patrizio Angelini; Fidel Barrera-Cruz; Timothy M. Chan; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Penny Haxell; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; et al. (SIAM J. Comput., 2017)

Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. - Euiwoong Lee; Sahil Singla 001 (ESA, 2018)

The Price of Information in Combinatorial Optimization. - Sahil Singla 001 (SODA, 2018)

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. - Domagoj Bradac; Sahil Singla 001; Goran Zuzic (APPROX-RANDOM, 2019)

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. - David Ellis Hershkowitz; R. Ravi 001; Sahil Singla 001 (APPROX-RANDOM, 2019)

Faster Matroid Intersection. - Deeparnab Chakrabarty; Yin Tat Lee; Aaron Sidford; Sahil Singla 001; Sam Chiu-wai Wong (FOCS, 2019)

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries. - Pravesh Kothari; Sahil Singla 001; Divyarthi Mohan; Ariel Schvartzman; S. Matthew Weinberg (FOCS, 2019)

Non-Clairvoyant Precedence Constrained Scheduling. - Naveen Garg 001; Anupam Gupta 001; Amit Kumar 001; Sahil Singla 001 (ICALP, 2019)

The Markovian Price of Information. - Anupam Gupta 001; Haotian Jiang; Ziv Scully; Sahil Singla 001 (IPCO, 2019)

Approximation Schemes for a Buyer with Independent Items via Symmetries. - Pravesh Kothari; Divyarthi Mohan; Ariel Schvartzman; Sahil Singla 001; S. Matthew Weinberg (CoRR, 2019)

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization. - Haotian Jiang; Janardhan Kulkarni; Sahil Singla 001 (CoRR, 2019)

Random-Order Models. - Anupam Gupta 001; Sahil Singla 001 (Beyond the Worst-Case Analysis of Algorithms, 2020)

Online Learning with Vector Costs and Bandits with Knapsacks. - Thomas Kesselheim; Sahil Singla 001 (COLT, 2020)

Online Carpooling Using Expander Decompositions. - Anupam Gupta 001; Ravishankar Krishnaswamy; Amit Kumar 001; Sahil Singla 001 (FSTTCS, 2020)

Robust Algorithms for the Secretary Problem. - Domagoj Bradac; Anupam Gupta 001; Sahil Singla 001; Goran Zuzic (ITCS, 2020)

Algorithms and Adaptivity Gaps for Stochastic k-TSP. - Haotian Jiang; Jian Li 015; Daogao Liu; Sahil Singla 001 (ITCS, 2020)

Online vector balancing and geometric discrepancy. - Nikhil Bansal 001; Haotian Jiang; Sahil Singla 001; Makrand Sinha (STOC, 2020)

Random-Order Models. - Anupam Gupta 001; Sahil Singla 001 (CoRR, 2020)

Improved truthful mechanisms for combinatorial auctions with submodular bidders. - Sepehr Assadi; Sahil Singla 001 (SIGecom Exch., 2020)

Maximum Matching in the Online Batch-arrival Model. - Euiwoong Lee; Sahil Singla 001 (ACM Trans. Algorithms, 2020)

Bag-Of-Tasks Scheduling on Related Machines. - Anupam Gupta 001; Amit Kumar 001; Sahil Singla 001 (APPROX-RANDOM, 2021)

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. - Danny Segev; Sahil Singla 001 (EC, 2021)

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. - Sepehr Assadi; Thomas Kesselheim; Sahil Singla 001 (SODA, 2021)

Online Discrepancy Minimization for Stochastic Arrivals. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (SODA, 2021)

Formal Barriers to Simple Algorithms for the Matroid Secretary Problem. - Maryam Bahrani; Hedyeh Beyhaghi; Sahil Singla 001; S. Matthew Weinberg (WINE, 2021)

Some results on the spum and the integral spum of graphs. - Sahil Singla 001; Apurv Tiwari; Amitabha Tripathi (Discret. Math., 2021)

Submodular Dominance and Applications. - Frederick Qiu; Sahil Singla 001 (APPROX/RANDOM, 2022)

Smoothed Analysis of the Komlós Conjecture. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ICALP, 2022)

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. - Nikhil Bansal 001; Haotian Jiang; Raghu Meka; Sahil Singla 001; Makrand Sinha (ITCS, 2022)

Robust Secretary and Prophet Algorithms for Packing Integer Programs. - C. J. Argue; Anupam Gupta 001; Marco Molinaro 001; Sahil Singla 001 (SODA, 2022)

Online Discrepancy with Recourse for Vectors and Graphs. - Anupam Gupta 001; Vijaykrishna Gurunathan; Ravishankar Krishnaswamy; Amit Kumar 001; Sahil Singla 001 (SODA, 2022)

Online and Bandit Algorithms Beyond 𝓁p Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (CoRR, 2022)

Submodular Norms with Applications To Online Facility Location and Stochastic Probing. - Kalen Patton; Matteo Russo 002; Sahil Singla 001 (APPROX/RANDOM, 2023)

Online and Bandit Algorithms Beyond ℓp Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (SODA, 2023)

Prophet Inequalities with Linear Correlations and Augmentations. - Nicole Immorlica; Sahil Singla 001; Bo Waggoner (ACM Trans. Economics and Comput., 2023)

Online Combinatorial Allocations and Auctions with Few Samples. - Paul Dütting; Thomas Kesselheim; Brendan Lucier; Rebecca Reiffenhäuser; Sahil Singla 001 (FOCS, 2024)

Sample Complexity of Posted Pricing for a Single Item. - Billy Jin; Thomas Kesselheim; Will Ma; Sahil Singla 001 (NeurIPS, 2024)

Bandit Sequential Posted Pricing via Half-Concavity. - Sahil Singla 001; Yifan Wang (EC, 2024)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies. - Vasilis Livanos; Kalen Patton; Sahil Singla 001 (EC, 2024)

Bandit Algorithms for Prophet Inequality and Pandora's Box. - Khashayar Gatmiry; Thomas Kesselheim; Sahil Singla 001; Yifan Wang (SODA, 2024)

Supermodular Approximation of Norms and Applications. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (STOC, 2024)

Prophet Secretary for Combinatorial Auctions and Matroids. - Soheil Ehsani; MohammadTaghi Hajiaghayi; Thomas Kesselheim; Sahil Singla 001 (SIAM J. Comput., 2024)

Single-Sample and Robust Online Resource Allocation. - Rohan Ghuge; Sahil Singla 001; Yifan Wang (STOC, 2025)

Improved and Oracle-Efficient Online ℓ1-Multicalibration. - Rohan Ghuge; Vidya Muthukumar; Sahil Singla 001 (CoRR, 2025)

Online Combinatorial Optimization with Graphical Dependencies. - Zhimeng Gao; Evangelia Gergatsouli; Kalen Patton; Sahil Singla 001 (CoRR, 2025)