Recognition of circular-arc graphs and some subclasses. - Yahav Nussbaum (2007)

From a Circular-Arc Model to a Proper Circular-Arc Model. - Yahav Nussbaum (WG, 2008)

Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. - Haim Kaplan; Yahav Nussbaum (Discret. Appl. Math., 2009)

Multiple-source multiple-sink maximum flow in planar graphs - Yahav Nussbaum (CoRR, 2010)

Minimum s-t cut in undirected planar graphs when the source and the sink are close. - Haim Kaplan; Yahav Nussbaum (STACS, 2011)

Improved algorithms for min cut and max flow in undirected planar graphs. - Giuseppe F. Italiano; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen (STOC, 2011)

Improved Distance Queries in Planar Graphs. - Yahav Nussbaum (WADS, 2011)

Maximum Flow in Directed Planar Graphs with Vertex Capacities. - Haim Kaplan; Yahav Nussbaum (Algorithmica, 2011)

A Simpler Linear-Time Recognition of Circular-Arc Graphs. - Haim Kaplan; Yahav Nussbaum (Algorithmica, 2011)

Single Source - All Sinks Max Flows in Planar Digraphs. - Jakub Lacki; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen (FOCS, 2012)

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. - Haim Kaplan; Shay Mozes; Yahav Nussbaum; Micha Sharir (SODA, 2012)

Min-Cost Flow Duality in Planar Networks. - Haim Kaplan; Yahav Nussbaum (CoRR, 2013)

Isomorphism of graph classes related to the circular-ones property. - Andrew R. Curtis; Min Chih Lin; Ross M. McConnell; Yahav Nussbaum; Francisco J. Soulignac; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2013)

Recognition of probe proper interval graphs. - Yahav Nussbaum (Discret. Appl. Math., 2014)

Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. - Shay Mozes; Cyril Nikolaev; Yahav Nussbaum; Oren Weimann (CoRR, 2015)

Linear-Time Recognition of Probe Interval Graphs. - Ross M. McConnell; Yahav Nussbaum (SIAM J. Discret. Math., 2015)

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 (SIAM J. Comput., 2017)

Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. - Haim Kaplan; Shay Mozes; Yahav Nussbaum; Micha Sharir (ACM Trans. Algorithms, 2017)

Minimum Cut of Directed Planar Graphs in O(n log log n) Time. - Shay Mozes; Kirill Nikolaev 003; Yahav Nussbaum; Oren Weimann (SODA, 2018)

Faster shortest paths in dense distance graphs, with applications. - Shay Mozes; Yahav Nussbaum; Oren Weimann (Theor. Comput. Sci., 2018)