| 2018 | SODA | Minimum Cut of Directed Planar Graphs in | Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann |
| 2012 | FOCS | Single Source - All Sinks Max Flows in Planar Digraphs. | Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2012 | SODA | Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
| 2011 | FOCS | Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. | Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen |
| 2011 | STOC | Improved algorithms for min cut and max flow in undirected planar graphs. | Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2011 | STACS | Minimum s-t cut in undirected planar graphs when the source and the sink are close. | Haim Kaplan, Yahav Nussbaum |
| 2011 | WADS | Improved Distance Queries in Planar Graphs. | Yahav Nussbaum |
| 2009 | ESA | Maximum Flow in Directed Planar Graphs with Vertex Capacities. | Haim Kaplan, Yahav Nussbaum |
| 2009 | ESA | Linear-Time Recognition of Probe Interval Graphs. | Ross M. McConnell, Yahav Nussbaum |
| 2008 | WG | From a Circular-Arc Model to a Proper Circular-Arc Model. | Yahav Nussbaum |
| 2006 | WG | Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. | Haim Kaplan, Yahav Nussbaum |