Browse by Journal / Conference

Barman, S and Krishna, A and Kulkarni, P and Narang, S (2024) Sublinear approximation algorithm for nash social welfare with XOS valuations. In: UNSPECIFIED.

Rajput, J and Chandra, G and Jain, C (2023) Co-Linear Chaining on Pangenome Graphs. In: 23rd International Workshop on Algorithms in Bioinformatics, WABI 2023, 4-6 September 2023, Bangalore, India.

Barman, S and Kulkarni, P (2023) Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.

Amireddy, P and Garg, A and Kayal, N and Saha, C and Thankey, B (2023) Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, 10 - 14 July 2023, Paderborn.

Khan, A and Sharma, E and Sreenivas, KVN (2022) Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. In: Leibniz International Proceedings in Informatics, LIPIcs, 18 - 20 December 2022, Chennai.

Joshi, U and Rahul, S and Thoppil, JJ (2022) A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. In: Leibniz International Proceedings in Informatics, LIPIcs, 18 - 20 December 2022, Chennai.

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.

Kar, D and Khan, A and Wiese, A (2022) Approximation Algorithms for Round-UFP and Round-SAP. In: 30th Annual European Symposium on Algorithms, ESA 2022, 5 - 9 September 2022, Berlin/Potsdam.

Bhargava, V and Garg, A and Kayal, N and Saha, C (2022) Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. 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.

Ayyadevara, N and Dabas, R and Khan, A and Sreenivas, KVN (2022) Near-Optimal Algorithms for Stochastic Online Bin Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Jansen, K and Khan, A and Lira, M and Sreenivas, KVN (2022) A PTAS for Packing Hypercubes into a Knapsack. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Khan, A and Lonkar, A and Maiti, A and Sharma, A and Wiese, A (2022) Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. In: 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022, 4 - 8 July 2022, Paris.

Kanukurthi, B and Bhavana Obbattu, SL and Sekar, S and Tomy, J (2021) Locally reconstructable non-malleable secret sharing. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021, 23 - 26 July 2021, Virtual, Bertinoro.

Chan, TM and Rahul, S (2021) Simple multi-pass streaming algorithms for skyline points and extreme points. In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16 -19 March 2021, Virtual, Saarbrucken.

Banchhor, S and Gajjala, R and Sabharwal, Y and Sen, S (2021) Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 15-17 Dec 2021, Virtual, Online.

Sharma, E (2021) Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 15-17 Dec 2021, Virtual, Online.

Saha, C and Thankey, B (2021) Hitting sets for orbits of circuit classes and polynomial families. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021, 16-18 Aug 2021, Bengaluru; India.

Gálvez, W and Grandoni, F and Khan, A and Ramírez-Romero, D and Wiese, A (2021) Improved approximation algorithms for 2-dimensional knapsack: Packing into multiple L-shapes, spirals, and more. In: 37th International Symposium on Computational Geometry (SoCG 2021), June 7-11, 2021.

Khan, A and Maiti, A and Sharma, A and Wiese, A (2021) On guillotine separable packings for the two-dimensional geometric knapsack problem. In: 37th International Symposium on Computational Geometry, SoCG 2021, 7-11, June 2021, Virtual, Buffalo.

Holla, R and Deka, N and DSouza, D (2021) On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics. In: Leibniz International Proceedings in Informatics, LIPIcs, 213 .

Deppert, MA and Jansen, K and Khan, A and Rau, M and Tutas, M (2021) Peak demand minimization via sliced strip packing. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 Aug 2021, Seattle.

Khan, A and Sharma, E (2021) Tight approximation algorithms for geometric bin packing with skewed items. In: 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 16-18 aug 2021, Seattle.

Barman, S and Bhaskar, U and Krishna, A and Sundaram, RG (2020) Tight approximation algorithms for p-mean welfare under subadditive valuations. In: Leibniz International Proceedings in Informatics, LIPIcs, 7- 9 September 2020, Virtual, Pisa.

Albers, S and Khan, A and Ladewig, L (2020) Best fit bin packing with random order revisited. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague; Czech Republic.

Murthy, J and Nair, V and Saha, C (2020) Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague; Czech Republic.

Khan, A and Pittu, MR (2020) On guillotine separability of squares and rectangles. In: Leibniz International Proceedings in Informatics, LIPIcs, 17-19 August 2020, Virtual, Online.

Gupta, N and Saha, C and Thankey, B (2020) A super-quadratic lower bound for depth four arithmetic circuits. In: Leibniz International Proceedings in Informatics, LIPIcs, 28 July - 31 July 2020, Virtual, Online.

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.

Har-Peled, S and Jones, M and Rahul, S (2020) Active learning a convex body in low dimensions. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 8-11, July 2020, Germany.

Ganesh, C and Magri, B and Venturi, D (2020) Cryptographic reverse firewalls for interactive proof systems. In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, 8-11, July 2020, Germany.

DCosta, J and Lefaucheux, E and Ouaknine, J and Worrell, J (2020) How fast can you escape a compact polytope? In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, 10-13 March 2020, France.

Louis, A and Venkat, R (2019) Planted models for k-way edge and vertex expansion. In: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, 11-13 December 2019, Institute of Technology BombayBombay; India.

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.

Garg, A and Gupta, N and Kayal, N and Saha, C (2019) Determinant equivalence test over finite fields and over q. In: 46th International Colloquium on Automata, Languages, and Programming, 7 July 2019 - 12 July 2019, Patras.

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.

Louis, A and Venkat, R (2018) Semi-random graphs with planted sparse vertex cuts: Algorithms for exact and approximate recovery. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9 - 13 July 2018, Prague.

Kumar, A and Louis, A and Tulsiani, M (2018) Finding pseudorandom colorings of pseudorandom graphs. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017), 12 - 14 December 2017, Kanpur.

Babichenko, Y and Barman, S (2017) Algorithmic aspects of private Bayesian persuasion. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, 9 - 11 January 2017, Berkeley.

Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2017) Brief announcement: Crash-tolerant consensus in directed graph revisited. In: 31st International Symposium on Distributed Computing, DISC 2017, 16 - 20 October 2017, Vienna.

Bhattacharyya, A and Gopi, S and Tal, A (2017) Lower bounds for 2-query LCCs over large alphabet. In: 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2017 and the 21st International Workshop on Randomization and Computation, RANDOM 2017, 16 - 18 August 2017, Berkeley.

Kayal, N and Nair, V and Saha, C and Tavenas, S (2017) Reconstruction of full rank algebraic branching programs. In: Leibniz International Proceedings in Informatics, LIPIcs, 79 (1).

Chandran, S and Issac, D and Karrenbauer, A (2017) On the parameterized complexity of BicliqueCover and partition. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24 - 26 August 2016, Aarhus.