Validity of heavy traffic steady-state approximations in generalized Jackson networks D Gamarnik, A Zeevi The Annals of Applied Probability 16 (1), 56-90, 2006 | 182 | 2006 |

Simple deterministic approximation algorithms for counting matchings M Bayati, D Gamarnik, D Katz, C Nair, P Tetali Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 136 | 2007 |

The diameter of a long-range percolation graph D Coppersmith, D Gamarnik, M Sviridenko Mathematics and computer science II, 147-159, 2002 | 136 | 2002 |

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs M Bayati, D Gamarnik, P Tetali Proceedings of the forty-second ACM symposium on Theory of computing, 105-114, 2010 | 133 | 2010 |

Asymptotically optimal algorithms for job shop scheduling and packet routing D Bertsimas, D Gamarnik Journal of Algorithms 33 (2), 296-318, 1999 | 125 | 1999 |

Finding long chains in kidney exchange using the traveling salesman problem R Anderson, I Ashlagi, D Gamarnik, AE Roth Proceedings of the National Academy of Sciences 112 (3), 663-668, 2015 | 113 | 2015 |

Limits of local algorithms over sparse random graphs D Gamarnik, M Sudan Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 109 | 2014 |

Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions D Bertsimas, D Gamarnik, JN Tsitsiklis Annals of Applied Probability, 1384-1428, 2001 | 102 | 2001 |

Belief propagation for min-cost network flow: Convergence and correctness D Gamarnik, D Shah, Y Wei Operations research 60 (2), 410-428, 2012 | 94 | 2012 |

Random MAX SAT, random MAX CUT, and their phase transitions D Coppersmith, D Gamarnik, MT Hajiaghayi, GB Sorkin Random Structures & Algorithms 24 (4), 502-545, 2004 | 94 | 2004 |

A dynamic model of barter exchange R Anderson, I Ashlagi, D Gamarnik, Y Kanoria Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 87 | 2014 |

Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method D Gamarnik, T Nowicki, G Swirszcz Random Structures & Algorithms 28 (1), 76-106, 2006 | 87 | 2006 |

Stability conditions for multiclass fluid queueing networks D Bertsimas, D Gamarnik, JN Tsitsiklis IEEE Transactions on Automatic Control 41 (11), 1618-1631, 1996 | 84 | 1996 |

The need for (long) chains in kidney exchange I Ashlagi, D Gamarnik, MA Rees, AE Roth National Bureau of Economic Research, 2012 | 82 | 2012 |

Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models A Bandyopadhyay, D Gamarnik Random Structures & Algorithms 33 (4), 452-479, 2008 | 80 | 2008 |

A model for understanding the impacts of demand and capacity on waiting time to enter a congested recovery room T Schoenmeyr, PF Dunn, D Gamarnik, R Levi, DL Berger, BJ Daily, ... The Journal of the American Society of Anesthesiologists 110 (6), 1293-1304, 2009 | 79 | 2009 |

Join the shortest queue with many servers. The heavy-traffic asymptotics P Eschenfeldt, D Gamarnik Mathematics of Operations Research 43 (3), 867-886, 2018 | 73 | 2018 |

Efficient dynamic barter exchange R Anderson, I Ashlagi, D Gamarnik, Y Kanoria Operations Research 65 (6), 1446-1459, 2017 | 67 | 2017 |

Correlation decay and deterministic FPTAS for counting list-colorings of a graph D Gamarnik, D Katz arXiv preprint math/0606143, 2006 | 66 | 2006 |

An improved upper bound for the TSP in cubic 3-edge-connected graphs D Gamarnik, M Lewenstein, M Sviridenko Operations Research Letters 33 (5), 467-474, 2005 | 65 | 2005 |