1. Assadi, S., Bernstein, A.: Towards a unified theory of sparsification for matching problems. In: 2nd Symposium on Simplicity in Algorithms, 8–9 January 2019 - San Diego, CA, USA, pages 11:1–11:20 (2019)
2. Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem with (very) few queries. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, Maastricht, The Netherlands, 24–28 July 2016, pp. 43–60 (2016). https://doi.org/10.1145/2940716.2940769
3. Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem: beating half with a non-adaptive algorithm. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, Cambridge, MA, USA, 26–30 June 2017, pp. 99–116 (2017). https://doi.org/10.1145/3033274.3085146
4. Baswana, S., Chaudhury, S.R., Choudhary, K., Khan, S.: Dynamic DFS in undirected graphs: breaking the O(m) barrier. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January 2016, pp. 730–739 (2016)
5. Baswana, S., Choudhary, K., Roditty, L.: Fault tolerant reachability for directed graphs. In: Proceedings of the 29th International Symposium on istributed Computing - DISC 2015, Tokyo, Japan, 7–9 October 2015, pp. 528–543 (2015)