1. Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient;Algorithmica;2022-02-26
2. Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity;Lecture Notes in Computer Science;2017
3. The Power of Dynamic Distance Oracles;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14
4. Online Bipartite Matching in Offline Time;2014 IEEE 55th Annual Symposium on Foundations of Computer Science;2014-10
5. Dynamic Connectivity: Connecting to Networks and Geometry;2008 49th Annual IEEE Symposium on Foundations of Computer Science;2008-10