On the zeroes of hypergraph independence polynomials D Galvin, G McKinley, W Perkins, M Sarantis, P Tetali Combinatorics, Probability and Computing 33 (1), 65-84, 2024 | 4 | 2024 |
Hardness and approximation of submodular minimum linear ordering problems M Farhadi, S Gupta, S Sun, P Tetali, MC Wigal Mathematical Programming, 1-42, 2023 | 1 | 2023 |
Note on the number of antichains in generalizations of the Boolean lattice J Park, M Sarantis, P Tetali arXiv preprint arXiv:2305.16520, 2023 | | 2023 |
On min sum vertex cover and generalized min sum set cover N Bansal, J Batra, M Farhadi, P Tetali SIAM Journal on Computing 52 (2), 327-357, 2023 | 4 | 2023 |
Determinant maximization via matroid intersection algorithms A Brown, A Laddha, M Pittu, M Singh, P Tetali 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 3 | 2022 |
Multi Purpose Routing: New Perspectives and Approximation Algorithms M Farhadi, J Moondra, P Tetali, A Toriello arXiv preprint arXiv:2208.04410, 2022 | | 2022 |
On the bipartiteness constant and expansion of Cayley graphs N Moorman, P Ralli, P Tetali European Journal of Combinatorics 102, 103481, 2022 | 7 | 2022 |
On the number of independent sets in uniform, regular, linear hypergraphs E Cohen, W Perkins, M Sarantis, P Tetali European Journal of Combinatorics 99, 103401, 2022 | 4 | 2022 |
Volume growth, curvature, and Buser-type inequalities in graphs B Benson, P Ralli, P Tetali International Mathematics Research Notices 2021 (22), 17091-17139, 2021 | 7 | 2021 |
The traveling firefighter problem M Farhadi, A Toriello, P Tetali SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21 …, 2021 | 4 | 2021 |
Improved approximations for min sum vertex cover and generalized min sum set cover N Bansal, J Batra, M Farhadi, P Tetali Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 21 | 2021 |
Toppleable permutations, excedances and acyclic orientations A Ayyer, D Hathcock, P Tetali arXiv preprint arXiv:2010.11236, 2020 | 6 | 2020 |
Markov chain-based sampling for exploring RNA secondary structure under the nearest neighbor thermodynamic model and extended applications A Kirkpatrick, K Patton, P Tetali, C Mitchell Mathematical and Computational Applications 25 (4), 67, 2020 | 5 | 2020 |
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures C Borgs, J Chayes, T Helmuth, W Perkins, P Tetali Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 39 | 2020 |
& Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric M Farhadi, A Louis, M Singh, P Tetali arXiv preprint arXiv:2003.05582, 2020 | | 2020 |
On the complexity and approximation of λ∞ spread constant and maximum variance embedding M Farhadi, A Louis, P Tetali CoRR, abs/2003.05582, 2020 | 1 | 2020 |
Finding cliques using few probes U Feige, D Gamarnik, J Neeman, MZ Rácz, P Tetali Random Structures & Algorithms 56 (1), 142-153, 2020 | 14 | 2020 |
Efficient sampling and counting algorithms for the Potts model on at all temperatures C Borgs, J Chayes, T Helmuth, W Perkins, P Tetali arXiv preprint arXiv:1909.09298, 2019 | | 2019 |
Concentration, Relaxation and Mixing time for Restricted Lattices A Ben-Hamou, E Cohen, C Roberto, PM Samson, A Stauffer, P Tetali | | 2019 |
Transport Proofs Of Some Discrete Variants Of The Pr {\'e} Kopa-leindler Inequality N Gozlan, C Roberto, PM Samson, P Tetali arXiv preprint arXiv:1905.04038, 2019 | 8 | 2019 |