|
 | Up a level |
Ghoshal, S and Louis, A (2022) Approximating CSPs with Outliers. In: 25th International Conference on Approximation Algorithms for Combinatorial Optimization Problems and the 26th International Conference on Randomization and Computation, APPROX/RANDOM 2022, 19 - 21 September 2022, Virtual, Urbana-Champaign.
Bhattacharyya, A and Sunil Chandran, L and Ghoshal, S (2020) Combinatorial lower bounds for 3-query LDCs. In: Leibniz International Proceedings in Informatics, LIPIcs, 12 - 14 January 2020, Seattle.
Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2020) Tight Approximation Bounds for Maximum Multi-coverage. In: 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, 8-10 Jun 2020, London, pp. 66-77.
Ghoshal, S and Louis, A and Raychaudhury, R (2019) Approximation algorithms for partially colorable graphs. In: 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 23rd International Conference on Randomization and Computation, APPROX/RANDOM 2019, 20 - 22 September 2019, Cambridge.
Bhattacharyya, A and Ghoshal, S and Saket, R (2018) Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. In: 31st Annual Conference on Learning Theory, COLT 2018, 6 - 9 July 2018, Stockholm, pp. 876-917.
Bhattacharyya, A and Ghoshal, S and Karthik, CS and Manurangsi, P (2018) Parameterized intractability of even set and shortest vector problem from gap-ETH. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9 - 13 July 2018, Prague.
Barman, S and Bhattacharyya, A and Ghoshal, S (2018) Testing sparsity over known and unknown bases. In: 35th International Conference on Machine Learning, ICML 2018, 10 - 15 July 2018, Stockholm, pp. 819-843.
Barman, S and Fawzi, O and Ghoshal, S and Gürpınar, E (2022) Tight approximation bounds for maximum multi-coverage. In: Mathematical Programming, 192 (1-2). pp. 443-476.
