E-LIB Suche - Ergebnisse für: Tetali, Prasad

1

On Min Sum Vertex Cover and Generalized Min Sum Set Cover:

Bansal, Nikhil ; Batra, Jatin ; Farhadi, Majid.
SIAM Journal on Computing. 52 (2023) 2 - p. 327-357 , 2023

2

On the zeroes of hypergraph independence polynomials:

Galvin, David ; McKinley, Gwen ; Perkins, Will..
Combinatorics, Probability and Computing. 33 (2023) 1 - p. 65-84 , 2023

Link: https://doi.org/10.1017/..

3

Hardness and approximation of submodular minimum linear ord..:

Farhadi, Majid ; Gupta, Swati ; Sun, Shengding..
Mathematical Programming. , 2023

Link: https://doi.org/10.1007/..

4

Determinant Maximization via Matroid Intersection Algorithm:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Brown, Adam ; Laddha, Aditi ; Pittu, Madhusudhan.. - p. 255-266 , 2022

Link: https://doi.org/10.1109/..

5

Efficient sampling and counting algorithms for the Potts mo..:

Borgs, Christian ; Chayes, Jennifer ; Helmuth, Tyler..
Random Structures & Algorithms. 63 (2022) 1 - p. 130-170 , 2022

Link: https://doi.org/10.1002/..

6

On the bipartiteness constant and expansion of Cayley graph:

Moorman, Nina ; Ralli, Peter ; Tetali, Prasad
European Journal of Combinatorics. 102 (2022) - p. 103481 , 2022

Link: https://doi.org/10.1016/..

7

On the number of independent sets in uniform, regular, line..:

Cohen, Emma ; Perkins, Will ; Sarantis, Michail.
European Journal of Combinatorics. 99 (2022) - p. 103401 , 2022

Link: https://doi.org/10.1016/..

8

Improved Approximations for Min Sum Vertex Cover and Genera..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Bansal, Nikhil ; Batra, Jatin ; Farhadi, Majid. - p. 998-1005 , 2021

Link: https://doi.org/10.1137/..

9

Improved approximations for min sum vertex cover and genera..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Bansal, Nikhil ; Batra, Jatin ; Farhadi, Majid. - p. 986-1005 , 2021

Link: https://dl.acm.org/doi/1..

10

Markov Chain-Based Sampling for Exploring RNA Secondary Str..:

Kirkpatrick, Anna ; Patton, Kalen ; Tetali, Prasad.
Mathematical and Computational Applications. 25 (2020) 4 - p. 67 , 2020

Link: https://doi.org/10.3390/..

11

Efficient sampling and counting algorithms for the Potts mo..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,

Borgs, Christian ; Chayes, Jennifer ; Helmuth, Tyler.. - p. 738-751 , 2020

Link: https://dl.acm.org/doi/1..

12

Volume Growth, Curvature, and Buser-Type Inequalities in Gr..:

Benson, Brian ; Ralli, Peter ; Tetali, Prasad
International Mathematics Research Notices. 2021 (2019) 22 - p. 17091-17139 , 2019

Link: https://doi.org/10.1093/..

13

Finding cliques using few probes:

Feige, Uriel ; Gamarnik, David ; Neeman, Joe..
Random Structures & Algorithms. 56 (2019) 1 - p. 142-153 , 2019

Link: https://doi.org/10.1002/..

14

Algebraic Connectivity Under Site Percolation in Finite Wei..:

Bahmani, Sohail ; Romberg, Justin ; Tetali, Prasad
IEEE Transactions on Network Science and Engineering. 5 (2018) 2 - p. 86-91 , 2018

Link: https://doi.org/10.1109/..

15

Phase Coexistence for the Hard-Core Model on ℤ2:

BLANCA, ANTONIO ; CHEN, YUXUAN ; GALVIN, DAVID..
Combinatorics, Probability and Computing. 28 (2018) 1 - p. 1-22 , 2018

Link: https://doi.org/10.1017/..